𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Interpolation theorem for the number of degree-preserving vertices of spanning trees

✍ Scribed by Lewinter, M.

Book ID
114614140
Publisher
IEEE
Year
1987
Weight
124 KB
Volume
34
Category
Article
ISSN
0098-4094

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Interpolation theorem for the number of
Interpolation theorem for the number of end-vertices of spanning trees
✍ Seymour Schuster πŸ“‚ Article πŸ“… 1983 πŸ› John Wiley and Sons 🌐 English βš– 224 KB πŸ‘ 1 views

## Abstract The following interpolation theorem is proved: If a graph __G__ contains spanning trees having exactly __m__ and __n__ end‐vertices, with __m__ < __n__, then for every integer __k, m < k < n, G__ contains a spanning tree having exactly __k__ end‐vertices. This settles a problem posed by

Interpolation theorem for the number of
Interpolation theorem for the number of pendant vertices of connected spanning subgraphs of equal size
✍ C.A. Barefoot πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science 🌐 English βš– 162 KB

At the 4th International Graph Theory Conference (1980), G. Chartrand posed the following problem: If a (connected) graph G contains spanning trees with m and n pendant vertices, respectively, with m < n, does G contain a spanning tree with k pendant vertices for every integer k, where m<k<n? Recent

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

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