On the upper bound for the number of spanning trees of a connected graph

被引：0

作者：

Li, Rao ^{[1
]}

机构：

[1] Dept. of Mathematical Sciences, University of South Carolina Aiken, Aiken,SC,29801, United States

来源：

Journal of Combinatorial Mathematics and Combinatorial Computing | 2015年 / 95卷

关键词：

Compendex;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

Eigenvalues and eigenfunctions

引用

页码：257 / 269

共 50 条

[31] On the Number of Spanning Trees a Planar Graph Can Have
Buchin, Kevin
Schulz, Andre
ALGORITHMS-ESA 2010, 2010, 6346 : 110 - +
[32] A NOTE ON THE NUMBER OF SPANNING-TREES IN A PRISM GRAPH
JAGERS, AA
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1988, 24 (02) : 151 - 154
[33] FINDING THE GRAPH WITH THE MAXIMUM NUMBER OF SPANNING-TREES
MOUSTAKIDES, G
BEDROSIAN, SD
JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS, 1980, 310 (06): : 343 - 348
[34] The upper connected outer connected monophonic number of a graph
Ganesamoorthy, K.
Priya, S. Lakshmi
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS- COMPUTER SYSTEMS THEORY, 2023, 8 (01) : 57 - 66
[35] AN UPPER BOUND FOR THE PATH NUMBER OF A GRAPH
DONALD, A
JOURNAL OF GRAPH THEORY, 1980, 4 (02) : 189 - 201
[36] AN UPPER BOUND ON THE NUMBER OF CLIQUES IN A GRAPH
FARBER, M
HUJTER, M
TUZA, Z
NETWORKS, 1993, 23 (03) : 207 - 210
[37] AN UPPER BOUND ON THE DOMINATION NUMBER OF A GRAPH
MARCU, D
MATHEMATICA SCANDINAVICA, 1986, 59 (01) : 41 - 44
[38] The upper connected geodetic number and forcing connected geodetic number of a graph
Santhakumaran, A. P.
Titus, P.
John, J.
DISCRETE APPLIED MATHEMATICS, 2009, 157 (07) : 1571 - 1580
[39] An Upper Bound on the Number of Edges of a Graph Whose kth Power Has a Connected Complement
Samoilov V.S.
Journal of Mathematical Sciences, 2018, 232 (1) : 84 - 97
[40] Upper bound for the number of spanning forests of regular graphs
Bencs, Ferenc
Csikvari, Peter
EUROPEAN JOURNAL OF COMBINATORICS, 2023, 110

← 1 2 3 4 5 →