Counting spanning trees of \((1, N\))-periodic graphs
From MaRDI portal
Publication:6180568
DOI10.1016/j.dam.2023.11.018zbMath1529.05089arXiv2306.06859OpenAlexW4388679219MaRDI QIDQ6180568
Jingyuan Zhang, Fuliang Lu, Xian'an Jin
Publication date: 22 December 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2306.06859
Cites Work
- Unnamed Item
- Structural properties of the minimum cut of partially-supplied graphs
- On the sandpile group of the cone of a graph
- Analytic properties of sextet polynomials of hexagonal systems
- Further analysis of the number of spanning trees in circulant graphs
- Spanning trees on the Sierpinski gasket
- Enumerating spanning trees of graphs with an involution
- Determinant identities for Laplace matrices
- Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs
- Factorizations of some weighted spanning tree enumerators
- The number of spanning trees in circulant graphs
- The number of spanning trees in odd valent circulant graphs
- On polynomials of spanning trees
- The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic
- The enumeration of spanning tree of weighted graphs
- Critical groups of iterated cones
- Enumeration of spanning trees of graphs with rotational symmetry
- Applications of M-matrices to non-negative matrices
- Chebyshev polynomials and spanning tree formulas for circulant and related graphs
- The number of spanning trees of plane graphs with reflective symmetry
- NOTE ON M-MATRICES
- On Invariants of Graphs with Applications to Knot Theory
- On unreliability polynomials and graph connectivity in reliable network synthesis
- Rotors in Graph Theory
- Spanning trees on graphs and lattices inddimensions
- Algebraic Combinatorics
- Kron Reduction of Graphs With Applications to Electrical Networks
- The two-point resistance of a resistor network: a new formulation and application to the cobweb network
- Some exact results for spanning trees on lattices
- Combinatorial explanation of the weighted Laplacian characteristic polynomial of a graph and applications
This page was built for publication: Counting spanning trees of \((1, N\))-periodic graphs