Spanning k-ended trees of 3-regular connected graphs

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...

Full description

Saved in:
Bibliographic Details
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:
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
Online Access:Get Fulltext
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

Get Fulltext

3rd Floor Main Library

Holdings details from 3rd Floor Main Library
Call Number: A1234.567
Copy 1 Available

Similar Items