On the edge-connectivity and restricted edge-connectivity of a product of graphs

The product graph G"m*G"p of two given graphs G"m and G"p was defined by Bermond et al. [Large graphs with given degree and diameter II, J. Combin. Theory Ser. B 36 (1984) 32-48]. For this kind of graphs we provide bounds for two connectivity parameters (@l and @l^', edge-connectivity and restricted edge-connectivity, respectively), and state sufficient conditions to guarantee optimal values of these parameters. Moreover, we compare our results with other previous related ones for permutation graphs and cartesian product graphs, obtaining several extensions and improvements. In this regard, for any two connected graphs G"m, G"p of minimum degrees @d(G"m), @d(G"p), respectively, we show that @l(G"m*G"p) is lower bounded by both @d(G"m)[email protected](G"p) and @d(G"p)[email protected](G"m), an improvement of what is known for the edge-connectivity of G"mxG"p.

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

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

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

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

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

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

[7]  Weizhen Gu,et al.  On diameter of permutation graphs , 1999 .

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

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

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

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

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

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

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

[15]  Makoto Imase,et al.  Connectivity of Regular Directed Graphs with Small Diameters , 1985, IEEE Transactions on Computers.

[16]  G. Chartrand.  A Graph-Theoretic Approach to a Communications Problem , 1966 .

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

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

[19]  Camino Balbuena,et al.  On the restricted connectivity and superconnectivity in graphs with given girth , 2007, Discret. Math..

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

[21]  Claudine Peyrat,et al.  Sufficient conditions for maximally connected dense graphs , 1987, Discret. Math..