Browsing Articles publicats (Matemàtica) by Subject "Identifying code"
Now showing items 1-3 of 3
-
Characterizing identifying codes from the spectrum of a graph or digraph
(Elsevier, 2019)A (1, ≤ ℓ)-identifying code in digraph D is a dominating subset C of vertices of D, such that all distinct subsets of vertices of D with cardinality at most ℓ have distinct closed in-neighborhoods within C. As far as we ... -
Identifying codes in line digraphs
(Elsevier, 2020-05-21)Given an integer ≥1, a (1, ≤ )-identifying code in a digraph is a dominating subset C of vertices such that all distinct subsets of vertices of cardinality at most have distinct closed in-neighborhoods within C . In ... -
Sufficient conditions for a digraph to admit a (1,≤ℓ)-identifying code
(University of Zielona Góra, 2019)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 ...