dc.contributor.author
Balbuena Martínez, Camino
dc.contributor.author
Dalfó, Cristina
dc.contributor.author
Martínez Barona, Berenice
dc.date.accessioned
2024-12-05T22:40:27Z
dc.date.available
2024-12-05T22:40:27Z
dc.date.issued
2019-02-20T08:40:32Z
dc.date.issued
2021-06-01T22:24:33Z
dc.date.issued
2019-02-20T08:40:33Z
dc.identifier
https://doi.org/10.1016/j.laa.2019.02.010
dc.identifier
http://hdl.handle.net/10459.1/65753
dc.identifier.uri
http://hdl.handle.net/10459.1/65753
dc.description.abstract
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.
dc.description.abstract
This research is supported by the Catalan Research Council under project 2014SGR1147. The second and third authors have also received funding from the European Union's Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 734922.
dc.format
application/pdf
dc.relation
Versió postprint del document publicat a https://doi.org/10.1016/j.laa.2019.02.010
dc.relation
Linear Algebra and its Applications, 2019, vol. 570, p. 138-147
dc.relation
info:eu-repo/grantAgreement/EC/H2020/734922/EU/CONNECT
dc.rights
cc-by-nc-nd (c) Elsevier, 2019
dc.rights
info:eu-repo/semantics/openAccess
dc.rights
http://creativecommons.org/licenses/by-nc-nd/3.0/es
dc.subject
Identifying code
dc.title
Characterizing identifying codes from the spectrum of a graph or digraph
dc.type
info:eu-repo/semantics/article
dc.type
info:eu-repo/semantics/acceptedVersion
