On rationality of generating function for the number of spanning trees in circulant graphs
Combinatorics
2018-11-12 v1
Abstract
Let be the generating function for the number of spanning trees in the circulant graphs We show that is a rational function with integer coefficients satisfying the property A similar result is also true for the circulant graphs of odd valency We illustrate the obtained results by a series of examples.
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