Characterizing identifying codes from the spectrum of a graph or digraph

View/ Open
Issue date
2019Suggested citation
Balbuena Martínez, Camino;
Dalfó, Cristina;
Martínez Barona, Berenice;
.
(2019)
.
Characterizing identifying codes from the spectrum of a graph or digraph.
Linear Algebra and its Applications, 2019, vol. 570, p. 138-147.
https://doi.org/10.1016/j.laa.2019.02.010.
Metadata
Show full item recordAbstract
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 of
Linear Algebra and its Applications, 2019, vol. 570, p. 138-147European research projects
Collections
The following license files are associated with this item:
Related items
Showing items related by title, author, creator and subject.
-
Spectra and eigenspaces from regular partitions of Cayley (di)graphs of permutation groups
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 ... -
Sufficient conditions for a digraph to admit a (1,≤ℓ)-identifying code
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 ... -
Identifying codes in line digraphs
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 ...