Error-correcting open-locating-dominating sets
From MaRDI portal
cubic graphsdetection systemerror-correctionextremal graphsinfinite gridsNP-completenessopen-locating-dominating sets
Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Theory of error-correcting codes and error-detecting codes (94B99)
Cites work
- Characterizing extremal graphs for open neighbourhood location-domination
- Density of identifying codes of hexagonal grids with finite number of rows
- Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs
- Domination and location in acyclic graphs
- Fault tolerant detectors for distinguishing sets in graphs
- Fault-tolerant detectors for distinguishing sets in cubic graphs
- Fault-tolerant locating-dominating sets
- Generalized set dominating and separating systems
- 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?)
- scientific article; zbMATH DE number 6889668 (Why is no real title available?)
- Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
- On a new class of codes for identifying vertices in graphs
- On identifying codes
- On open neighborhood locating-dominating in graphs
- On strongly identifying codes
- Open neighborhood locating-dominating in trees
- Optimal error-detecting open-locating-dominating set on the infinite triangular grid
- Optimal open-locating-dominating sets in infinite triangular grids
This page was built for publication: Error-correcting open-locating-dominating sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7013958)
