The number of spanning trees of a graph with given matching number

DOI10.1080/00207160.2015.1021341zbMath1342.05083OpenAlexW1994823003MaRDI QIDQ5739584

Aleksandar Ilić, Kexiang Xu, Guihai Yu, Kinkar Chandra Das, Li-Hua Feng

Publication date: 19 July 2016

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2015.1021341

zbMATH Keywords

graphspanning treeLaplacian spectrummatching numbermatrix

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items

The dynamics of the forest graph operator, Ordering connected graphs by their Kirchhoff indices, Note on extremal graphs with given matching number, The maximum number of spanning trees of a graph with given matching number

Cites Work

• Unnamed Item
• Unnamed Item
• Upper bounds for the number of spanning trees of graphs
• The number of spanning trees in some classes of graphs
• Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs
• A bound for the complexity of a simple graph
• Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory
• An upper bound for the number of spanning trees of a graph
• Laplacian graph eigenvectors
• The number of spanning forests of a graph
• A sharp upper bound for the number of spanning trees of a graph
• Sharp upper bounds for the number of spanning trees of a graph
• On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
• Maximizing the number of spanning trees of networks based on cycle basis representation
• Maximizing the number of spanning trees on the (p,p+2) graphs
• The Laplacian Spectrum of a Graph II
• The number of spanning trees of a graph
• The number of spanning trees of a graph