Article Per Year (5 Year)
p-Index From 2021 - 2026
0
P-Index
This Author published in this journals
All Journal Electronic Journal of Graph Theory and Applications (EJGTA)
Daniel Yaqubi
Faculty of Agriculture and Animal Science, University of Torbat-e Jam, Iran
Electrical & Electronics Engineering

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
Spanning k-ended trees of 3-regular connected graphs Hamed Ghasemian Zoeram; Daniel Yaqubi
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 5, No 2 (2017): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2017.5.2.4

Abstract

A vertex of degree one is called an end-vertex and the set of end-vertices of G is denoted by End(G). For a positive integer k, a tree T be called k-ended tree if $|End(T)| \leq k$. In this paper, we obtain sufficient conditions for spanning k-trees of 3-regular connected graphs. We give a construction sequence of graphs satisfying the condition. At the end, we present a conjecture about spanning k-ended trees of 3-regular connected graphs.
Co-Authors Hamed Ghasemian Zoeram