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

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|=

[1]  Angelika Hellwig,et al.  Maximally edge-connected digraphs , 2003, Australas. J Comb..

[2]  Miguel Angel Fiol,et al.  Extraconnectivity of graphs with large girth , 1994, Discret. Math..

[3]  W. Mader,et al.  Surveys in Combinatorics: Connectivity and edge-connectivity in finite graphs , 1979 .

[4]  S. Louis Hakimi,et al.  On Computing a Conditional Edge-Connectivity of a Graph , 1988, Inf. Process. Lett..

[5]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[6]  Miguel Angel Fiol,et al.  On the extraconnectivity of graphs , 1996, Discret. Math..

[7]  Jonathan L. Gross,et al.  Handbook of graph theory , 2007, Discrete mathematics and its applications.