Spanning k-ended trees of 3-regular connected graphs
Combinatorics
2016-06-22 v2
Abstract
A tree is called k-ended tree if it has at most k leaves, where a leaf is a vertex of degree one. In this paper we prove that every 3-regular connected graph with n vertices such that n is greater than 8 has spanning sub tree with at most [(2n+4)/9]-ended tree. At the end we give a conjecture about spanning k-ended trees on 3-regular connected graphs.
Keywords
Cite
@article{arxiv.1510.05246,
title = {Spanning k-ended trees of 3-regular connected graphs},
author = {Hamed Ghasemian Zoeram and Daniel Yaqubi},
journal= {arXiv preprint arXiv:1510.05246},
year = {2016}
}