On strongly identifying codes

DOI10.1016/S0012-365X(01)00357-0MaRDI QIDQ1613540zbMATH OpenOpenAlexFDO

Authors Tero Laihonen, Sanna Ranto, Iiro 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

zbMATH Keywords

identifying codestrongly identifying codes

Mathematics Subject Classification ID

Applications of graph theory (05C90) Bounds on codes (94B65) Other types of codes (94B60)

Recommendations

• scientific article; zbMATH DE number 2081125
• On a new class of identifying codes in graphs
• Codes for strong identification
• New bounds for codes identifying vertices in graphs
• Improved upper bounds for identifying codes in n-dimensional q-ary cubes

Cited in

(27)

• My favorite domination conjectures in graph theory are bounded
• On identifying codes in binary Hamming spaces
• On robust and dynamic identifying codes
• Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs
• Families of optimal codes for strong identification
• Optimal codes for strong identification
• Bounds and extremal graphs for total dominating identifying codes
• Locating-domination and identification
• Separating codes and traffic monitoring
• Codes for strong identification
• Fault tolerant detectors for distinguishing sets in graphs
• On Iiro Honkala's contributions to identifying codes
• Characterizing extremal graphs for open neighbourhood location-domination
• Fault-tolerant detectors for distinguishing sets in cubic graphs
• Open-independent, open-locating-dominating sets
• The open-locating-dominating number of some convex polytopes
• Combinatorial identification problems and graph powers
• Extremal Digraphs for open neighbourhood location-domination and identifying codes
• Some results on the open locating-total domination number in graphs
• Open neighborhood locating-dominating in trees
• Fault-tolerant locating-dominating sets on the infinite tumbling block graph
• Improved upper bounds for identifying codes in n-dimensional q-ary cubes
• A class of I.P.P. codes with efficient identification
• Optimal open-locating-dominating sets in infinite triangular grids
• On identifying codes that are robust against edge changes
• Optimal error-detection system for identifying codes
• Separating codes and traffic monitoring

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)