The k-restricted edge-connectivity of a product of graphs

This work deals with a generalization of the Cartesian product of graphs, the product graph G"m*G"p introduced by Bermond et al. [J.C. Bermond, C. Delorme, G. Farhi, Large graphs with given degree and diameter II, J. Combin. Theory, Series B 36 (1984), 32-48]. The connectivity of these product graphs is approached by studying the k-restricted edge-connectivity, which is defined as the minimum number of edges of a graph whose deletion yields a disconnected graph with all its components having at least k vertices. To be more precise, we present lower and upper bounds for the k-restricted edge-connectivity of G"m*G"p, and provide sufficient conditions that ensure an optimal value for this parameter. When both G"m and G"p are regular graphs, conditions for guaranteeing that G"m*G"p is [email protected]"("k") are also presented, and the particular case where both G"m and G"p are complete graphs is considered.

[1]  Angelika Hellwig,et al.  Sufficient conditions for graphs to be λ′-optimal, super-edge-connected, and maximally edge-connected , 2005 .

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

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

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

[5]  Jun-Ming Xu,et al.  Connectivity of Cartesian product graphs , 2006, Discret. Math..

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

[7]  Bih-Sheue Shieh.  Super edge- and point-connectivities of the Cartesian product of regular graphs , 2002, Networks.

[8]  Camino Balbuena,et al.  Numbers of edges in supermagic graphs , 2006 .

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

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

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

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

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

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

[15]  Camino Balbuena,et al.  On the 3-restricted edge connectivity of permutation graphs , 2009, Discret. Appl. Math..

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

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

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

[19]  Guo-Liang Chen,et al.  On super edge-connectivity of product graphs , 2009, Appl. Math. Comput..

[20]  F. Harary,et al.  Planar Permutation Graphs , 1967 .

[21]  Zhao Zhang.  Sufficient conditions for restricted-edge-connectivity to be optimal , 2007, Discret. Math..

[22]  Bih-Sheue Shieh,et al.  On connectivity of the Cartesian product of two graphs , 1999, Appl. Math. Comput..

[23]  Meng Xiang-jun.  Sufficient Conditions for Graphs to be λ′—Optimal and Super—λ′ , 2009 .

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