Sufficient conditions for a digraph to admit a \((1, \leq \ell )\)-identifying code
From MaRDI portal
Publication:2042600
DOI10.7151/dmgt.2218zbMath1468.05090arXiv1902.04913OpenAlexW2949252613MaRDI QIDQ2042600
C. Dalfó, Berenice Martínez-Barona, Camino Balbuena
Publication date: 21 July 2021
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1902.04913
Other types of codes (94B60) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20) Combinatorial codes (94B25)
Cites Work
- Partial linear spaces and identifying codes
- Codes identifying sets of vertices in random networks
- Identifying codes in vertex-transitive graphs and strongly regular graphs
- Improved bounds on identifying codes in binary Hamming spaces
- New identifying codes in the binary Hamming space
- On identifying codes in the King grid that are robust against edge deletions
- Upper bounds for binary identifying codes
- Construction of codes identifying sets of vertices
- Identifying and locating-dominating codes on chains and cycles
- Locating-dominating sets and identifying codes in graphs of girth at least 5
- Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets
- Characterizing identifying codes from the spectrum of a graph or digraph
- On cages admitting identifying codes
- A linear algorithm for minimum 1-identifying codes in oriented trees
- On a new class of codes for identifying vertices in graphs
- Identifying and locating-dominating codes: NP-completeness results for directed graphs
- Unnamed Item
- Unnamed Item
This page was built for publication: Sufficient conditions for a digraph to admit a \((1, \leq \ell )\)-identifying code
