|
Zapiski Nauchnykh Seminarov POMI, 2010, Volume 381, Pages 78–87
(Mi znsl3853)
|
|
|
|
This article is cited in 6 scientific papers (total in 6 papers)
Spanning trees with many leaves
D. V. Karpov St. Petersburg Department of V. A. Steklov Institute of Mathematics, Russian Academy of Sciences
Abstract:
Let maximal chain of vertices of degree 2 in the graph $G$ consists of $k>0$ vertices. We prove that $G$ has a spanning tree with more than $\frac{v(G)}{2k+4}$ leaves (we denote by $v(G)$ the number of vertices of the graph $G$). We present an infinite serie of examples showing that the constant $\frac1{2k+4}$ cannot be enlarged. Bibl. 7 titles.
Key words and phrases:
spanning tree, leaves, number of leaves.
Received: 23.08.2010
Citation:
D. V. Karpov, “Spanning trees with many leaves”, Combinatorics and graph theory. Part II, Zap. Nauchn. Sem. POMI, 381, POMI, St. Petersburg, 2010, 78–87; J. Math. Sci. (N. Y.), 179:5 (2011), 616–620
Linking options:
https://www.mathnet.ru/eng/znsl3853 https://www.mathnet.ru/eng/znsl/v381/p78
|
Statistics & downloads: |
Abstract page: | 232 | Full-text PDF : | 78 | References: | 39 |
|