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

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.

[1]  Kuo-Liang Chung,et al.  On the number of spanning trees of a multi-complete/star related graph , 2000, Inf. Process. Lett..

[2]  Charles J. Colbourn,et al.  The Combinatorics of Network Reliability , 1987 .

[3]  Wendy Myrvold,et al.  Uniformly-most reliable networks do not always exist , 1991, Networks.

[4]  Kuo-Liang Chung,et al.  A Formula for the Number of Spanning Trees of a Multi-Star Related Graph , 1998, Inf. Process. Lett..

[5]  Panos Rondogiannis,et al.  On the Number of Spanning Trees of Multi-Star Related Graphs , 1998, Inf. Process. Lett..

[6]  Charis Papadopoulos,et al.  The Number of Spanning Trees in Kn-Complements of Quasi-Threshold Graphs , 2004, Graphs Comb..

[7]  Arnd Roth,et al.  Some Methods for Counting the Spanning Trees in Labelled Molecular Graphs, Examined in Relation to Certain Fullerenes , 1997, Discret. Appl. Math..

[8]  Zbigniew Lonc,et al.  On the number of spanning trees in directed circulant graphs , 2001, Networks.

[9]  H. Temperley.  On the mutual cancellation of cluster integrals in Mayer's fugacity series , 1964 .

[10]  Arnd Roth,et al.  Some Methods for Counting the Spanning Trees in Labelled Molecular Graphs, Examined in Relation to Certain Fullerenes , 1996, Discret. Appl. Math..

[11]  Alexander Kelmans.  On graphs with the maximum number of spanning trees , 1996 .

[12]  Huang Qiongxiang,et al.  On the number of spanning trees and Eulerian tours in iterated line digraphs , 1997 .

[13]  Francis T. Boesch,et al.  On unreliability polynomials and graph connectivity in reliable network synthesis , 1986, J. Graph Theory.

[14]  Claude Berge,et al.  Graphs and Hypergraphs , 2021, Clustering.

[15]  Wendy J. Myrvold,et al.  Maximizing spanning trees in almost complete graphs , 1997, Networks.

[16]  B. Myers.  Number of spanning trees in a wheel , 1971 .

[17]  G. Sposito,et al.  Graph theory and theoretical physics , 1969 .

[18]  Frank Harary,et al.  Graph Theory , 2016 .

[19]  Yuanping Zhang,et al.  The number of spanning trees in circulant graphs , 2000, Discret. Math..

[20]  Panos Rondogiannis,et al.  A limit characterization for the number of spanning trees of graphs , 2004, Inf. Process. Lett..

[21]  Yuanping Zhang,et al.  Chebyshev polynomials and spanning tree formulas for circulant and related graphs , 2005, Discret. Math..

[22]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[23]  Charles L. Suffel,et al.  On the characterization of graphs with maximum number of spanning trees , 1998, Discret. Math..