The number of rooted forests in circulant graphs
From MaRDI portal
Publication:5037930
DOI10.26493/1855-3974.2029.01dzbMath1497.05123arXiv1907.02635OpenAlexW2954392891MaRDI QIDQ5037930
Ilya A. Mednykh, Lilya A. Grunwald
Publication date: 29 September 2022
Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.02635
Related Items (2)
Combinatorial explanation of the weighted Laplacian characteristic polynomial of a graph and applications ⋮ Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cauchy-Binet for pseudo-determinants
- Smith normal form and Laplacians
- Spanning tree formulas and Chebyshev polynomials
- Heights of polynomials and entropy in algebraic dynamics
- A certain polynomial of a graph and graphs with an extremal number of trees
- The number of spanning trees in circulant graphs
- The number of spanning trees in odd valent circulant graphs
- Factorization of certain cyclotomic functions
- The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic
- On Jacobian group and complexity of the generalized Petersen graph \(\mathrm{GP}(n,k)\) through Chebyshev polynomials
- Spanning forests and the golden ratio
- Chebyshev polynomials and spanning tree formulas for circulant and related graphs
- The Mahler measure of algebraic numbers: a survey
- On the Number of Distinct Forests
- The Enumeration of Point Labelled Chromatic Graphs and Trees
- On Some Inequalities for Polynomials in Several Variables
- Enumeration of Forests in a Graph
- Spanning trees on graphs and lattices inddimensions
- On Jacobian group and complexity of I-graph I(n, k, l) through Chebyshev polynomials
- The number of spanning trees in a prism
- Spanning tree generating functions and Mahler measures
- COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS
- On the spanning trees of finite graphs
This page was built for publication: The number of rooted forests in circulant graphs