Spanning k-ended trees of 3-regular connected graphs
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 construct...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | EJournal Article |
| Published: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB,
2017-10-16.
|
| Subjects: | |
| Online Access: | Get Fulltext |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| LEADER | 01768 am a22002533u 4500 | ||
|---|---|---|---|
| 001 | EJGTA_228_pdf_49 | ||
| 042 | |a dc | ||
| 100 | 1 | 0 | |a Ghasemian Zoeram, Hamed; Faculty of Agriculture and Animal Science, University of Torbat-e Jam, Iran |e author |
| 100 | 1 | 0 | |e contributor |
| 700 | 1 | 0 | |a Yaqubi, Daniel; Faculty of Agriculture and Animal Science, University of Torbat-e Jam, Iran |e author |
| 245 | 0 | 0 | |a Spanning k-ended trees of 3-regular connected graphs |
| 260 | |b GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB, |c 2017-10-16. | ||
| 500 | |a https://www.ejgta.org/index.php/ejgta/article/view/228 | ||
| 520 | |a 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. | ||
| 540 | |a Copyright (c) 2017 Electronic Journal of Graph Theory and Applications (EJGTA) | ||
| 546 | |a eng | ||
| 690 | |a spanning tree, k-ended tree, leaf, 3-regular graph, connected graph | ||
| 655 | 7 | |a info:eu-repo/semantics/article |2 local | |
| 655 | 7 | |a info:eu-repo/semantics/publishedVersion |2 local | |
| 655 | 7 | |a Peer-reviewed Article |2 local | |
| 786 | 0 | |n Electronic Journal of Graph Theory and Applications (EJGTA); Vol 5, No 2 (2017): Electronic Journal of Graph Theory and Applications; 207-211 | |
| 786 | 0 | |n 2338-2287 | |
| 787 | 0 | |n https://www.ejgta.org/index.php/ejgta/article/view/228/pdf_49 | |
| 856 | 4 | 1 | |u https://www.ejgta.org/index.php/ejgta/article/view/228/pdf_49 |z Get Fulltext |