S. Panma

On the Edge Connectivity of k-Distance Graph Products Involving Paths and Cycles.

By decomposing the k-distance product G \square_k H of two graphs G and H into the Cartesian product of graph powers, we determine its exact edge connectivity \kappa'. Leveraging this result, we completely formulate edge connectivity for k-distance products of path-path, cycle-cycle, and hybrid path-cycle graph pairs a...