On strongly identifying codes
From MaRDI portal
Publication:1613540
DOI10.1016/S0012-365X(01)00357-0zbMath1005.94029OpenAlexW2065210330MaRDI 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 (20)
Optimal codes for strong identification ⋮ Families of optimal codes for strong identification ⋮ On identifying codes that are robust against edge changes ⋮ Unnamed Item ⋮ Fault-tolerant detectors for distinguishing sets in cubic graphs ⋮ Fault tolerant detectors for distinguishing sets in graphs ⋮ Bounds and extremal graphs for total dominating identifying codes ⋮ Open neighborhood locating-dominating in trees ⋮ Extremal Digraphs for open neighbourhood location-domination and identifying codes ⋮ Separating codes and traffic monitoring ⋮ Unnamed Item ⋮ On identifying codes in binary Hamming spaces ⋮ Characterizing extremal graphs for open neighbourhood location-domination ⋮ Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs ⋮ Locating-Domination and Identification ⋮ Separating Codes and Traffic Monitoring ⋮ My Favorite Domination Conjectures in Graph Theory Are Bounded ⋮ Open-independent, open-locating-dominating sets ⋮ The open-locating-dominating number of some convex polytopes ⋮ Optimal open-locating-dominating sets in infinite triangular grids
This page was built for publication: On strongly identifying codes
