𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the classification and toughness of generalized permutation star-graphs

✍ Scribed by Chong-Yun Chao; Shao-cen Han

Book ID
110420218
Publisher
Springer
Year
1997
Tongue
English
Weight
769 KB
Volume
47
Category
Article
ISSN
0011-4642

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Various results on the toughness of grap
Various results on the toughness of graphs
✍ Broersma, Hajo; Engbers, Erik; Trommel, Huib πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 90 KB πŸ‘ 2 views

Let G be a graph and let t Υ† 0 be a real number. Then, We discuss how the toughness of (spanning) subgraphs of G and related graphs depends on (G), we give some sufficient degree conditions implying that (G) Υ† t, and we study which subdivisions of 2-connected graphs have minimally 2-tough squares.

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