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

Spanning subgraphs of a hypercube IV: Rooted trees

โœ Scribed by Frank Harary; Martin Lewinter

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
303 KB
Volume
17
Category
Article
ISSN
0895-7177

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The starlike trees which span a hypercub
The starlike trees which span a hypercube
โœ Frank Harary; Martin Lewinter ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 222 KB

A connected bipartite graph is called equitable if it has the same number of nodes in each of its two colors. A starlike tree with b branches is a subdivision of the star K~. b with b ~> 3. We prove that a starlike tree T with b branches, where 3 ~< b ~< n, having 2 n nodes spans the hypercube Qn if

Classification of interpolation theorems
Classification of interpolation theorems for spanning trees and other families of spanning subgraphs
โœ Frank Harary; Michael J. Plantholt ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 518 KB

We say that a graphical invariant i of a graph interpolates over a family 8 of graphs if i satisfies the following property: If rn and M are the minimum and maximum values (respectively) of i over all graphs in 8 then for each k , rn 4 k I M , there is a graph H in 8 for which i ( H ) = k . In previ