Enumeration of spanning trees of middle graphs
From MaRDI portal
Publication:1736137
DOI10.1016/j.amc.2017.02.040zbMath1411.05128arXiv2106.12141OpenAlexW4301866021MaRDI QIDQ1736137
Publication date: 29 March 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.12141
Related Items
On the dimer problem of the vertex-edge graph of a cubic graph, Enumeration of spanning trees of middle digraphs, Express the number of spanning trees in term of degrees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Determinant identities for Laplace matrices
- On the number of spanning trees of some irregular line graphs
- On the number of spanning trees on various lattices
- A simple formula for the number of spanning trees of line graphs
- ON THE NORMALISED LAPLACIAN SPECTRUM, DEGREE-KIRCHHOFF INDEX AND SPANNING TREES OF GRAPHS
- Expression for the Number of Spanning Trees of Line Graphs of Arbitrary Connected Graphs