English

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

Combinatorics 2018-11-12 v1

Abstract

Let F(x)=n=1τ(n)xnF(x)=\sum\limits_{n=1}^\infty\tau(n)x^n be the generating function for the number τ(n)\tau(n) of spanning trees in the circulant graphs Cn(s1,s2,,sk).C_{n}(s_1,s_2,\ldots,s_k). We show that F(x)F(x) is a rational function with integer coefficients satisfying the property F(x)=F(1/x).F(x)=F(1/x). A similar result is also true for the circulant graphs of odd valency C2n(s1,s2,,sk,n).C_{2n}(s_1,s_2,\ldots,s_k,n). We illustrate the obtained results by a series of examples.

Keywords

Cite

@article{arxiv.1811.03803,
  title  = {On rationality of generating function for the number of spanning trees in circulant graphs},
  author = {A. D. Mednykh and I. A. Mednykh},
  journal= {arXiv preprint arXiv:1811.03803},
  year   = {2018}
}

Comments

11 pages