𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Interpolation theorem for diameters of spanning trees

✍ Scribed by Harary, F.; Mokken, R.; Plantholt, M.

Book ID
114613607
Publisher
IEEE
Year
1983
Weight
472 KB
Volume
30
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

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