On Rationality of Generating Function for the Number of Spanning Trees in Circulant Graphs

DOI10.1142/S1005386720000085zbMath1433.05160arXiv1811.03803OpenAlexW3008816466MaRDI QIDQ5217374

Ilya A. Mednykh, Alexander Mednykh

Publication date: 27 February 2020

Published in: Algebra Colloquium (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.03803

zbMATH Keywords

generating functionspanning treeChebyshev polynomialcirculant graph

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Discrete version of topics in analysis (39A12)

Related Items (3)

Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians ⋮ Unnamed Item ⋮ Spanning tree generating functions for infinite periodic graphs L and connections with simple closed random walks on L

This page was built for publication: On Rationality of Generating Function for the Number of Spanning Trees in Circulant Graphs