SPANNING TREES WHOSE STEMS ARE CATERPILLARS

被引：0

作者：

Ha, Pham Hoang ^{[1
]}

Hanh, Dang Dinh ^{[2
]}

Nam, Le Dinh ^{[3
]}

Nhan, Nguyen Huu ^{[1
]}

机构：

[1] Hanoi Natl Univ Educ, Dept Math, 136 XuanThuy Str, Hanoi, Vietnam

[2] Hanoi Architectural Univ, Dept Math, NguyenTrai Str, Hanoi, Vietnam

[3] Hanoi Univ Sci & Technol, Sch Appl Math & Informat, 1 Dai Co Viet Rd, Hanoi, Vietnam

来源：

STUDIA SCIENTIARUM MATHEMATICARUM HUNGARICA | 2024年 / 61卷 / 02期

关键词：

Spanning tree; stem; caterpillar;

D O I：

10.1556/012.2024.04310

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let T be a tree, a vertex of degree one is called a leaf. The set of all leaves of T is denoted by Leaf(T). T ) . The subtree T - Leaf(T) T ) of T is called the stem of T and denoted by Stem(T). T ) . A tree T is called a caterpillar if Stem(T) T ) is a path. In this paper, we give two sufficient conditions for a connected graph to have a spanning tree whose stem is a caterpillar. We also give some examples to show that these conditions are sharp.

引用

页码：134 / 146

页数：13

共 13 条

[1]

Akiyama J., 2011, LECT NOTE MATH LNM 2

[2]

Broersma H, 1998, J GRAPH THEOR, V29, P227, DOI 10.1002/(SICI)1097-0118(199812)29:4<227::AID-JGT2>3.0.CO

[3]

2-W

[4] EXISTENCE OF DELTA-LAMBDA-CYCLES AND DELTA-LAMBDA-PATHS [J].

BROERSMA, HJ .

JOURNAL OF GRAPH THEORY, 1988, 12 (04) :499-507

[5]

Czygrinow A., 2001, ELECTRON J COMB, V8, pR33

[6]

Kano M., 2013, Lecture Notes in Computer Science, V8296

[7] Spanning Trees Whose Stems are Spiders [J].

Kano, Mikio ;

Yan, Zheng .

GRAPHS AND COMBINATORICS, 2015, 31 (06) :1883-1887

[8]

Kano M, 2014, ARS COMBINATORIA, V117, P417

[9] m-dominating k-ended trees of graphs [J].

Kano, Mikio ;

Tsugaki, Masao ;

Yan, Guiying .

DISCRETE MATHEMATICS, 2014, 333 :1-5

[10]

Ore O, 1960, Amer. Math. Monthly, V67, P66

← 1 2 →