pith. sign in

arxiv: 1811.03803 · v1 · pith:KT62M6FCnew · submitted 2018-11-09 · 🧮 math.CO

On rationality of generating function for the number of spanning trees in circulant graphs

classification 🧮 math.CO
keywords circulantfunctiongraphsgeneratingldotsnumberspanningtrees
0
0 comments X
read the original abstract

Let $F(x)=\sum\limits_{n=1}^\infty\tau(n)x^n$ be the generating function for the number $\tau(n)$ of spanning trees in the circulant graphs $C_{n}(s_1,s_2,\ldots,s_k).$ 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 $C_{2n}(s_1,s_2,\ldots,s_k,n).$ We illustrate the obtained results by a series of examples.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.