On r-locating-dominating sets in paths
From MaRDI portal
Publication:1024298
DOI10.1016/J.EJC.2008.04.011zbMATH Open1186.05092OpenAlexW2055159300MaRDI QIDQ1024298FDOQ1024298
Authors: Iiro Honkala 
Publication date: 17 June 2009
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2008.04.011
Recommendations
Cites Work
- On a new class of codes for identifying vertices in graphs
- Identifying and locating-dominating codes on chains and cycles
- Title not available (Why is that?)
- Structural properties of twin-free graphs
- Identifying codes of cycles
- Bounds on identifying codes
- Title not available (Why is that?)
- Identifying codes with small radius in some infinite regular graphs
- Fault-tolerant locating-dominating sets
- Title not available (Why is that?)
- Locating sensors in paths and cycles: the case of 2-identifying codes
- An optimal locating-dominating set in the infinite triangular grid
- On locating--dominating sets in infinite grids
Cited In (5)
- Identifying codes and locating-dominating sets on paths and cycles
- Optimal identifying codes in cycles and paths
- Locating-domination and identification
- The identifying code, the locating-dominating, the open locating-dominating and the locating total-dominating problems under some graph operations
- Locating-dominating codes in paths
This page was built for publication: On \(r\)-locating-dominating sets in paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024298)
