Characterizing identifying codes from the spectrum of a graph or digraph
MetadataShow full item record
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 know, it is the very first time that the spectral graph theory has been applied to the identifying codes. We give a new method to obtain an upper bound on ℓ for digraphs. The results obtained here can also be applied to graphs.
Is part ofLinear Algebra and its Applications, 2019, vol. 570, p. 138-147
European research projects
The following license files are associated with this item:
Showing items related by title, author, creator and subject.
Dalfó, Cristina; Fiol, Miguel Angel (Elsevier, 2020)In this paper, we present a method to obtain regular (or equitable) partitions of Cayley (di)graphs (that is, graphs, digraphs, or mixed graphs) of permutation groups on n letters. We prove that every partition of the ...
Balbuena Martínez, Camino; Dalfó, Cristina; Martínez Barona, Berenice (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 ...
Balbuena Martínez, Camino; Dalfó, Cristina; Martínez Barona, Berenice (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 ...