| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4647396 | Discrete Mathematics | 2013 | 4 Pages |
Abstract
A d-regular graph G is super-edge-connected if every minimum edge-cut is the set of all edges incident to one vertex in G, i.e., the edge-connectivity of G is equal to d and deleting every minimum edge-cut of G isolates a vertex. We show that if G is a d-regular graph that contains no 4-cycle as a subgraph, then Ï(G)=d+1 whenever G is not super-edge-connected.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Saeed Shaebani,