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: | Ghasemian Zoeram, Hamed; Faculty of Agriculture and Animal Science, University of Torbat-e Jam, Iran (Author), Yaqubi, Daniel; Faculty of Agriculture and Animal Science, University of Torbat-e Jam, Iran (Author) |
---|---|
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!
|
Similar Items
-
On the k-rainbow domination in graphs with bounded tree-width
by: Meybodi, M. Alambardar; Department of Applied Mathematics and Computer Science, Faculty of Mathematics and Statistics, University of Isfahan, Iran, et al.
Published: (2021) -
Outer independent global dominating set of trees and unicyclic graphs
by: Mojdeh, Doost Ali; Department of Mathematics, University of Mazandaran, Babolsar, Iran, et al.
Published: (2019) -
On distance labelings of 2-regular graphs
by: Ngurah, Anak Agung Gede; Department of Civil Engineering, Universitas Merdeka Malang Indonesia, et al.
Published: (2021) -
Domination number of the non-commuting graph of finite groups
by: Vatandoost, Ebrahim; Department of Mathematics, Faculty of Science, Imam Khomeini International University, Qazvin, Iran, et al.
Published: (2018) -
Perfect 3-colorings of the cubic graphs of order 10
by: Alaeiyan, Mehdi; School of Mathematics, Iran University of Science and Technology, Narmak, Tehran 16846, Iran, et al.
Published: (2017)