Name
Abstract | ||
|---|---|---|
A connected graph G is super edge connected (super- λ for short) if every minimum edge cut of G is the set of edges incident with some vertex. We define a super- λ graph G to be m -super- λ if G - S is still super- λ for any edge subset S with | S | ≤ m . The maximum integer of such m , written as S λ ( G ) , is said to be the edge fault tolerance of G with respect to the super- λ property. In this paper, we study the bounds for S λ ( G ) , showing that min { λ ' ( G ) - ¿ ( G ) - 1 , ¿ ( G ) - 1 } ≤ S λ ( G ) ≤ ¿ ( G ) - 1 . More refined bounds are obtained for regular graphs and Cartesian product graphs. Exact values of S λ are obtained for edge transitive graphs. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.dam.2011.10.033 | Discrete Applied Mathematics |
Keywords | Field | DocType |
l graph g,super edge connectivity,edge fault tolerance,connected graph,edges incident,minimum edge cut,edge subset,super edge,fault tolerance,edge transitive graph | Integer,Discrete mathematics,Combinatorics,Edge-transitive graph,Vertex (geometry),Bound graph,Cartesian product,Fault tolerance,Connectivity,Mathematics,Transitive relation | Journal |
Volume | Issue | ISSN |
160 | 4 | 0166-218X |
Citations | PageRank | References |
9 | 0.53 | 21 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yanmei Hong | 1 | 21 | 3.60 |
| Jixiang Meng | 2 | 353 | 55.62 |
| Zhao Zhang | 3 | 706 | 102.46 |