A LOWER BOUND ON THE NUMBER OF SPANNING-TREES WITH K END-VERTICES

被引：7

|

作者：

HEINRICH, K

LIU, G

机构：

来源：

JOURNAL OF GRAPH THEORY | 1988年 / 12卷 / 01期

关键词：

D O I：

10.1002/jgt.3190120110

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

收藏

页码：95 / 100

页数：6

相关论文

共 50 条

[41] THE NUMBER OF SPANNING-TREES OF THE GENERALIZED BOOLEAN N-CUBE NETWORK
HUANG, TC
WANG, JF
YANG, CS
LEE, JY
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1988, 16 (09) : 715 - 725
[42] CALCULATING THE CHARACTERISTIC POLYNOMIAL, EIGENVECTORS AND NUMBER OF SPANNING-TREES OF A HEXAGONAL SYSTEM
JOHN, P
SACHS, H
JOURNAL OF THE CHEMICAL SOCIETY-FARADAY TRANSACTIONS, 1990, 86 (07): : 1033 - 1039
[43] UPPER BOUND FOR NUMBER OF SPANNING TREES OF A GRAPH
GRIMMETT, GR
DISCRETE MATHEMATICS, 1976, 16 (04) : 323 - 324
[44] END-FAITHFUL FORESTS AND SPANNING-TREES IN INFINITE-GRAPHS
SIRAN, J
DISCRETE MATHEMATICS, 1991, 95 (1-3) : 331 - 340
[45] A lower bound for the distance k-domination number of trees
Meierling D.
Volkmann L.
Results in Mathematics, 2005, 47 (3-4) : 335 - 339
[46] MAXIMUM AND K-TH MAXIMAL SPANNING-TREES OF A WEIGHTED GRAPH
KANO, M
COMBINATORICA, 1987, 7 (02) : 205 - 214
[47] Lower Bounds on the Number of Leaves in Spanning Trees
Karpov D.V.
Journal of Mathematical Sciences, 2018, 232 (1) : 36 - 43
[48] SPANNING TREES WHOSE STEMS HAVE A BOUNDED NUMBER OF BRANCH VERTICES
Yan, Zheng
DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2016, 36 (03) : 773 - 778
[49] Spanning trees of bipartite graphs with a bounded number of leaves and branch vertices
Huang, Xinyu
Yan, Zheng
DISCRETE APPLIED MATHEMATICS, 2025, 363 : 105 - 109
[50] Spanning Trees With Many Leaves: Lower Bounds in Terms of the Number of Vertices of Degree 1, 3 and at Least 4
Karpov D.V.
Journal of Mathematical Sciences, 2014, 196 (6) : 768 - 783

← 1 2 3 4 5 →