Browsing by Author "Martínez Barona, Berenice"
Now showing items 1-7 of 7
-
(1, ≤ ℓ)-identifying codes in digraphs and graphs
(Universitat Politècnica de Catalunya, 2020-09-14)
Doctoral thesis
Open AccessThe main subject of this PhD thesis is the study of (1,=l)-identifying codes in digraphs. The results presented in this work are divided into three parts. The first one focusses on the structural properties of digraphs ... -
Characterizing identifying codes from the spectrum of a graph or digraph
(Elsevier, 2019-06-01)
Article
Open AccessA -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 l have distinct closed in-neighborhoods within C. As far as we know, it ... -
Characterizing identifying codes through the spectrum of a graph or digraph
(2017)
Conference report
Open Access -
Identifying codes from the spectrum of a graph or digraph
(LaBRI, 2019)
Conference report
Open Access -
Identifying codes in line digraphs
(Elsevier, 2020-10-15)
Article
Open AccessGiven 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-neighbourhood within C. In ... -
On identifying codes in line digraphs
(2019)
Conference report
Open Access -
Sufficient conditions for a digraph to admit a (1,=l)-identifying code
(2019)
Article
Open AccessA (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 ...
