On the spanning w-wide diameter of the star graph
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
249 | en_US |
dc.citation.issue |
4 | en_US |
dc.citation.spage |
235 | en_US |
dc.citation.volume |
48 | en_US |
dc.citation.woscount |
6 | |
dc.contributor.author |
Lin, Cheng-Kuan | en_US |
dc.contributor.author |
Huang, Hua-Min | en_US |
dc.contributor.author |
Hsu, D. Frank | en_US |
dc.contributor.author |
Hsu, Lih-Hsing | en_US |
dc.contributor.department |
資訊工程學系 | zh_TW |
dc.contributor.department |
Department of Computer Science | en_US |
dc.date.accessioned |
2014-12-08T15:15:17Z | |
dc.date.available |
2014-12-08T15:15:17Z | |
dc.date.issued |
2006-12-01 | en_US |
dc.description.abstract |
Let a and v be any two distinct nodes of an undirected graph G, which is k-connected. A container C(u, v) between a and v is a set of internally disjoint paths {P(1), P(2),..., P(W)} between a and v where 1 <= w <= k. The width of C(u, v) is w and the length of C(u, v) {written as I[C(u, v)]} is max{I(P(i)) 1 <= I <= w}. A w-container C(u, v) is a container with width w. The w-wide distance between u and v, d(w)(u, v), is min{I(C(u, v)) C(u, v) is a w-container). A w-container C(u, v) of the graph G is a w*-container if every node of G is incident with a path in C(u, v). That means that the w-container C(u, v) spans the whole graph. Let S(n) be the n-dimensional star graph with n >= 5. It is known that S(n) is bipartite. In this article, we show that, for any pair of distinct nodes u and v in different partite sets of S(n), there exists an (n - 1)*-container C(u, v) and the (n - 1)-wide distance d((n-1))(u, v) is less than or equal to n!/n-2 + 1. In addition, we also show the existence of a 2*-container C(u, v) and the 2-wide distance d(2)(u, v) is bounded above by nI/2 + 1. (C) 2006 Wiley Periodicals, Inc. | en_US |
dc.identifier.doi |
10.1002/net.20135 | en_US |
dc.identifier.issn |
0028-3045 | en_US |
dc.identifier.journal |
NETWORKS | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1002/net.20135 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/11469 | |
dc.identifier.wosnumber |
WOS:000241963400006 | |
dc.language.iso |
en_US | en_US |
dc.subject |
diameter | en_US |
dc.subject |
hamiltonian | en_US |
dc.subject |
hamiltonian laceable | en_US |
dc.subject |
star graphs | en_US |
dc.title |
On the spanning w-wide diameter of the star graph | en_US |
dc.type |
Article | en_US |
檔案
- 000241963400006.pdf (401.8 KB, Adobe PDF)
所屬典藏: 期刊論文