|
Zapiski Nauchnykh Seminarov POMI, 2017, Volume 464, Pages 112–131
(Mi znsl6525)
|
|
|
|
A bound on the number of leaves in a spanning tree of a connected graph of minimal degree 6
E. N. Simarova St. Petersburg State University, St. Petersburg, Russia
Abstract:
It is proved, that a connected graph of minimal degree 6 has a spanning tree, such that at least $\frac{11}{21}$ of its vertices are leaves.
Key words and phrases:
distance graph, independence number, Turán type bounds.
Received: 27.11.2017
Citation:
E. N. Simarova, “A bound on the number of leaves in a spanning tree of a connected graph of minimal degree 6”, Combinatorics and graph theory. Part IX, Zap. Nauchn. Sem. POMI, 464, POMI, St. Petersburg, 2017, 112–131; J. Math. Sci. (N. Y.), 236:5 (2019), 542–553
Linking options:
https://www.mathnet.ru/eng/znsl6525 https://www.mathnet.ru/eng/znsl/v464/p112
|
Statistics & downloads: |
Abstract page: | 98 | Full-text PDF : | 43 | References: | 36 |
|