Journal or Publication Title:
Date of publication:
Volume:
ISSN:
Additional Information:
Title:
On k-Ended Spanning and Dominating Trees
Creator:
Subject:
Uncontrolled Keywords:
Hamilton cycle ; Hamilton path ; Dominating cycle ; Dominating path ; Longest path ; k-ended tree.
Coverage:
Abstract:
A tree with at most k leaves is called a k-ended tree. Let tk be the order of a largest k-ended tree in a graph. A tree T of a graph G is said to be dominating if V (G-T) is an independent set of vertices.