𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Conditional edge connectivity properties, reliability comparisons and transitivity of graphs

✍ Scribed by Ming Wang; Qiao Li

Book ID
108315755
Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
139 KB
Volume
258
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On conditional edge-connectivity of grap
On conditional edge-connectivity of graphs
✍ Xu Junming πŸ“‚ Article πŸ“… 2000 πŸ› Institute of Applied Mathematics, Chinese Academy 🌐 English βš– 416 KB
Super edge connectivity properties of co
Super edge connectivity properties of connected edge symmetric graphs
✍ Li, Qiaoliang; Li, Qiao πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 47 KB πŸ‘ 2 views

The super edge connectivity properties of a graph G can be measured by the restricted edge connectivity Ј(G). We evaluate Ј(G) and the number of i-cutsets C i (G), d Υ… i Υ… 2d Οͺ 3, explicitly for each d-regular edge-symmetric graph G. These results improve the previous one by R. Tindell on the same s

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

A sufficient condition for equality of e
A sufficient condition for equality of edge-connectivity and minimum degree of a graph
✍ Donald L. Goldsmith; Roger C. Entringer πŸ“‚ Article πŸ“… 1979 πŸ› John Wiley and Sons 🌐 English βš– 184 KB πŸ‘ 1 views

## Abstract Let __G__ be a connected graph of order __p__ β‰₯ 2, with edge‐connectivity ΞΊ~1~(__G__) and minimum degree Ξ΄(__G__). It is shown her ethat in order to obtain the equality ΞΊ~1~(__G__) = Ξ΄(__G__), it is sufficient that, for each vertex __x__ of minimum degree in __G__, the vertices in the n