Identifying codes of Cartesian product of two cliques of the same size (Q1010656): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
Property / author | |||
Property / author: Sylvain Gravier / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Julien Moncel / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Ahmed Semri / rank | |||
Normal rank |
Revision as of 17:10, 10 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Identifying codes of Cartesian product of two cliques of the same size |
scientific article |
Statements
Identifying codes of Cartesian product of two cliques of the same size (English)
0 references
7 April 2009
0 references
Summary: We determine the minimum cardinality of an identifying code of \(K_n\square K_n\), the Cartesian product of two cliques of same size. Moreover we show that this code is unique, up to row and column permutations, when \(n\geq 5\) is odd. If \(n\geq 4\) is even, we exhibit two distinct optimal identifying codes.
0 references
identifying code
0 references
clique product
0 references
Cartesian product
0 references