TOPICS
Search

Chordless Cycle Polynomial

DOWNLOAD Mathematica NotebookDownload Wolfram Notebook

The chordless cycle polynomial of a graph may be defined as

C(x)=sum_(k=4)^(k_(max))c_kx^k,

where c_k is the number of chordless cycles (of length at least four) and k_(max) is the length of a largest chordless cycles.

Precomputed chordless cycles of many graphs are implemented in the Wolfram Language as GraphData[g, "ChordlessCyclePolynomial"][x].

See also

Chordless Cycle, Cycle Chord

Explore with Wolfram|Alpha

Cite this as:

Weisstein, Eric W. "Chordless Cycle Polynomial." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/ChordlessCyclePolynomial.html