On the Diameter of the Generalized Graphs UG(B)(n, m), n(2) < m <= n(3)
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
182 | en_US |
dc.citation.issue |
4 | en_US |
dc.citation.spage |
180 | en_US |
dc.citation.volume |
52 | en_US |
dc.citation.woscount |
0 | |
dc.contributor.author |
Kuo, Jyhmin | en_US |
dc.contributor.author |
Fu, Hung-Lin | en_US |
dc.contributor.department |
應用數學系 | zh_TW |
dc.contributor.department |
Department of Applied Mathematics | en_US |
dc.date.accessioned |
2014-12-08T15:10:36Z | |
dc.date.available |
2014-12-08T15:10:36Z | |
dc.date.issued |
2008-12-01 | en_US |
dc.description.abstract |
The generalized de Bruijn digraph G(B)(n, m) is the digraph (V, A) where V = {0, 1, ..., m-1) and (i, j) is an element of A if and only if j equivalent to in + alpha (mod m) for some alpha is an element of {0, 1, 2, ..., n-1}. By replacing each arc of G(B)(n, m) with an undirected edge and eliminating loops and multi-edges, we obtain the generalized undirected de Bruijn graph UG(B)(n, m). In this article, we prove that when 2n(2) <= m <= n(3) the diameter of UG(B)(n, m) is equal to 3. We also show that for pairs (n, m) where n(2) < m < 2n(2) the diameter of UG(B) (n, m) can be 2 or 3. (C) 2008 Wiley Periodicals, Inc. NETWORKS, Vol. 52(4), 180-182 2008 | en_US |
dc.identifier.doi |
10.1002/net.20228 | 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.20228 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/8116 | |
dc.identifier.wosnumber |
WOS:000261464700002 | |
dc.language.iso |
en_US | en_US |
dc.subject |
generalized de Bruijn graph | en_US |
dc.subject |
diameter | en_US |
dc.subject |
undirected graph | en_US |
dc.title |
On the Diameter of the Generalized Graphs UG(B)(n, m), n(2) < m <= n(3) | en_US |
dc.type |
Article | en_US |
檔案
- 000261464700002.pdf (83.8 KB, Adobe PDF)
所屬典藏: 期刊論文