Maximizing the number of spanning trees in K_n-complements of asteroidal graphs

DOI10.1016/J.DISC.2008.08.008MaRDI QIDQ1025922zbMATH OpenOpenAlexFDO

Authors Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos

Publication date 23 June 2009

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2008.08.008

zbMATH Keywords

spanning treesmaximizationinterconnection networkscomplement-spanning-tree matrixstar-like graphs

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35)

Recommendations

• scientific article; zbMATH DE number 932184
• Maximizing spanning trees in almost complete graphs
• Maximizing spanning trees in almost complete graphs
• On the number of spanning trees of a multi-complete/star related graph
• Maximizing the Number of Spanning Trees in a Connected Graph
• On the characterization of graphs with maximum number of spanning trees
• On the structure of graphs with bounded asteroidal number
• On the structure of graphs with bounded asteroidal number
• The maximum number of spanning trees of a graph with given matching number
• The number of spanning trees in \(K_ n\)-complements of quasi-threshold graphs

Cites work

• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 932184 (Why is no real title available?)
• scientific article; zbMATH DE number 3324508 (Why is no real title available?)
• A formula for the number of spanning trees of a multi-star related graph
• A limit characterization for the number of spanning trees of graphs
• Chebyshev polynomials and spanning tree formulas for circulant and related graphs
• Maximizing spanning trees in almost complete graphs
• On the characterization of graphs with maximum number of spanning trees
• On the number of spanning trees and Eulerian tours in iterated line digraphs
• On the number of spanning trees in directed circulant graphs
• On the number of spanning trees of a multi-complete/star related graph
• On the number of spanning trees of multi-star related graphs
• On unreliability polynomials and graph connectivity in reliable network synthesis
• Parallel concepts in graph theory
• Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes
• The number of spanning trees in \(K_ n\)-complements of quasi-threshold graphs
• The number of spanning trees in circulant graphs
• Uniformly-most reliable networks do not always exist

Cited in

(9)

• On the number of spanning trees of multi-star related graphs
• On the number of spanning trees of a multi-complete/star related graph
• On two conjectures concerning spanning tree edge dependences of graphs
• An efficient approach for counting the number of spanning trees in circulant and related graphs
• The number of spanning trees of a graph with given matching number
• The maximum number of spanning trees of a graph with given matching number
• Counting spanning trees in graphs using modular decomposition
• Counting spanning trees using modular decomposition
• The number of spanning trees of the Cartesian product of regular graphs

This page was built for publication: Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs

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