Spanning Trees whose Stems have a Bounded Number of Branch Vertices
Let T be a tree, a vertex of degree one and a vertex of degree at least three is called a leaf and a branch vertex, respectively. The set of leaves of T is denoted by Leaf(T). The subtree T − Leaf(T) of T is called the stem of T and denoted by Stem(T). In this paper, we give two sufficient condition...
Main Author: | Yan Zheng |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Zielona Góra
2016-08-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.1885 |
Similar Items
-
Local Intrinsic Density Based Community Detection Using Branch-and-Bound and Minimum Spanning Tree
by: Keshab Nath
Published: (2022-12-01) -
Note: Sharp Upper and Lower Bounds on the Number of Spanning Trees in Cartesian Product of Graphs
by: Azarija Jernej
Published: (2013-09-01) -
Performance Evaluation using Spanning Tree Protocol, Rapid Spanning Tree Protocol, Per-VLAN Spanning Tree, and Multiple Spanning Tree
by: Dana Faiq Abd, et al.
Published: (2024-01-01) -
On a Spanning k-Tree in which Specified Vertices Have Degree Less Than k
by: Matsumura Hajime
Published: (2015-02-01) -
The number of spanning trees in a superprism
by: Zbigniew R. Bogdanowicz
Published: (2024-04-01)