The Number of Spanning Trees in Kn-Complements of Quasi-Threshold Graphs
暂无分享,去创建一个
[1] Frank Harary,et al. Graph Theory , 2016 .
[2] Wendy J. Myrvold,et al. Maximizing spanning trees in almost complete graphs , 1997, Networks.
[3] Claude Berge,et al. Graphs and Hypergraphs , 2021, Clustering.
[4] Charles L. Suffel,et al. On the characterization of graphs with maximum number of spanning trees , 1998, Discret. Math..
[5] 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..
[6] Kuo-Liang Chung,et al. A Formula for the Number of Spanning Trees of a Multi-Star Related Graph , 1998, Inf. Process. Lett..
[7] Gerard J. Chang,et al. Quasi-threshold Graphs , 1996, Discret. Appl. Math..
[8] Alexander K. Kelmans,et al. Laplacian Spectra and Spanning Trees of Threshold Graphs , 1996, Discret. Appl. Math..
[9] M. Golummc. Algorithmic graph theory and perfect graphs , 1980 .
[10] Stavros D. Nikolopoulus. Hamiltonian Cycles in Quasi-threshold Graphs , 2001 .
[11] Martin Charles Golumbic,et al. Trivially perfect graphs , 1978, Discret. Math..
[12] 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..
[13] H. Temperley. On the mutual cancellation of cluster integrals in Mayer's fugacity series , 1964 .
[14] Wendy Myrvold,et al. Uniformly-most reliable networks do not always exist , 1991, Networks.
[15] Stavros D. Nikolopoulos. Parallel algorithms for Hamiltonian problems on quasi-threshold graphs , 2004, J. Parallel Distributed Comput..
[16] ZhangYuanping,et al. The number of spanning trees in circulant graphs , 2000 .
[17] Kuo-Liang Chung,et al. On the number of spanning trees of a multi-complete/star related graph , 2000, Inf. Process. Lett..
[18] Charles J. Colbourn,et al. The Combinatorics of Network Reliability , 1987 .
[19] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .
[20] Panos Rondogiannis,et al. On the Number of Spanning Trees of Multi-Star Related Graphs , 1998, Inf. Process. Lett..
[21] Stavros D. Nikolopoulos. Coloring permutation graphs in parallel , 1999, Discret. Appl. Math..
[22] Yuanping Zhang,et al. The number of spanning trees in circulant graphs , 2000, Discret. Math..
[23] Stavros D. Nikolopoulos. Hamiltonian Cycles in Quasi-threshold Graphs , 2001, Electron. Notes Discret. Math..