On strongly identifying codes
From MaRDI portal
Publication:1613540
DOI10.1016/S0012-365X(01)00357-0zbMath1005.94029MaRDI QIDQ1613540
Sanna Ranto, Tero Laihonen, Iiro S. Honkala
Publication date: 29 August 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00357-0
Related Items
Open-independent, open-locating-dominating sets, The open-locating-dominating number of some convex polytopes, My Favorite Domination Conjectures in Graph Theory Are Bounded, Unnamed Item, 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 identifying codes in binary Hamming spaces, Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs, Fault tolerant detectors for distinguishing sets in graphs, Optimal codes for strong identification, Families of optimal codes for strong identification, Separating codes and traffic monitoring, Characterizing extremal graphs for open neighbourhood location-domination, Optimal open-locating-dominating sets in infinite triangular grids, On identifying codes that are robust against edge changes, Unnamed Item, Fault-tolerant detectors for distinguishing sets in cubic graphs, Separating Codes and Traffic Monitoring, Locating-Domination and Identification
