A sharp upper bound for the number of spanning trees of a graph
From MaRDI portal
Publication:2478168
DOI10.1007/s00373-007-0758-4zbMath1139.05032OpenAlexW2045906340MaRDI QIDQ2478168
Publication date: 14 March 2008
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-007-0758-4
Trees (05C05) Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (33)
On relation between the Kirchhoff index and number of spanning trees of graph ⋮ Some results on the Laplacian spread of a graph ⋮ The dynamics of the forest graph operator ⋮ Upper bounds for the number of spanning trees of graphs ⋮ On graphs with distance Laplacian eigenvalues of multiplicity n −4 ⋮ Modified hyper-Wiener index of trees ⋮ Computing Laplacian energy, Laplacian-energy-like invariant and Kirchhoff index of graphs ⋮ Unnamed Item ⋮ On the Laplacian-energy-like invariant ⋮ Graphs with four distinct Laplacian eigenvalues ⋮ Unnamed Item ⋮ On Laplacian energy of graphs ⋮ On the ordering of the Kirchhoff indices of the complements of trees and unicyclic graphs ⋮ Unnamed Item ⋮ Spanning trees: A survey ⋮ On energy and Laplacian energy of bipartite graphs ⋮ The number of spanning trees of a graph ⋮ The maximum number of spanning trees of a graph with given matching number ⋮ A note on the average distance of a Graph ⋮ On the VC-dimension, covering and separating properties of the cycle and spanning tree hypergraphs of graphs ⋮ The number of spanning trees of a graph with given matching number ⋮ The number of spanning trees of a graph ⋮ On sum of powers of the Laplacian eigenvalues of graphs ⋮ Some improved bounds on two energy-like invariants of some derived graphs ⋮ On Laplacian energy, Laplacian-energy-like invariant and Kirchhoff index of graphs ⋮ On relation between Kirchhoff index, Laplacian-energy-like invariant and Laplacian energy of graphs ⋮ On two energy-like invariants of line graphs and related graph operations ⋮ Unnamed Item ⋮ Nordhaus-Gaddum type inequalities for the two largest Laplacian eigenvalues ⋮ Open problem on \(\sigma\)-invariant ⋮ Characterization of extremal graphs from Laplacian eigenvalues and the sum of powers of the Laplacian eigenvalues of graphs ⋮ Eigenvalue bounds for some classes of matrices associated with graphs ⋮ On relations between Kirchhoff index, Laplacian energy, Laplacian-energy-like invariant and degree deviation of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- A bound for the complexity of a simple graph
- An upper bound for the number of spanning trees of a graph
- Laplacian matrices of graphs: A survey
- A characterization on graphs which achieve the upper bound for the largest Laplacian eigenvalue of graphs.
- The Laplacian spectrum of a graph
- A note on the second largest eigenvalue of the laplacian matrix of a graph∗
- Large eigenvalues of the laplacian
- Eigenvalues of the Laplacian of a graph∗
- The Laplacian Spectrum of a Graph II
This page was built for publication: A sharp upper bound for the number of spanning trees of a graph
