The Cost of Edge-distinguishing of the Cartesian Product of Connected Graphs

Aleksandra Gorzkowska, Mohammad Hadi Shekarriz

A graph $G$ is said to be $d$-distinguishable if there is a vertex coloring of $G$ with a set of $d$ colors which breaks all of the automorphisms of $G$ but the identity. We call t…