๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A Spanning Tree with High Degree Vertices

โœ Scribed by Kenta Ozeki; Tomoki Yamashita

Publisher
Springer Japan
Year
2010
Tongue
English
Weight
116 KB
Volume
26
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Spanning trees with bounded degrees
Spanning trees with bounded degrees
โœ Victor Neumann-Lara; Eduardo Rivera-Campo ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 276 KB
A spanning tree of the 2m-dimensional hy
A spanning tree of the 2m-dimensional hypercube with maximum number of degree-preserving vertices
โœ Sul-young Choi; Puhua Guan ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 190 KB

For an n-dimensional hypercube Q., the maximum number of degree-preserving vertices in a spanning tree is 2"jn if n = 2" for an integer M. (If n # 2", then the maximum number of degree-preserving vertices in a spanning tree is less than 2"/n.) We also construct a spanning tree of Qzm with maximum nu

Degree-constrained minimum spanning tree
Degree-constrained minimum spanning tree
โœ Subhash C. Narula; Cesar A. Ho ๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 868 KB
On numbers of vertices of maximum degree
On numbers of vertices of maximum degree in the spanning trees of a graph
โœ Jerzy Topp; Preben D. Vestergaard ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 611 KB

For a connected graph G, let ~-(G) be the set of all spanning trees of G and let nd(G) be the number of vertices of maximum degree in G. In this paper we show that if G is a cactus or a connected graph with p vertices and p+ 1 edges, then the set {na(T) : T C ~-(G)) has at most one gap, that is, it