Please use this identifier to cite or link to this item:
|Title:||On the largest tree of given maximum degree in a connected graph|
|Citation:||Journal of Graph Theory. 15(1): 7-13|
|Abstract:||We prove that every connected graph G contains a tree T of maximum degree at most k that either spans G or has order at least k(G) + 1, where (G) is the minimum degree of G. This generalizes and unifies earlier results of Bermond  and Win . We also show that the square of a connected graph contains a spanning tree of maximum degree at most three.|
|Appears in Collections:||Dept of Mathematics Research Papers|
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.