Identifying codes of Cartesian product of two cliques

Yingnan Zhang, Min Feng, Kaishun Wang

An identifying code in a graph $G$ is a dominating set $C$ such that the closed neighborhood of each vertex in $G$ has a distinct intersection with $C$. In 2008, Gravier et al. det…