On connectivity of the cartesian product of two graphs (Q1294201): Difference between revisions

A graph \(G=(V,E)\) is maximum vertex-connected (maximum edge-connected) if its vertex-connectivity (edge-connectivity) equals \(\Bigl\lfloor \tfrac{2| E| }{| V| }\Bigr\rfloor \). Sufficient conditions for the cartesian product of two graphs to be maximum vertex-connected (maximum edge-connected) are given.