Spanning trees with pairwise nonadjacent endvertices

被引：11

作者：

Bohme, T

Broersma, HJ

Gobel, F

Kostochka, AV

Stiebitz, M

机构：

[1] TECH UNIV ILMENAU,MATH INST,D-98684 ILMENAU,GERMANY

[2] UNIV TWENTE,FAC APPL MATH,NL-7500 AE ENSCHEDE,NETHERLANDS

[3] RUSSIAN ACAD SCI,INST MATH,SIBERIAN BRANCH,NOVOSIBIRSK 630090,RUSSIA

来源：

DISCRETE MATHEMATICS | 1997年 / 170卷 / 1-3期

关键词：

spanning tree with pairwise nonadjacent endvertices; depth-first-search tree;

D O I：

10.1016/S0012-365X(96)00306-8

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A spanning tree of a connected graph G is said to be an independency tree if all its endvertices are pairwise nonadjacent in G. We prove that a connected graph G has no independency tree if and only if G is a cycle, a complete graph or a complete bipartite graph the color classes of which have equal cardinality.

引用

页码：219 / 222

页数：4

共 50 条

[1] Enumerating all spanning trees for pairwise comparisons
Siraj, S.
Mikhailov, L.
Keane, J. A.
[J]. COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (02) : 191 - 199
[2] Requiring pairwise nonadjacent chords in cycles
McKee, Terry A.
[J]. JOURNAL OF COMBINATORICS, 2013, 4 (03) : 357 - 372
[3] Dynamically Reconstructing Minimum Spanning Trees After Swapping Pairwise Vertices
Fu, Zhang-Hua
Chen, Si-Bo
Ming, Yi-Fei
Chen, Yong-Quan
Lai, Xiang-Jing
[J]. IEEE ACCESS, 2019, 7 : 16351 - 16363
[4] Enumerating all spanning trees for pairwise comparisons (vol 39, pg 191, 2012)
Siraj, S.
Mikhailov, L.
Keane, J. A.
[J]. COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (09) : 2265 - 2265
[5] Regular 1-factorizations of complete graphs and decompositions into pairwise isomorphic rainbow spanning trees
Rinaldi, Gloria
[J]. AUSTRALASIAN JOURNAL OF COMBINATORICS, 2021, 80 : 178 - 196
[6] Ranking Alternatives Using QUALIFLEX Method by Computing All Spanning Trees from Pairwise Judgements
Banerjee, Debasmita
Guha, Debashree
Kouchakinejad, Fateme
[J]. SOFT COMPUTING FOR PROBLEM SOLVING, SOCPROS 2017, VOL 1, 2019, 816 : 235 - 247
[7] SPANNING TREES
不详
[J]. JOURNAL OF HUMANISTIC MATHEMATICS, 2021, 11 (02): : 481 - 482
[8] Spanning Trees
Akiyama, Jin
Kano, Mikio
[J]. FACTORS AND FACTORIZATIONS OF GRAPHS: PROOF TECHNIQUES IN FACTOR THEORY, 2011, 2031 : 295 - 336
[9] Pairwise Markov trees
Pieczynski, W
[J]. COMPTES RENDUS MATHEMATIQUE, 2002, 335 (01) : 79 - 82
[10] From Spanning Trees to Meshed Trees
Acharya, H. B.
Hamilton, John
Shenoy, Nirmala
[J]. 2020 INTERNATIONAL CONFERENCE ON COMMUNICATION SYSTEMS & NETWORKS (COMSNETS), 2020,

← 1 2 3 4 5 →