Optimal open-locating-dominating sets in infinite triangular grids
From MaRDI portal
Publication:2354721
DOI10.1016/j.dam.2015.04.024zbMath1317.05138arXiv1403.7061OpenAlexW2963139974MaRDI QIDQ2354721
Allison Oldham, Rex K. Kincaid, Gexin Yu
Publication date: 24 July 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1403.7061
Related Items (10)
Fault tolerant detectors for distinguishing sets in graphs ⋮ Extremal Digraphs for open neighbourhood location-domination and identifying codes ⋮ Characterizing extremal graphs for open neighbourhood location-domination ⋮ Locating-Domination and Identification ⋮ Open locating-dominating sets in circulant graphs ⋮ Metric-locating-dominating sets of graphs for constructing related subsets of vertices ⋮ Perfect domination ratios of Archimedean lattices ⋮ Locating-dominating sets of functigraphs ⋮ Complexity results on open-independent, open-locating-dominating sets in complementary prism graphs ⋮ Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs
Cites Work
- Unnamed Item
- Open neighborhood locating-dominating in trees
- An optimal strongly identifying code in the infinite triangular grid
- On strongly identifying codes
- An optimal edge-robust identifying code in the triangular lattice
- Lower bounds for identifying codes in some infinite grids
- A new lower bound on the density of vertex identifying codes for the infinite hexagonal grid
- An optimal locating-dominating set in the infinite triangular grid
- New bounds on the minimum density of an identifying code for the infinite hexagonal grid
- Bounds for Codes Identifying Vertices in the Hexagonal Grid
- On a new class of codes for identifying vertices in graphs
- Exact Minimum Density of Codes Identifying Vertices in the Square Grid
This page was built for publication: Optimal open-locating-dominating sets in infinite triangular grids
