Title of article
Maximizing the number of spanning trees in -complements of asteroidal graphs
Author/Authors
Nikolopoulos، نويسنده , , Stavros D. and Palios، نويسنده , , Leonidas and Papadopoulos، نويسنده , , Charis، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
12
From page
3049
To page
3060
Abstract
In this paper we introduce the class of graphs whose complements are asteroidal (star-like) graphs and derive closed formulas for the number of spanning trees of its members. The proposed results extend previous results for the classes of the multi-star and multi-complete/star graphs. Additionally, we prove maximization theorems that enable us to characterize the graphs whose complements are asteroidal graphs and possess a maximum number of spanning trees.
Keywords
Star-like graphs , Complement-spanning-tree matrix , maximization , interconnection networks , spanning trees
Journal title
Discrete Mathematics
Serial Year
2009
Journal title
Discrete Mathematics
Record number
1598795
Link To Document