Revisiting and Improving Upper Bounds for Identifying Codes
From MaRDI portal
Publication:5048300
DOI10.1137/22M148999XzbMath1503.05092arXiv2204.05250OpenAlexW4308731351MaRDI QIDQ5048300
Tuomo Lehtilä, Florent Foucaud
Publication date: 15 November 2022
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2204.05250
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (3)
On three domination-based identification problems in block graphs ⋮ Bounds and extremal graphs for total dominating identifying codes ⋮ The \textsc{Red-Blue Separation} problem on graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The difference between the metric dimension and the determining number of a graph
- Locating-total dominating sets in twin-free graphs: a conjecture
- Bounds for identifying codes in terms of degree parameters
- Bounds on the locating-total domination number of a tree
- On graphs having a \(V\setminus \{x\}\) set as an identifying code
- On separating systems
- Locating-dominating sets in twin-free graphs
- Bounds on the differentiating-total domination number of a tree
- Minimal identifying codes in trees and planar graphs with large girth
- Bounds on the locating-domination number and differentiating-total domination number in trees
- Identifying and locating-dominating codes on chains and cycles
- Bounds on the identifying codes in trees
- Locating-dominating sets: from graphs to oriented graphs
- Locating-dominating sets and identifying codes in graphs of girth at least 5
- Extremal graphs for the identifying code problem
- Locating and total dominating sets in trees
- Induced subsets
- Identifying Codes in Hereditary Classes of Graphs and VC-Dimension
- Domination and location in acyclic graphs
- On a new class of codes for identifying vertices in graphs
- Total Domination in Graphs
This page was built for publication: Revisiting and Improving Upper Bounds for Identifying Codes
