Connectivity measures in matched sum graphs

A matched sum graph G of two graphs G"1 and G"2 of the same order is obtained from the union of G"1 and G"2 and from joining each vertex of G"1 with one vertex of G"2 according to one bijection f between the vertices in V(G"1) and V(G"2). When G"1=G"2=H then f is just a permutation of V(H) and the corresponding matched sum graph is a permutation graph H^f. In this paper, we derive lower bounds for the connectivity, edge-connectivity, and different conditional connectivities in matched sum graphs, and present sufficient conditions which guarantee maximum values for these conditional connectivities.

[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]  Richard D. Ringeisen,et al.  Connectivity of generalized prisms over G , 1991, Discret. Appl. Math..

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

[5]  Camino Balbuena,et al.  Every cubic cage is quasi 4-connected , 2003, Discret. Math..

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

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

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

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

[10]  XU Jun-ming,et al.  On Restricted Connectivity and Extra Connectivity of Hypercubes and Folded Hypercubes , 2005 .

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

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

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

[14]  John P. Georges,et al.  On generalized Petersen graphs labeled with a condition at distance two , 2002, Discret. Math..

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

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