Spanning k-ended trees of 3-regular connected graphs
<p>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...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2017-10-01
|
| Series: | Electronic Journal of Graph Theory and Applications |
| Subjects: | |
| Online Access: | https://www.ejgta.org/index.php/ejgta/article/view/228 |
| _version_ | 1818469936092151808 |
|---|---|
| author | Hamed Ghasemian Zoeram Daniel Yaqubi |
| author_facet | Hamed Ghasemian Zoeram Daniel Yaqubi |
| author_sort | Hamed Ghasemian Zoeram |
| collection | DOAJ |
| description | <p>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.</p> |
| first_indexed | 2024-04-13T21:30:19Z |
| format | Article |
| id | doaj.art-0c79d1efa88847ac9805a8a2d2c2cb22 |
| institution | Directory Open Access Journal |
| issn | 2338-2287 |
| language | English |
| last_indexed | 2024-04-13T21:30:19Z |
| publishDate | 2017-10-01 |
| publisher | Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia |
| record_format | Article |
| series | Electronic Journal of Graph Theory and Applications |
| spelling | doaj.art-0c79d1efa88847ac9805a8a2d2c2cb222022-12-22T02:29:10ZengIndonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), IndonesiaElectronic Journal of Graph Theory and Applications2338-22872017-10-015220721110.5614/ejgta.2017.5.2.490Spanning k-ended trees of 3-regular connected graphsHamed Ghasemian Zoeram0Daniel Yaqubi1Faculty of Agriculture and Animal Science, University of Torbat-e Jam, IranFaculty of Agriculture and Animal Science, University of Torbat-e Jam, Iran<p>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.</p>https://www.ejgta.org/index.php/ejgta/article/view/228spanning tree, k-ended tree, leaf, 3-regular graph, connected graph |
| spellingShingle | Hamed Ghasemian Zoeram Daniel Yaqubi Spanning k-ended trees of 3-regular connected graphs Electronic Journal of Graph Theory and Applications spanning tree, k-ended tree, leaf, 3-regular graph, connected graph |
| title | Spanning k-ended trees of 3-regular connected graphs |
| title_full | Spanning k-ended trees of 3-regular connected graphs |
| title_fullStr | Spanning k-ended trees of 3-regular connected graphs |
| title_full_unstemmed | Spanning k-ended trees of 3-regular connected graphs |
| title_short | Spanning k-ended trees of 3-regular connected graphs |
| title_sort | spanning k ended trees of 3 regular connected graphs |
| topic | spanning tree, k-ended tree, leaf, 3-regular graph, connected graph |
| url | https://www.ejgta.org/index.php/ejgta/article/view/228 |
| work_keys_str_mv | AT hamedghasemianzoeram spanningkendedtreesof3regularconnectedgraphs AT danielyaqubi spanningkendedtreesof3regularconnectedgraphs |