On strongly identifying codes
From MaRDI portal
Given an undirected graph \(G=(V,E)\), the set of all vertices within distance \(t\) from a vertex \(v \in V\) is denoted by \(B_t(v)\). A set \(C \subseteq V\) is called a \(t\)-identifying code if all sets \(B_t(v)\cap C\) are nonempty and different. The authors define a new type of identifying codes, called strongly identifying codes, motivated by an application related to locating malfunctioning processors in a network. Bounds and constructions for these codes are given when \(G\) is the \(n\)-cube.
Recommendations
Cited in
(33)- Optimal codes for strong identification
- Families of optimal codes for strong identification
- Separating codes and traffic monitoring
- A class of I.P.P. codes with efficient identification
- Characterizing extremal graphs for open neighbourhood location-domination
- Improved upper bounds for identifying codes in n-dimensional q-ary cubes
- Optimal open-locating-dominating sets in infinite triangular grids
- On identifying codes that are robust against edge changes
- Fault-tolerant detectors for distinguishing sets in cubic graphs
- Codes for strong identification
- Separating codes and traffic monitoring
- Locating-domination and identification
- On robust and dynamic identifying codes
- Open-independent, open-locating-dominating sets
- The open-locating-dominating number of some convex polytopes
- My favorite domination conjectures in graph theory are bounded
- Some results on the open locating-total domination number in graphs
- Bounds and extremal graphs for total dominating identifying codes
- Extremal Digraphs for open neighbourhood location-domination and identifying codes
- Open neighborhood locating-dominating in trees
- On Iiro Honkala's contributions to identifying codes
- Fault-tolerant locating-dominating sets on the infinite tumbling block graph
- Optimal error-detection system for identifying codes
- On full-separating sets and related codes in graphs
- Open-locating dominating number for flower snarks
- On open-separating dominating codes in graphs
- On identifying codes in binary Hamming spaces
- On full-separating sets in graphs
- Error-correcting open-locating-dominating sets
- Identifying open codes in trees and 4-cycle-free graphs of given maximum degree
- Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs
- Combinatorial identification problems and graph powers
- Fault tolerant detectors for distinguishing sets in graphs
This page was built for publication: On strongly identifying codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1613540)
