REVIEW
Identifying codes of Cartesian product of two cliques
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Identifying codes of Cartesian product of two cliques
classification
math.CO
keywords
cartesiancliquesidentifyingproductcodecardinalityclosedcodes
abstract
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. 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.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.