Edge fault tolerance of super edge connectivity for three families of interconnection networks

  • Authors:

  • Dongye Wang;Mei Lu

  • Affiliations:

  • Department of Mathematical Sciences, Tsinghua University, Beijing 100084, China;Department of Mathematical Sciences, Tsinghua University, Beijing 100084, China

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2012

Quantified Score

Hi-index 0.07

Visualization

Abstract

Let G=(V,E) be a connected graph. G is said to be super edge connected (or super-@l for short) if every minimum edge cut of G isolates one of the vertex of G. A graph G is called m-super-@l if for any edge set S@?E(G) with |S|=