Spanning trees in regular graphs

DOI10.1016/S0195-6698(83)80045-6zbMath0517.05043MaRDI QIDQ1053029

Brendan D. McKay

Publication date: 1983

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

eigenvaluesregular graphnumber of spanning treesclosed walks

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (35)

The number of spanning trees in regular graphs ⋮ A bound for the complexity of a simple graph ⋮ Evaluations of Tutte polynomials of regular graphs ⋮ Spanning trees on the Sierpinski gasket ⋮ On Sidorenko's conjecture for determinants and Gaussian Markov random fields ⋮ The number of bounded‐degree spanning trees ⋮ Tropical Feynman integration in the Minkowski regime ⋮ Tropical Monte Carlo quadrature for Feynman integrals ⋮ Hepp's bound for Feynman graphs and matroids ⋮ Upper bound for the number of spanning forests of regular graphs ⋮ The distribution of sandpile groups of random regular graphs ⋮ Spectral moments of regular graphs in terms of subgraph counts ⋮ Tutte polynomials and related asymptotic limiting functions for recursive families of graphs ⋮ On the number of spanning trees in directed circulant graphs ⋮ Random matrices, nonbacktracking walks, and orthogonal polynomials ⋮ Statistical Matching Theory ⋮ Rank and Bollobás-Riordan polynomials: Coefficient measures and zeros ⋮ Distribution of coefficients of rank polynomials for random sparse graphs ⋮ Identities and Inequalities for Tree Entropy ⋮ The number of spanning trees of a graph ⋮ EXACT PARTITION FUNCTION FOR THE POTTS MODEL WITH NEXT-NEAREST NEIGHBOR COUPLINGS ON ARBITRARY-LENGTH LADDERS ⋮ Asymptotic enumeration of Latin rectangles ⋮ Exact Potts model partition functions on wider arbitrary-length strips of the square lattice ⋮ Graph characteristics from the heat kernel trace ⋮ Matchings in Benjamini–Schramm convergent graph sequences ⋮ Non-abelian free group actions: Markov processes, the Abramov–Rohlin formula and Yuzvinskii’s formula ⋮ The number of spanning trees in graphs with a given degree sequence ⋮ The enumeration of spanning tree of weighted graphs ⋮ On the number of forests and connected spanning subgraphs ⋮ Volume Bounds for the Phase-Locking Region in the Kuramoto Model with Asymmetric Coupling ⋮ Bounds on the chromatic polynomial and on the number of acyclic orientations of a graph ⋮ Exact Potts model partition function on strips of the triangular lattice ⋮ The minimum number of spanning trees in regular multigraphs ⋮ Spanning trees in random series-parallel graphs ⋮ The average number of spanning trees in sparse graphs with given degrees

Cites Work

• The expected eigenvalue distribution of a large regular graph
• Matchings and walks in graphs
• Regular Graphs with Given Girth and Restricted Circuits
• A new 5‐arc‐transitive cubic graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Spanning trees in regular graphs