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

DOI10.1007/s00373-004-0568-xzbMath1054.05058OpenAlexW1997098503MaRDI QIDQ704836

Charis Papadopoulos, Stavros D. Nikolopoulos

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

zbMATH Keywords

NetworksTreesCombinatorial problemsComplement spanning-tree matrix theoremQuasithreshold graphsSpanning trres

Mathematics Subject Classification ID

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

Related Items (20)

Counting spanning trees in cobordism of two circulant graphs ⋮ On Jacobian group and complexity of the generalized Petersen graph \(\mathrm{GP}(n,k)\) through Chebyshev polynomials ⋮ On the number of spanning trees, the Laplacian eigenvalues, and the Laplacian Estrada index of subdivided-line graphs ⋮ A limit characterization for the number of spanning trees of graphs ⋮ The Enumeration of Spanning Trees in Dual, Bipartite and Reduced Graphs ⋮ The number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs ⋮ On the number of spanning trees in graphs with multiple edges ⋮ The number and degree distribution of spanning trees in the Tower of Hanoi graph ⋮ On two conjectures concerning spanning tree edge dependences of graphs ⋮ COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS ⋮ Counting spanning trees using modular decomposition ⋮ The number of spanning trees of the Cartesian product of regular graphs ⋮ On Jacobian group and complexity of I-graph I(n, k, l) through Chebyshev polynomials ⋮ Enumerating threshold graphs and some related graph classes ⋮ An efficient approach for counting the number of spanning trees in circulant and related graphs ⋮ Counting Spanning Trees in Graphs Using Modular Decomposition ⋮ Laplacian spectrum of weakly quasi-threshold graphs ⋮ Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs ⋮ Unnamed Item ⋮ Counting rooted spanning forests in cobordism of two circulant graphs

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