Identifying codes of Cartesian product of two cliques of the same size

MaRDI QIDQ1010656zbMATH OpenFDO

Authors 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, http://www.emis.de/journals/EJC/Volume_15/Abstracts/v15i1n4.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

Cartesian productidentifying codeclique product

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76) Fault detection; testing in circuits and networks (94C12) Other types of codes (94B60)

Recommendations

• Identifying codes of the direct product of two cliques
• ID codes in Cartesian products of cliques
• On identifying codes in the Cartesian product of a path and a complete graph
• On minimum identifying codes in some Cartesian product graphs
• Identifying codes of lexicographic product of graphs
• Identifying codes in the direct product of a complete graph and some special graphs
• New results of identifying codes in product graphs
• On perfect codes in Cartesian products of graphs
• Optimal identifying codes of two families of Cayley graphs
• Identifying codes in some subgraphs of the square lattice

Cited in

(16)

• New results on variants of covering codes in Sierpiński graphs
• On the number of optimal identifying codes in a twin-free graph
• On identifying codes in the Cartesian product of a path and a complete graph
• Identifying codes in the complementary prism of cycles
• Tolerant location detection in sensor networks
• ID codes in Cartesian products of cliques
• On regular and new types of codes for location-domination
• Identifying codes in the direct product of a complete graph and some special graphs
• On a conjecture regarding identification in Hamming graphs
• Identifying codes of the direct product of two cliques
• Identifying codes of corona product graphs
• Optimal identifying codes of two families of Cayley graphs
• New results of identifying codes in product graphs
• On minimum identifying codes in some Cartesian product graphs
• Improved upper bounds for identifying codes in n-dimensional q-ary cubes
• Identifying codes in vertex-transitive graphs and strongly regular graphs

This page was built for publication: Identifying codes of Cartesian product of two cliques of the same size

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010656)