Fault-tolerant identifying codes in special classes of graphs

DOI10.7151/DMGT.2465MaRDI QIDQ6985920zbMATH OpenFDO

Authors Devin C. Jean, Suk J. Seo

Publication date 12 May 2025

Published in Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7151/DMGT.2465

zbMATH Keywords

densitydetection systemdominationfault-tolerantidentifying-coderedundant-identifying-code

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Linear codes (general theory) (94B05)

Cites work

• Bounds for codes identifying vertices in the hexagonal grid
• Domination and location in acyclic graphs
• Fault tolerant detectors for distinguishing sets in graphs
• Fault-tolerant locating-dominating sets
• scientific article; zbMATH DE number 5717189 (Why is no real title available?)
• scientific article; zbMATH DE number 4053685 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Locating-dominating sets in twin-free graphs
• Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
• New bounds on the minimum density of an identifying code for the infinite hexagonal grid
• On a new class of codes for identifying vertices in graphs
• On identifying codes
• Optimal error-detecting open-locating-dominating set on the infinite triangular grid
• Watching systems in graphs: an extension of identifying codes

Cited in

(2)

• Fault-tolerant locating-dominating sets with error-correction
• Fault-tolerant detection systems on the infinite King grid

This page was built for publication: Fault-tolerant identifying codes in special classes of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6985920)