Sufficient Conditions for a Digraph to Admit A (1, ≤ ℓ)-Identifying Code

@article{Balbuena2021SufficientCF,
  title={Sufficient Conditions for a Digraph to Admit A (1, ≤ ℓ)-Identifying Code},
  author={Camino Balbuena and Cristina Dalf'o and B. Mart'inez-Barona},
  journal={Discussiones Mathematicae Graph Theory},
  year={2021},
  volume={41},
  pages={853 - 872}
}
Abstract A (1, ≤ ℓ)-identifying code in a digraph D is a subset C of vertices of D such that all distinct subsets of vertices of cardinality at most ℓ have distinct closed in-neighbourhoods within C. In this paper, we give some sufficient conditions for a digraph of minimum in-degree δ− ≥ 1 to admit a (1, ≤ ℓ)-identifying code for ℓ ∈ {δ−, δ− + 1}. As a corollary, we obtain the result by Laihonen that states that a graph of minimum degree δ ≥ 2 and girth at least 7 admits a (1, ≤ δ)-identifying… 

Figures from this paper

Characterizing identifying codes from the spectrum of a graph or digraph
Identifying codes in line digraphs

References

SHOWING 1-10 OF 28 REFERENCES
Characterizing Extremal Digraphs for Identifying Codes and Extremal Cases of Bondy’s Theorem on Induced Subsets
TLDR
All finite digraphs which only admit their whole vertex set as an identifying code are classified, and all such infinite oriented graphs are classified.
On a New Class of Codes for Identifying Vertices in Graphs
We investigate a new class of codes for the optimal covering of vertices in an undirected graph G such that any vertex in G can be uniquely identified by examining the vertices that cover it. We
Identifying and locating-dominating codes: NP-Completeness results for directed graphs
TLDR
It is proved that, given a directed, asymmetric graph G and an integer k, the decision problem of the existence of a r-identifying code, or of an r-locating-dominating code, of size at most k in G, is NP-complete for any r/spl ges/1 and remains so even when restricted to strongly connected, directed,ymmetric, bipartite graphs.
Locating-Dominating Sets and Identifying Codes in Graphs of Girth at least 5
TLDR
This paper studies the size of a smallest locating-dominating set or identifying code for graphs of girth at least 5 and of given minimum degree, and uses the technique of vertex-disjoint paths to provide upper bounds on the minimum size of such sets.
Identifying Codes in Vertex-Transitive Graphs and Strongly Regular Graphs
TLDR
This work exhibits infinite families of vertex-transitive graphs with integer and fractional identifying codes of order |V|^a with a in {1/4,1/3,2/5}.
Upper bounds for binary identifying codes
...
1
2
3
...