𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a connection between the existence ofk-trees and the toughness of a graph

✍ Scribed by Sein Win

Publisher
Springer Japan
Year
1989
Tongue
English
Weight
312 KB
Volume
5
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the edge-toughness of a graph. II
On the edge-toughness of a graph. II
✍ Y. H. Peng; T. S. Tay πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 558 KB

## Abstract The edge‐toughness __T__~1~(__G__) of a graph __G__ is defined as equation image where the minimum is taken over every edge‐cutset __X__ that separates __G__ into Ο‰ (__G__ ‐ __X__) components. We determine this quantity for some special classes of graphs that also gives the arboricity

On the Edge Connectivity, Hamiltonicity,
On the Edge Connectivity, Hamiltonicity, and Toughness of Vertex-Transitive Graphs
✍ Jan van den Heuvel; Bill Jackson πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 191 KB

Let G be a connected k-regular vertex-transitive graph on n vertices. For S V(G) let d(S) denote the number of edges between S and V(G)"S. We extend results of Mader and Tindell by showing that if d(S)< 2 9 (k+1) 2 for some S V(G) with 1 3 (k+1) |S| 1 2 n, then G has a factor F such that GΓ‚E(F ) is

On the largest tree of given maximum deg
On the largest tree of given maximum degree in a connected graph
✍ Y. Caro; I. Krasikov; Y. Roditty πŸ“‚ Article πŸ“… 1991 πŸ› John Wiley and Sons 🌐 English βš– 258 KB πŸ‘ 1 views

## Abstract We prove that every connected graph __G__ contains a tree __T__ of maximum degree at most __k__ that either spans __G__ or has order at least __k__Ξ΄(__G__) + 1, where Ξ΄(__G__) is the minimum degree of __G.__ This generalizes and unifies earlier results of Bermond [1] and Win [7]. We als