On the diameter of the generalized undirected de Bruijn graphs UGB(n, m), n2 < m <= n3

نویسندگان

  • Jyhmin Kuo
  • Hung-Lin Fu
چکیده

The generalized deBruijn digraphGB(n,m) is the digraph (V ,A)where V = {0, 1, . . . ,m−1} and (i , j ) ∈ A if and only if j ≡ in + α (mod m) for some α ∈ {0, 1, 2, . . . ,n − 1}. By replacing each arc of GB(n,m) with an undirected edge and eliminating loops and multi-edges, we obtain the generalized undirected de Bruijn graph UGB(n,m). In this article, we prove that when 2n2 ≤ m ≤ n3 the diameter of UGB(n,m) is equal to 3. We also show that for pairs (n,m)where n2 < m < 2n2 the diameter ofUGB(n,m) can be 2 or 3. © 2008 Wiley Periodicals, Inc. NETWORKS, Vol. 52(4), 180–182 2008

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Domination Numbers of Generalized de Bruijn Digraphs and Generalized Kautz Digraphs

This work deals with the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs. Dominating sets for digraphs are not familiar compared with dominating sets for undirected graphs. Whereas dominating sets for digraphs have more applications than those for undirected graphs. We construct dominating sets of generalized de Bruijn digraphs where obtained dominating sets ...

متن کامل

Wide diameters of de Bruijn graphs

The wide diameter of a graph is an important parameter to measure faulttolerance of interconnection network. This paper proves that for any two vertices in de Bruijn undirected graph UB(d,n), there are 2d − 2 internally disjoint paths of length at most 2n + 1. Therefore, the (2d − 2)-wide diameter of UB(d,n) is not greater than 2n+ 1.

متن کامل

Constructing Generalized Universal Traversing Sequences of Polynomial Size for Graphs with Small Diameter (Extended Abstract)

The paper constructs a generalized version of universal traversing sequences. The generalization preserves the features of the universal traversing sequences that make them attractive for applications to derandomizations and space-bounded computation. For every n, a sequence is constructed that is used by a finite-automaton with 0(1) states in order to traverse all the n-vertex labeled undirect...

متن کامل

On m-restricted edge connectivity of undirected generalized De Bruijn graphs

This article may be used for research, teaching, and private study purposes. Any substantial or systematic reproduction, redistribution, reselling, loan, sub-licensing, systematic supply, or distribution in any form to anyone is expressly forbidden. The publisher does not give any warranty express or implied or make any representation that the contents will be complete or accurate or up to date...

متن کامل

Broadcasting and Gossiping on De Bruijn, Shuue-exchange and Similar Networks Broadcasting and Gossiping on De Bruijn, Shuue-exchange and Similar Networks

We use simple compound properties of de Bruijn related networks to get new bounds about broadcasting and gossiping on such networks. We get some asymptotically optimal results on undi-rected de Bruijn, Kautz, and generalization of the shuue-exchange networks. Our techniques allow more generally to derive eecient broadcasting protocols for the undirected graph associated to a line digraph. As ex...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Ars Comb.

دوره 106  شماره 

صفحات  -

تاریخ انتشار 2008