On rationality of generating function for the number of spanning trees in circulant graphs
Abstract
Let F(x)=Σn=1∞τ(n)xn be the generating function for the number τ(n) of spanning trees in the circulant graphs Cn(s1,s2,…,sk). We show that F(x) is a rational function with integer coefficients satisfying the property F(x)=F(1/x). A similar result is also true for the circulant graphs of odd valency C2n(s1,s2,…,sk,n). We illustrate the obtained results by a series of examples.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.