𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Interpolation theorem for the number of generalized end-vertices of spanning trees

✍ Scribed by Cho, H.-G.; Chwa, K.-Y.

Book ID
114559489
Publisher
IEEE
Year
1991
Weight
322 KB
Volume
38
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 lower bound on the number of spanning
A lower bound on the number of spanning trees with k end-vertices
✍ Katherine Heinrich; Guizhen Liu πŸ“‚ Article πŸ“… 1988 πŸ› John Wiley and Sons 🌐 English βš– 286 KB πŸ‘ 1 views

If a graph G with cycle rank p contains both spanning trees with rn and with n end-vertices, rn < n, then G has at least 2p spanning trees with k end-vertices for each integer k, rn < k < n. Moreover, the lower bound of 2p is best possible. [ l ] and Schuster [4] independently proved that such span

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