Cycle Length Distribution Sequence
The cycle length distribution sequence of a graph G is the sequence (c_3,c_4,...,c_p), in which c_n is the number of graph cycles of length n in G and p is the graph circumference of G (Harary and Palmer 1973, p. 266). Equivalently, it is the coefficient list of the cycle polynomial, starting with the coefficient of x^3 and retaining zero entries for missing cycle lengths up through p.
See also
Cycle Polynomial, Graph Cycle, Girth, Graph CircumferenceExplore with Wolfram|Alpha
WolframAlpha
More things to try:
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