The number of spanning trees in K_ n-complements of quasi-threshold graphs

DOI10.1007/S00373-004-0568-XzbMATH Open1054.05058OpenAlexW1997098503MaRDI QIDQ704836FDOQ704836

Authors: Stavros D. Nikolopoulos, Charis Papadopoulos 

Publication date: 20 January 2005

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-004-0568-x

Recommendations

• The number of spanning trees in the composition graphs
• On the number of spanning trees of \(K^m_n \pm G\) graphs
• The number of spanning trees of composite graphs
• The number of spanning trees of a complete multipartite graph
• The number of spanning trees in some classes of graphs
• The number of spanning tree in several classes of graphs
• scientific article; zbMATH DE number 5584928
• On the number of spanning trees of \(K_ n\) and \(K_{m,n}\)
• scientific article; zbMATH DE number 5174860
• On the number of spanning trees of a multi-complete/star related graph

zbMATH Keywords

NetworksTreesCombinatorial problemsComplement spanning-tree matrix theoremQuasithreshold graphsSpanning trres

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Enumeration in graph theory (05C30)

Cited In (24)

• The number and degree distribution of spanning trees in the Tower of Hanoi graph
• On Jacobian group and complexity of the generalized Petersen graph \(\mathrm{GP}(n,k)\) through Chebyshev polynomials
• Title not available (Why is that?)
• Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs
• The Enumeration of Spanning Trees in Dual, Bipartite and Reduced Graphs
• Title not available (Why is that?)
• Enumerating threshold graphs and some related graph classes
• On the number of spanning trees of \(K^m_n \pm G\) graphs
• Counting spanning trees in cobordism of two circulant graphs
• On the number of spanning trees, the Laplacian eigenvalues, and the Laplacian Estrada index of subdivided-line graphs
• Title not available (Why is that?)
• On two conjectures concerning spanning tree edge dependences of graphs
• The number of spanning trees in \(K_n\)-complement of a bipartite graph
• An efficient approach for counting the number of spanning trees in circulant and related graphs
• On the number of spanning trees in graphs with multiple edges
• Counting rooted spanning forests in cobordism of two circulant graphs
• The number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs
• Counting spanning trees in prism and anti-prism graphs
• Counting spanning trees in graphs using modular decomposition
• A limit characterization for the number of spanning trees of graphs
• On Jacobian group and complexity of \(I\)-graph \(I(n, k, l)\) through Chebyshev polynomials
• Counting spanning trees using modular decomposition
• Laplacian spectrum of weakly quasi-threshold graphs
• The number of spanning trees of the Cartesian product of regular graphs

This page was built for publication: The number of spanning trees in \(K_ n\)-complements of quasi-threshold graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q704836)