Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs
type: Item
instance of: scholarly article
title: Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs
zbMATH Open document ID: 1229.05150
author: Stavros D. Nikolopoulos
author: Leonidas Palios
author: Charis Papadopoulos
published in: Discrete Mathematics
publication date: 2009-06-23T00:00:00Z
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 5569050
zbMATH Keywords: spanning trees
zbMATH Keywords: complement-spanning-tree matrix
zbMATH Keywords: star-like graphs
zbMATH Keywords: maximization
zbMATH Keywords: interconnection networks
MaRDI profile type: Publication
full work available at URL: j.disc.2008.08.008
OpenAlex ID: W2114318330
cites work: Q3941433
cites work: On unreliability polynomials and graph connectivity in reliable network synthesis
cites work: Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes
cites work: On the number of spanning trees of a multi-complete/star related graph
cites work: Q4198056
cites work: Maximizing spanning trees in almost complete graphs
cites work: Chebyshev polynomials and spanning tree formulas for circulant and related graphs
cites work: Q4894608
cites work: Parallel concepts in graph theory
cites work: On the number of spanning trees and Eulerian tours in iterated line digraphs
cites work: On the number of spanning trees in directed circulant graphs
cites work: Q5602686
cites work: Uniformly-most reliable networks do not always exist
cites work: A limit characterization for the number of spanning trees of graphs
cites work: The number of spanning trees in \(K_ n\)-complements of quasi-threshold graphs
cites work: On the number of spanning trees of multi-star related graphs
cites work: On the characterization of graphs with maximum number of spanning trees
cites work: A formula for the number of spanning trees of a multi-star related graph
cites work: The number of spanning trees in circulant graphs
DOI: 10.1016/J.DISC.2008.08.008
Recommended article: Q4894608
Recommended article: Maximizing spanning trees in almost complete graphs
Recommended article: On the number of spanning trees of a multi-complete/star related graph
Recommended article: Maximizing the Number of Spanning Trees in a Connected Graph
Recommended article: On the characterization of graphs with maximum number of spanning trees
Recommended article: On the structure of graphs with bounded asteroidal number
Recommended article: The maximum number of spanning trees of a graph with given matching number
Recommended article: The number of spanning trees in \(K_ n\)-complements of quasi-threshold graphs
description: scientific article; zbMATH DE number 5569050