Author/Authors :
Toru Hasunuma، نويسنده , , Yosuke Kikuchi، نويسنده , , Takeshi Mori، نويسنده , , Yukio Shibata، نويسنده ,
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⩽logd n+1,
•
d7d+1
Keywords :
Counting , Cycles , interconnection networks , Generalized Kautz digraphs
Journal title :
Discrete Mathematics
Journal title :
Discrete Mathematics