Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
393798 | Information Sciences | 2012 | 9 Pages |
Abstract
Let G = (V, E) be a connected graph. G is said to be super edge connected (or super-λ for short) if every minimum edge cut of G isolates one of the vertex of G. A graph G is called m-super-λ if for any edge set S ⊆ E(G) with ∣S∣ ⩽ m, G − S is still super-λ. The maximum cardinality of m-super-λ is called the edge fault tolerance of super edge connectivity of G. In this paper, we discuss the edge fault tolerance of super edge connectivity of three families of interconnection networks.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Dongye Wang, Mei Lu,