𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Super-Connectivity and Hyper-Connectivity of Vertex Transitive Bipartite Graphs

✍ Scribed by Xiaodong Liang; Jixiang Meng; Zhao Zhang

Publisher
Springer Japan
Year
2007
Tongue
English
Weight
78 KB
Volume
23
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Connectivity of large bipartite digraphs
Connectivity of large bipartite digraphs and graphs
✍ M.C. Balbuena; A. Carmona; J. FΓ brega; M.A. Fiol πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 638 KB

This paper studies the relation between the connectivity and other parameters of a bipartite (di)graph G. Namely, its order n, minimum degree 6, maximum degree A, diameter D, and a new parameter f related to the number of short paths in G. (When G is a bipartite -undirected --graph this parameter tu

Super Connectivity of Line Graphs and Di
Super Connectivity of Line Graphs and Digraphs
✍ Min LΓΌ; Jun-Ming Xu πŸ“‚ Article πŸ“… 2006 πŸ› Institute of Applied Mathematics, Chinese Academy 🌐 English βš– 121 KB