The number of spanning trees in the composition graphs

DOI10.1155/2014/613685zbMath1407.05131OpenAlexW2042732675WikidataQ59066569 ScholiaQ59066569MaRDI QIDQ1718771

Xianqiang Yang

Publication date: 8 February 2019

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/613685

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30)

Cites Work

• Unnamed Item
• Unnamed Item
• On the number of spanning trees of a multi-complete/star related graph
• Graphs determined by their generalized characteristic polynomials
• Some results on the lexicographic product of vertex-transitive graphs
• Spanning tree formulas and Chebyshev polynomials
• Eigenvalues of nonnegative symmetric matrices
• On the characterization of graphs with maximum number of spanning trees
• A certain polynomial of a graph and graphs with an extremal number of trees
• The number of spanning trees in circulant graphs
• Laplacian spectra and spanning trees of threshold graphs
• On Some Graph Operations and Related Applications
• A survey of some network reliability analysis and synthesis results
• A generalization of Fiedler's lemma and some applications
• Maximizing spanning trees in almost complete graphs

This page was built for publication: The number of spanning trees in the composition graphs