𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The independence number condition for the existence of a spanning f-tree

✍ Scribed by Hikoe Enomoto; Kenta Ozeki

Publisher
John Wiley and Sons
Year
2010
Tongue
English
Weight
123 KB
Volume
65
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

Let G be a graph and f be a mapping from V(G) to the positive integers. A subgraph T of G is called an f‐tree if T forms a tree and d~T~(x)≀f(x) for any x∈V(T). We propose a conjecture on the existence of a spanning f‐tree, and give a partial solution to it. Β© 2009 Wiley Periodicals, Inc. J Graph Theory 65:
173–184, 2010

πŸ“œ 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

Some conditions for the existence of f-f
Some conditions for the existence of f-factors
✍ P. Katerinis πŸ“‚ Article πŸ“… 1985 πŸ› John Wiley and Sons 🌐 English βš– 268 KB πŸ‘ 1 views

Let m, 1, n be three odd integers such that m < I < n. It is proved that if a graph G has an mfactor and an rrfactor, then it also has an /factor. In addition, we obtain sufficient conditions for the existence of an f-factor, in terms of vertexdeleted subgraphs. All graphs considered here are multi

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

A degree condition for the existence of
A degree condition for the existence of k-factors
✍ Tsuyoshi Nishimura πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 358 KB πŸ‘ 1 views

## Abstract Let __k__ be an integer such that ≦, and let __G__ be a connected graph of order __n__ with ≦, __kn__ even, and minimum degree at least __k__. We prove that if __G__ satisfies max(deg(u), deg(v)) ≦ n/2 for each pair of nonadjacent vertices __u, v__ in __G__, then __G__ has a __k__‐facto

Calculating the number of spanning trees
Calculating the number of spanning trees in a labeled planar molecular graph whose inner dual is a tree
✍ P. E. John; R. B. Mallion πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 496 KB πŸ‘ 3 views

The quantum mechanical relevance of the concept of a spanning tree extant within a given molecular graph-specifically, one that may be considered to represent the carbon-atom connectivity of a particular (planar) conjugated system-was first explicitly pointed out by Professor Roy McWeeny in his now-