Spanning Trees with Few Peripheral Branch Vertices
Taiwanese Journal of Mathematics · 25.05.2021 · 25 (3) · 435-447
DOI: 10.11650/tjm/201201 ↗Kurz gefasst
Fachartikel in der Zeitschrift Taiwanese Journal of Mathematics, erschienen am 25.05.2021. Verfasst von Pham Hoang Ha und 2 weiteren Autor:innen. Die Arbeit wurde bisher 5-mal zitiert (Crossref) und nennt 17 Literaturangaben.
Abstract (Originalsprache)
Let $T$ be a tree, a vertex of degree one is a leaf of $T$ and a vertex of degree at least three is a branch vertex of $T$. The set of leaves of $T$ is denoted by $L(T)$ and the set of branch vertices of $T$ is denoted by $B(T)$. For two distinct vertices $u$, $v$ of $T$, let $P_T[u,v]$ denote the unique path in $T$ connecting $u$ and $v$. Let $T$ be a tree with $B(T) \neq \emptyset$, for each vertex $x \in L(T)$, set $y_x \in B(T)$ such that $(V(P_T[x,y_x]) \setminus \{y_x\}) \cap B(T) = \emptyset$. We delete $V(P_T[x,y_x]) \setminus \{y_x\}$ from $T$ for all $x \in L(T)$. The resulting graph is a subtree of $T$ and is denoted by $\operatorname{R\_Stem}(T)$. It is called the reducible stem of $T$. A leaf of $\operatorname{R\_Stem}(T)$ is called a peripheral branch vertex of $T$. In this paper, we give some sharp sufficient conditions on the independence number and the degree sum for a graph $G$ to have a spanning tree with few peripheral branch vertices.
Zitieren
APA
Ha, P. H., Hanh, D. D., & Loan, N. T. (2021). Spanning Trees with Few Peripheral Branch Vertices. Taiwanese Journal of Mathematics, 25(3), 435-447. https://doi.org/10.11650/tjm/201201
Vancouver
Ha PH, Hanh DD, Loan NT. Spanning Trees with Few Peripheral Branch Vertices. Taiwanese Journal of Mathematics. 2021;25(3):435-447. doi:10.11650/tjm/201201
BibTeX
@article{Ha2021,
author = {Ha, Pham Hoang and Hanh, Dang Dinh and Loan, Nguyen Thanh},
title = {Spanning Trees with Few Peripheral Branch Vertices},
journal = {Taiwanese Journal of Mathematics},
year = {2021},
volume = {25},
number = {3},
pages = {435--447},
doi = {10.11650/tjm/201201}
}
EUVIMED