On a conjecture regarding identification in Hamming graphs
From MaRDI portal
Publication:2001977
zbMath1418.94075MaRDI QIDQ2001977
Tero Laihonen, Ville Junnila, Tuomo Lehtilä
Publication date: 11 July 2019
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v26i2p45
Linear codes (general theory) (94B05) Bounds on codes (94B65) Orthogonal arrays, Latin squares, Room squares (05B15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial codes (94B25)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- More results on the complexity of identifying problems in graphs
- On identifying codes in the Cartesian product of a path and a complete graph
- On a new class of identifying codes in graphs
- Identifying codes in vertex-transitive graphs and strongly regular graphs
- Locating-dominating codes: bounds and extremal cardinalities
- Identifying codes of Cartesian product of two cliques of the same size
- On regular and new types of codes for location-domination
- On minimum identifying codes in some Cartesian product graphs
- Embedding Incomplete Latin Squares
- Identifying Codes in Hereditary Classes of Graphs and VC-Dimension
- Domination and location in acyclic graphs
- On a new class of codes for identifying vertices in graphs
- Minimum Number of Input Clues in Robust Information Retrieval
- Connected Identifying Codes
This page was built for publication: On a conjecture regarding identification in Hamming graphs
