Identifying codes of Cartesian product of two cliques of the same size
From MaRDI portal
Publication:1010656
zbMath1180.05088MaRDI QIDQ1010656
Sylvain Gravier, Julien Moncel, Ahmed Semri
Publication date: 7 April 2009
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/117195
Fault detection; testing in circuits and networks (94C12) Other types of codes (94B60) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Related Items
On identifying codes in the Cartesian product of a path and a complete graph ⋮ Identifying codes in the complementary prism of cycles ⋮ New results on variants of covering codes in Sierpiński graphs ⋮ Optimal identifying codes of two families of Cayley graphs ⋮ On regular and new types of codes for location-domination ⋮ On minimum identifying codes in some Cartesian product graphs ⋮ Identifying codes in vertex-transitive graphs and strongly regular graphs ⋮ Improved upper bounds for identifying codes in \(n\)-dimensional \(q\)-ary cubes ⋮ Identifying codes of the direct product of two cliques ⋮ Identifying codes in the direct product of a complete graph and some special graphs ⋮ Identifying codes of corona product graphs ⋮ On the number of optimal identifying codes in a twin-free graph ⋮ New results of identifying codes in product graphs ⋮ On a conjecture regarding identification in Hamming graphs ⋮ Tolerant location detection in sensor networks
This page was built for publication: Identifying codes of Cartesian product of two cliques of the same size
