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 条

[21] ON THE NUMBER OF SPANNING-TREES OF KN AND KM,N
ABUSBEIH, MZ
DISCRETE MATHEMATICS, 1990, 84 (02) : 205 - 207
[22] FINDING THE K-SMALLEST SPANNING-TREES
EPPSTEIN, D
BIT, 1992, 32 (02): : 237 - 248
[23] Spanning trees with bounded number of branch vertices
Gargano, L
Hell, P
Stacho, L
Vaccaro, U
AUTOMATA, LANGUAGES AND PROGRAMMING, 2002, 2380 : 355 - 365
[24] PROPERTIES OF THE NUMBER OF SPANNING-TREES AND OF PARTIAL CONNECTED GRAPHS
ZAMANSKY, LY
DOPOVIDI AKADEMII NAUK UKRAINSKOI RSR SERIYA A-FIZIKO-MATEMATICHNI TA TECHNICHNI NAUKI, 1986, (07): : 70 - 75
[25] THE NUMBER OF SPANNING-TREES IN GRAPHS WITH A GIVEN DEGREE SEQUENCE
KOSTOCHKA, AV
RANDOM STRUCTURES & ALGORITHMS, 1995, 6 (2-3) : 269 - 274
[26] 2-CACTI WITH MINIMUM NUMBER OF SPANNING-TREES
VESTERGAARD, PD
DISCRETE MATHEMATICS, 1994, 124 (1-3) : 241 - 250
[27] MINIMUM SPANNING-TREES IN K-DIMENSIONAL SPACE
VAIDYA, PM
SIAM JOURNAL ON COMPUTING, 1988, 17 (03) : 572 - 582
[28] AN ALGORITHM FOR FINDING K-MINIMUM SPANNING-TREES
KATOH, N
IBARAKI, T
MINE, H
SIAM JOURNAL ON COMPUTING, 1981, 10 (02) : 247 - 255
[29] FINDING THE MOST VITAL EDGES WITH RESPECT TO THE NUMBER OF SPANNING-TREES
TSEN, FSP
SUNG, TY
LIN, MY
HSU, LH
MYRVOLD, W
IEEE TRANSACTIONS ON RELIABILITY, 1994, 43 (04) : 600 - 603
[30] LOWER BOUND ON NUMBER OF VERTICES OF A GRAPH
KANE, VG
MOHANTY, SP
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 1978, 72 (01) : 211 - 212

← 1 2 3 4 5 →