论文信息 - A note on the connectivity of Kronecker products of graphs

A note on the connectivity of Kronecker products of graphs

Abstract Let κ ( G ) be the connectivity of G . The Kronecker product G 1 × G 2 of graphs G 1 and G 2 has vertex set V ( G 1 × G 2 ) = V ( G 1 ) × V ( G 2 ) and edge set E ( G 1 × G 2 ) = { ( u 1 , v 1 ) ( u 2 , v 2 ) : u 1 u 2 ∈ E ( G 1 ) and v 1 v 2 ∈ E ( G 2 ) } . In this paper, we prove that κ ( G × K n ) = min { n κ ( G ) , ( n − 1 ) δ ( G ) } , where G is a bipartite graph.

Elkin Vumar | Raxida Guji | Elkin Vumar | Raxida Guji

[1] Sandi Klavžar,et al. ON THE EDGE-CONNECTIVITY OF CARTESIAN PRODUCT GRAPHS , 2008 .

[2] D. West. Introduction to Graph Theory , 1995 .

[3] Simon Spacapan,et al. Connectivity of Cartesian products of graphs , 2008, Appl. Math. Lett..

[4] S. A. Ghozati. A finite automata approach to modeling the cross product of interconnection networks , 1999 .

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

[6] N. Alon,et al. Independent sets in tensor graph powers , 2007 .

[7] Bostjan Bresar,et al. On the connectivity of the direct product of graphs , 2008, Australas. J Comb..

[8] W. Imrich,et al. Product Graphs: Structure and Recognition , 2000 .

[9] Wilfried Imrich,et al. Hypercubes As Direct Products , 2005, SIAM J. Discret. Math..

[10] Aygul Mamut,et al. Vertex vulnerability parameters of Kronecker products of complete graphs , 2008, Inf. Process. Lett..

[11] Yves Métivier,et al. Some Remarks on the Kronecker Product of Graphs , 1998, Inf. Process. Lett..