On super edge-connectivity of Cartesian product graphs

The super edge-connectivity λ′ of a connected graph G is the minimum cardinality of an edge-cut F in G such that every component of G - F contains at least two vertices. Let Gi be a connected graph with order ni, minimum degree δi and edge-connectivity λi for i = 1, 2. This article shows that λ′(G1 × G2) ≥ minln1λ2, n2λ1, λ1 + 2 λ2, 2 λ1 + λ 2r for n1, n2 ≥ 3 and λ′(K2 × G2) = minl n2, 2λ2r, which generalizes the main result of Shieh on the super edge-connectedness of the Cartesian product of two regular graphs with maximum edge-connectivity. In particular, this article determines λ′(G1 × G2) = minln1δ2, n2δ1, ξlG1 × G2)r if λ′(Gi) = ξ(Gi), where ξ(G) is the minimum edge-degree of a graph G. © 2006 Wiley Periodicals, Inc. NETWORKS, Vol. 49(2), 152–157 2007

[1]  Jixiang Meng,et al.  On a kind of restricted edge connectivity of graphs , 2002, Discret. Appl. Math..

[2]  Xu Jun-ming.  On Restricted Edge-Connectivity of Vertex-Transitive Graphs , 2004 .

[3]  Lutz Volkmann,et al.  Restricted edge-connectivity and minimum edge-degree , 2003, Ars Comb..

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

[5]  Junming Xu.  Topological Structure and Analysis of Interconnection Networks , 2002, Network Theory and Applications.

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

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

[8]  Jun-Ming Xu,et al.  Super Connectivity of Line Graphs and Digraphs , 2006 .

[9]  Junming Xu,et al.  Theory and Application of Graphs , 2003, Network Theory and Applications.

[10]  Abdol-Hossein Esfahanian,et al.  Generalized Measures of Fault Tolerance with Application to N-Cube Networks , 1989, IEEE Trans. Computers.

[11]  Jun-Ming Xu,et al.  Super connectivity of line graphs , 2005, Inf. Process. Lett..

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

[13]  Jun-Ming Xu,et al.  ON RESTRICTED ARC-CONNECTIVITY OF REGULAR DIGRAPHS , 2005 .

[14]  Jhing-Fa Wang,et al.  The number of spanning trees of the regular networks , 1988 .

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

[16]  Linda .LESNIAK.  Results on the edge-connectivity of graphs , 1974, Discret. Math..

[17]  Jhing-Fa Wang,et al.  Graph theoretic reliability analysis for the Boolean n cube networks , 1988 .