Vertex fault tolerance of optimal-κ graphs and super-κ graphs

  • Authors:

  • Yanmei Hong;Zhao Zhang

  • Affiliations:

  • Department of Mathematics, Shanghai University, Shanghai 200444, China;College of Mathematics and System Sciences, Xinjiang University, Urumqi, Xinjiang 830046, China

  • Venue:
  • Information Processing Letters
  • Year:
  • 2009

Quantified Score

Hi-index 0.89

Visualization

Abstract

A connected graph G is optimal-@k if @k(G)=@d(G). It is super-@k if every minimum vertex cut isolates a vertex. An optimal-@k graph G is m-optimal-@k if for any vertex set S@?V(G) with |S|=