Optimal error-detecting open-locating-dominating set on the infinite triangular grid
From MaRDI portal
Cites work
- An optimal locating-dominating set in the infinite triangular grid
- Fault tolerant detectors for distinguishing sets in graphs
- Fault-tolerant locating-dominating sets
- Graphical parameters for classes of tumbling block graphs
- scientific article; zbMATH DE number 5717189 (Why is no real title available?)
- scientific article; zbMATH DE number 6889668 (Why is no real title available?)
- Identifying codes for infinite triangular grids with a finite number of rows
- Optimal open-locating-dominating sets in infinite triangular grids
Cited in
(9)- Fault-tolerant locating-dominating sets with error-correction
- Fault-tolerant detection systems on the infinite King grid
- A study on triple connected certified domination numbers in power graphs of triangular grids
- Error-detecting locating dominating sets of Mycielskian of a graph
- On open-separating dominating codes in graphs
- Fault-tolerant identifying codes in special classes of graphs
- Error-correcting open-locating-dominating sets
- Identifying open codes in trees and 4-cycle-free graphs of given maximum degree
- Fault-tolerant locating-dominating sets on the infinite king grid
This page was built for publication: Optimal error-detecting open-locating-dominating set on the infinite triangular grid
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6986005)