2015/10/18 by Hamed Ghasemian Zoeram, Zoeram, Hamed Ghasemian, Daniel Yaqubi +1
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Graph theory and applications
paper · pdf · doi:10.48550/arxiv.1510.05246
openalex publication_date 2015/10/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.