Name
Abstract | ||
|---|---|---|
In this paper, we count small cycles in generalized de Bruijn digraphs. Let n = pd(h), where d inverted iota p, and g(l) = gcd(d(l) 1, n). We show that if p < d(3) and k less than or equal to right perpendicular log(d) n left perpendicular + 1, or p > d(3) and k less than or equal to h + 3, then the number of cycles of length k in a generalized de Bruijn digraph G(B)(n, d) is given by 1/k Sigma(l/k)mu(k/l)g(i) inverted right perpendicular d(l)/g(i) inverted left perpendicular, where mu is the Mobius function and inverted right perpendicular r inverted left perpendicular denotes the smallest integer not smaller than a real number r. (C) 1997 John Wiley & Sons, Inc. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1002/(SICI)1097-0037(199701)29:1<39::AID-NET4>3.0.CO;2-D | NETWORKS |
Field | DocType | Volume |
Graph theory,Integer,Discrete mathematics,Combinatorics,De bruijn digraph,Upper and lower bounds,Cycle graph,Möbius function,De Bruijn sequence,Real number,Mathematics | Journal | 29 |
Issue | ISSN | Citations |
1 | 0028-3045 | 6 |
PageRank | References | Authors |
0.57 | 1 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Toru Hasunuma | 1 | 142 | 16.00 |
| Yukio Shibata | 2 | 73 | 8.82 |