Connectivity and super-connectivity of Cartesian product graphs

Abstract

This paper determines that the connectivity of the Cartesian product G1 G2 of two graphs G1 and G2 is equal to min{κ1v2, κ2v1, δ1 + δ2}, where vi, κi, δi is the order, the connectivity and the minimum degree of Gi, respectively, for i = 1, 2, and gives some necessary and sufficient conditions for G1 G2 to be maximally connected and super-connected.

Extracted Key Phrases

4 Figures and Tables

Cite this paper

@article{Xu2010ConnectivityAS, title={Connectivity and super-connectivity of Cartesian product graphs}, author={Jun-Ming Xu and Chao Yang}, journal={Ars Comb.}, year={2010}, volume={95} }