Identifying codes of Cartesian product of two cliques
From MaRDI portal
Abstract: An identifying code in a graph is a dominating set such that the closed neighborhood of each vertex in has a distinct intersection with . In 2008, Gravier et al. determined the minimum cardinality of an identifying code of the Cartesian product of two cliques with the same size. In this note, we generalize this result to the Cartesian product of any two nontrivial cliques.
This page was built for publication: Identifying codes of Cartesian product of two cliques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6242106)
