The compared costs of domination location-domination and identification
From MaRDI portal
Publication:2282469
DOI10.7151/dmgt.2129zbMath1498.05208OpenAlexW2860023469MaRDI QIDQ2282469
Olivier Hudry, Antoine C. Lobstein
Publication date: 8 January 2020
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2129
Related Items
Cites Work
- Extremal cardinalities for identifying and locating-dominating codes in graphs
- On graphs having a \(V\setminus \{x\}\) set as an identifying code
- On graphs having domination number half their order
- Extremal graphs for the identifying code problem
- Domination-balanced graphs
- On a new class of codes for identifying vertices in graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item