Spanning Trees Whose Stems are Caterpillars-Reference-Cited by-同舟云学术

Spanning Trees Whose Stems are Caterpillars

Published:2024-07-24 Issue:2 Volume:61 Page:134-146
ISSN:0081-6906
Container-title:Studia Scientiarum Mathematicarum Hungarica
language:
Short-container-title:SScMath

Author:

Ha Pham Hoang¹,Hanh Dang Dinh²,Nam Le Dinh³,Nhan Nguyen Huu¹

Affiliation:

1. Department of Mathematics, Hanoi National University of Education, 136, XuanThuy str., Hanoi, Vietnam

2. Department of Mathematics, Hanoi Architectural University, km10, NguyenTrai str., Hanoi, Vietnam

3. School of Applied Mathematics and Informatics, Hanoi University of Science and Technology, 1 Dai Co Viet road, Hanoi, Vietnam

Abstract

Let 𝑇 be a tree, a vertex of degree one is called a leaf. The set of all leaves of 𝑇 is denoted by Leaf(𝑇). The subtree 𝑇 − Leaf(𝑇) of 𝑇 is called the stem of 𝑇 and denoted by Stem(𝑇). A tree 𝑇 is called a caterpillar if Stem(𝑇) 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.

Publisher

Akademiai Kiado Zrt.

Link

https://akjournals.com/downloadpdf/journals/012/61/2/article-p134.xml

Reference12 articles.

1. [1]J. Akiyama and M. Kano. Factors and Factorizations of Graphs. Lecture Note in Mathematics (LNM 2031), Springer, 2011.

2. [2]H. J. Broersma. Existence of Δ -cycles and Δ -paths. J. Graph Theory, 12:499-507, 1988.

3. [3]H. J. Broersma and H. Tuinstra. Independence trees and Hamilton cycles. J. Graph Theory, 29:227-237, 1998.

4. [4]A. Czygrinow, G. Fan, G. Hurlbert, H. A. Kierstead, and W. T. Trotter. Spanning trees of bounded degree. Electronic Journal of Combinatorics, 8:R33, 2001.

5. [5]M. Kano, M. Tsugaki, and G. Yan. -dominating -ended trees of graphs. Discrete Math., 333:1-5, 2014.