ON THE EDGE-CONNECTIVITY OF CARTESIAN PRODUCT GRAPHS

Authors:

Abstract
A short proof for the closed expression of the edge-connectivity of Cartesian product graphs is given and the structure of minimum edge cuts is described. It is also proved that the connectivity and edge-connectivity of an arbitrary Cartesian power equals its minimum degree.

This publication has 8 references indexed in Scilit: