On regular and new types of codes for location-domination

DOI10.1016/J.DAM.2018.03.050zbMath1422.94052OpenAlexW2809230192MaRDI QIDQ1671339

Ville Junnila, Tuomo Lehtilä, Tero Laihonen

Publication date: 6 September 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.03.050

zbMATH Keywords

Hamming spacesensor networklocating-dominating setlocating-dominating coderook's graph

Mathematics Subject Classification ID

Other types of codes (94B60) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

On a conjecture regarding identification in Hamming graphs ⋮ The solid-metric dimension ⋮ Locating-Domination and Identification ⋮ Improved lower bound for locating-dominating codes in binary Hamming spaces

Cites Work

• On a new class of identifying codes in graphs
• New identifying codes in the binary Hamming space
• Identifying codes of Cartesian product of two cliques of the same size
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On regular and new types of codes for location-domination