Open locating-dominating sets in circulant graphs
From MaRDI portal
Publication:2062672
Recommendations
Cites work
- A new lower bound on the density of vertex identifying codes for the infinite hexagonal grid
- Discrete sensor placement problems in distribution networks
- Every planar map is four colorable. I: Discharging
- scientific article; zbMATH DE number 5717189 (Why is no real title available?)
- scientific article; zbMATH DE number 2159641 (Why is no real title available?)
- Identifying and locating-dominating codes on chains and cycles
- Identifying Codes and Covering Problems
- Locating and liar domination of circulant networks.
- Location-domination and matching in cubic graphs
- New bounds on the minimum density of an identifying code for the infinite hexagonal grid
- On the size of identifying codes in binary hypercubes
- Open neighborhood locating-domination for grid-like graphs
- Optimal open-locating-dominating sets in infinite triangular grids
Cited in
(12)- Characterizing extremal graphs for open neighbourhood location-domination
- Open neighborhood locating-domination for grid-like 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?)
- Maximum Covering Formulation for Open Locating Dominating Sets
- Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs
- Extremal Digraphs for open neighbourhood location-domination and identifying codes
- Open-locating dominating number for flower snarks
- On open-separating dominating codes in graphs
- Identifying open codes in trees and 4-cycle-free graphs of given maximum degree
- Main eigenvalues for normal matrices and mixed graphs
- Independent location-domination number of graphs
This page was built for publication: Open locating-dominating sets in circulant graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2062672)