Spanning k-ended trees of 3-regular connected graphs

Hamed Ghasemian Zoeram, Daniel Yaqubi

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 t…