Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians
DOI10.4213/rm10098eMaRDI QIDQ6184481
Ilya A. Mednykh, Alexander Mednykh
Publication date: 25 January 2024
Published in: Russian Mathematical Surveys (Search for Journal in Brave)
Full work available at URL: http://mathnet.ru/eng/rm10098
JacobianChebyshev polynomialsFibonacci numbersabelian groupKirchhoff indexspanning treesrooted spanning forests
Trees (05C05) Enumeration in graph theory (05C30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Relations of low-dimensional topology with graph theory (57M15) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)
Cites Work
- Effective resistances and Kirchhoff index of ladder graphs
- On the structure of the Jacobian group for circulant graphs
- Cauchy-Binet for pseudo-determinants
- Covering theory for graphs of groups
- Asymptotics and arithmetical properties of complexity for circulant graphs
- Counting rooted spanning forests in cobordism of two circulant graphs
- On the sandpile group of the square cycle \(C^{2}_{n}\)
- On the structure of Picard group for Moebius ladder
- Smith normal form and Laplacians
- The isomorphism classes of the generalized Petersen graphs
- Spanning tree formulas and Chebyshev polynomials
- Symmetric Y-graphs and H-graphs
- Chip-firing and the critical group of a graph
- A certain polynomial of a graph and graphs with an extremal number of trees
- On the sandpile group of dual graphs
- The number of spanning trees in circulant graphs
- Counting spanning trees in cobordism of two circulant graphs
- The number of spanning trees in odd valent circulant graphs
- Factorization of certain cyclotomic functions
- Forest matrices around the Laplacian matrix
- Jacobian tori associated with a finite graph and its abelian covering graphs
- The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic
- Complexity of the circulant foliation over a graph
- Kirchhoff index for circulant graphs and its asymptotics
- Plans' periodicity theorem for Jacobian of circulant graphs
- Elementary formulas for Kirchhoff index of Möbius ladder and prism graphs
- A physics perspective on the resistance distance for graphs
- On embeddings of circulant graphs
- On Jacobian group and complexity of the generalized Petersen graph \(\mathrm{GP}(n,k)\) through Chebyshev polynomials
- Critical groups of iterated cones
- Spanning forests and the golden ratio
- Chebyshev polynomials and spanning tree formulas for circulant and related graphs
- Counting rooted spanning forests for circulant foliation over a graph
- A cyclic six-term exact sequence for block matrices over a PID
- On the Kirchhoff index of some toroidal lattices
- The Mahler measure of algebraic numbers: a survey
- On the Number of Distinct Forests
- On Some Inequalities for Polynomials in Several Variables
- Harmonic Morphisms and Hyperelliptic Graphs
- A FORMULA FOR THE NUMBER OF SPANNING TREES IN CIRCULANT GRAPHS WITH NONFIXED GENERATORS AND DISCRETE TORI
- Enumeration of Forests in a Graph
- The lattice of integral flows and the lattice of integral cuts on a finite graph
- Critical groups for complete multipartite graphs and Cartesian products of complete graphs
- A solution of the isomorphism problem for circulant graphs
- Spanning trees on graphs and lattices inddimensions
- On Jacobian group and complexity of I-graph I(n, k, l) through Chebyshev polynomials
- Circulant graphs: recognizing and isomorphism testing in polynomial time
- The number of spanning trees in a prism
- Homology of Abelian Coverings of Links and Spatial Graphs
- Algebraic aspects of Abelian sandpile models
- Spanning tree generating functions and Mahler measures
- The number of rooted forests in circulant graphs
- Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics
- On the structure of the critical group of a circulant graph with non-constant jumps
- COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS
- On Rationality of Generating Function for the Number of Spanning Trees in Circulant Graphs
- Dimer problem in statistical mechanics-an exact result
- On the number of spanning trees of finite graphs
- A short proof of a theorem of Plans on the homology of the branched cyclic coverings of a knot
- Three Remarkable Graphs
- On the Jacobian group of a cone over a circulant graph
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians