On the impact of one vertex or edge removal on distance-based invariants for Cartesian product graphs

In this paper, we summarize some properties of the Cartesian product of graphs related to degree and distance-based invariants. Then, we investigate how much a single edge or vertex removal in the Cartesian product of two connected graphs impacts: the distance between any pair of nodes, the average distance, and the diameter in the remaining graph.