The cycle length distribution sequence of a graph 
is the sequence 
, in which 
is the number of graph cycles
of length 
in 
and 
is the graph circumference
of 
(Harary and Palmer 1973, p. 266). Equivalently, it is the coefficient list of
the cycle polynomial, starting with the coefficient
of 
and retaining zero entries for missing cycle lengths up through 
.
Cycle Length Distribution Sequence
See also
Cycle Polynomial, Graph Cycle, Girth, Graph CircumferenceExplore with Wolfram|Alpha
References
Harary, F. and Palmer, E. M. "A Survey of Graphical Enumeration Problems." In A Survey of Combinatorial Theory (Ed. J. N. Srivastava). Amsterdam, Netherlands: North-Holland, pp. 259-275, 1973.Cite this as:
Weisstein, Eric W. "Cycle Length Distribution Sequence." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/CycleLengthDistributionSequence.html