The number of spanning trees of a graph

DOI10.1186/1029-242X-2013-395zbMath1284.05061WikidataQ59299226 ScholiaQ59299226MaRDI QIDQ5920301

Ahmet Sinan Cevik, Ismail Naci Cangul, Kinkar Chandra Das

Publication date: 28 March 2014

Published in: Journal of Inequalities and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1186/1029-242x-2013-395

zbMATH Keywords

independence number; clique number; spanning trees; first Zagreb index

Mathematics Subject Classification ID

05C05: Trees

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

15A18: Eigenvalues, singular values, and eigenvectors

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

05C07: Vertex degrees

Related Items

The number of spanning trees of a graph with given matching number, The dynamics of the forest graph operator, The maximum number of spanning trees of a graph with given matching number

Cites Work

• New upper bounds on Zagreb indices
• Spanning trees in regular graphs
• A bound for the complexity of a simple graph
• An upper bound for the number of spanning trees of a graph
• Maximizing the sum of the squares of the degrees of a graph
• Sharp upper bounds on the spectral radius of the signless Laplacian matrix of a graph
• A sharp upper bound for the number of spanning trees of a graph
• On Complementary Graphs
• The Laplacian Spectrum of a Graph II
• The number of spanning trees of a graph