Name
Abstract | ||
|---|---|---|
In this paper, we count cycles in a generalized Kautz digraph GK(n,d). Let n=pdh such that dm̸|p. Also let gl=gcd(dl−(−1)l,n). We show that if one of the following conditions holds: •p⩽d7d+1 and k⩽logdn+1,•d7d+1<p<d5(d+1) and k⩽logdnp2(d+1)3+103,•d5(d+1)<p and k⩽logdnd+1
then the number of cycles of length k in GK(n,d) is given by1k∑l|kμkl(dl+(−1)l(gl−1)),where μ is the Möbius function. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1016/j.disc.2004.01.014 | Discrete Mathematics |
Keywords | Field | DocType |
Counting,Cycles,Generalized Kautz digraphs,Interconnection networks | Discrete mathematics,Combinatorics,Möbius function,Kautz digraph,Mathematics | Journal |
Volume | Issue | ISSN |
285 | 1 | 0012-365X |
Citations | PageRank | References |
4 | 0.45 | 7 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Toru Hasunuma | 1 | 142 | 16.00 |
| Yosuke Kikuchi | 2 | 83 | 6.50 |
| Takeshi Mori | 3 | 4 | 0.45 |
| Yukio Shibata | 4 | 18 | 2.61 |