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 条

[21] MINIMAL GRAPH WITH A GIVEN NUMBER OF SPANNING TREES
SEDLACEK, J
CANADIAN MATHEMATICAL BULLETIN, 1970, 13 (04): : 515 - &
[22] Transformation of spanning trees in a 2-connected graph
Nakamura, T
Yoshimoto, K
ARS COMBINATORIA, 2001, 60 : 65 - 71
[23] Upper bounds for the number of spanning trees of graphs
Ş Burcu Bozkurt
Journal of Inequalities and Applications, 2012
[24] Upper bounds for the number of spanning trees of graphs
Bozkurt, S. Burcu
JOURNAL OF INEQUALITIES AND APPLICATIONS, 2012,
[25] The Maximum Number of Spanning Trees of a Graph with Given Matching Number
Muhuo Liu
Guangliang Zhang
Kinkar Chandra Das
Bulletin of the Malaysian Mathematical Sciences Society, 2021, 44 : 3725 - 3732
[26] The Maximum Number of Spanning Trees of a Graph with Given Matching Number
Liu, Muhuo
Zhang, Guangliang
Das, Kinkar Chandra
BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY, 2021, 44 (06) : 3725 - 3732
[27] Upper bound of the connected sets number in a graph and random subsets component structure
Sapozhenko, AA
DOKLADY AKADEMII NAUK, 1999, 365 (04) : 455 - 457
[28] THE BOUND OF THE MAXIMUM NUMBER OF END VERTICES OF SPANNING TREES
张福基
陈治柏
Science Bulletin, 1988, (14) : 1149 - 1151
[29] AN UPPER BOUND ON THE RAMSEY NUMBER OF TREES
GYARFAS, A
TUZA, Z
DISCRETE MATHEMATICS, 1987, 66 (03) : 309 - 310
[30] Counting the Number of Spanning Trees of Generalization Farey Graph
Xiao, Yuzhi
Zhao, Haixing
2013 NINTH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION (ICNC), 2013, : 1778 - 1782

← 1 2 3 4 5 →