On the number of spanning trees, the Laplacian eigenvalues, and the Laplacian Estrada index of subdivided-line graphs

DOI10.1515/math-2016-0055zbMath1346.05177OpenAlexW2525088050MaRDI QIDQ317939

Yilun Shang

Publication date: 4 October 2016

Published in: Open Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/math-2016-0055

zbMATH Keywords

spanning treeline graphLaplacian spectrumLaplacian estrada indexsubdivide-line graph

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph operations (line graphs, products, etc.) (05C76)

Related Items (9)

Super \((a, d)\)-\(H\)-antimagic labeling of subdivided graphs ⋮ The many facets of the Estrada indices of graphs and networks ⋮ An iteration method for computing the total number of spanning trees and its applications in graph theory ⋮ Enumeration of spanning trees in the sequence of Dürer graphs ⋮ Laplacian spectral moment and Laplacian Estrada index of random graphs ⋮ Degree-based indices of some complex networks ⋮ The complexity of some classes of pyramid graphs created from a gear graph ⋮ On the spectrum of linear dependence graph of a finite dimensional vector space ⋮ Eigenvalues of transition weight matrix for a family of weighted networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the number of spanning trees of a multi-complete/star related graph
• Sierpiński graphs as spanning subgraphs of Hanoi graphs
• The number of spanning trees in \(K_ n\)-complements of quasi-threshold graphs
• Clique graphs of time graphs
• The Estrada index of evolving graphs
• Determinant identities for Laplace matrices
• Eigenvalues, diameter, and mean distance in graphs
• Laplacian matrices of graphs: A survey
• Structural properties of subdivided-line graphs
• Estrada and \(\mathcal L\)-Estrada indices of edge-independent random graphs
• The number of spanning trees in Apollonian networks
• More on the Laplacian Estrada index
• Eigenvalues of the Laplacian of a graph^∗
• Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
• A simple formula for the number of spanning trees of line graphs
• 1-perfect codes in Sierpiński graphs
• COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS

This page was built for publication: On the number of spanning trees, the Laplacian eigenvalues, and the Laplacian Estrada index of subdivided-line graphs