On the 3-restricted edge connectivity of permutation graphs

An edge cut W of a connected graph G is a k-restricted edge cut if G-W is disconnected, and every component of G-W has at least k vertices. The k-restricted edge connectivity is defined as the minimum cardinality over all k-restricted edge cuts. A permutation graph is obtained by taking two disjoint copies of a graph and adding a perfect matching between the two copies. The k-restricted edge connectivity of a permutation graph is upper bounded by the so-called minimum k-edge degree. In this paper some sufficient conditions guaranteeing optimal k-restricted edge connectivity and super k-restricted edge connectivity for permutation graphs are presented for k=2,3.

[1]  F. Boesch.  Synthesis of reliable networks - a survey , 1986, IEEE Transactions on Reliability.

[2]  Wayne Goddard,et al.  Distance and connectivity measures in permutation graphs , 2003, Discret. Math..

[3]  Frank Harary,et al.  Conditional connectivity , 1983, Networks.

[4]  Camino Balbuena,et al.  Reliability of interconnection networks modeled by a product of graphs , 2006 .

[5]  Jun-Ming Xu,et al.  On restricted edge-connectivity of graphs , 2002, Discret. Math..

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

[7]  G. Chartrand.  Graphs and Digraphs, Fourth Edition , 2004 .

[8]  Ying Qian Wang,et al.  Super restricted edge-connectivity of vertex-transitive graphs , 2004, Discret. Math..

[9]  Ralph Tindell,et al.  Circulants and their connectivities , 1984, J. Graph Theory.

[10]  Jianping Ou,et al.  Edge cuts leaving components of order at least m , 2005, Discret. Math..

[11]  Camino Balbuena,et al.  Diameter-girth sufficient conditions for optimal extraconnectivity in graphs , 2008, Discret. Math..

[12]  Camino Balbuena,et al.  On the edge-connectivity and restricted edge-connectivity of a product of graphs , 2007, Discret. Appl. Math..

[13]  Zhao Zhang,et al.  A proof of an inequality concerning k-restricted edge connectivity , 2005, Discret. Math..

[14]  Richard D. Ringeisen,et al.  Connectivity of generalized prisms over G , 1991, Discret. Appl. Math..

[15]  Qiao Li,et al.  Reliability analysis of circulant graphs , 1998 .

[16]  Hong-Jian Lai,et al.  Large Survivable Nets and the Generalized Prisms , 1995, Discret. Appl. Math..

[17]  Pedro García-Vázquez,et al.  On restricted connectivities of permutation graphs , 2005 .

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

[19]  Mehdi Behzad,et al.  Graphs and Digraphs , 1981, The Mathematical Gazette.

[20]  Charles Delorme,et al.  Large graphs with given degree and diameter. II , 1984, J. Comb. Theory, Ser. B.

[21]  Lutz Volkmann,et al.  Edge-cuts leaving components of order at least three , 2002, Discret. Math..

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

[23]  Miguel Angel Fiol,et al.  Extraconnectivity of graphs with large minimum degree and girth , 1997, Discret. Math..