Show simple item record

dc.contributor.authorBalbuena, C.
dc.contributor.authorDalfó, Cristina
dc.contributor.authorMartínez Barona, B.
dc.date.accessioned2019-02-20T08:40:32Z
dc.date.issued2019
dc.identifier.issn0024-3795
dc.identifier.urihttp://hdl.handle.net/10459.1/65753
dc.description.abstractA (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.sponsorshipThis research is supported by the Catalan Research Council under project 2014SGR1147. B. Martínez-Barona has received funding from the scholarship 254379/438356 from CONACYT from Mexico.he 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.mimetypeapplication/pdf
dc.language.isoeng
dc.publisherElsevier
dc.relation.isformatofVersió postprint del document publicat a https://doi.org/10.1016/j.laa.2019.02.010
dc.relation.ispartofLinear Algebra and its Applications, 2019, vol. 570, p. 138-147
dc.rightscc-by-nc-nd (c) Elsevier, 2019
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es
dc.subjectGraph
dc.subjectDigraph
dc.subjectIdentifying code
dc.titleCharacterizing identifying codes from the spectrum of a graph or digraph
dc.typeinfo:eu-repo/semantics/article
dc.date.updated2019-02-20T08:40:33Z
dc.identifier.idgrec028335
dc.type.versioninfo:eu-repo/semantics/acceptedVersion
dc.rights.accessRightsinfo:eu-repo/semantics/embargoedAccess
dc.identifier.doihttps://doi.org/10.1016/j.laa.2019.02.010
dc.relation.projectIDinfo:eu-repo/grantAgreement/EC/H2020/734922/EU/INPATH-TES
dc.date.embargoEndDate2021-06-01


Files in this item

Thumbnail
Thumbnail
Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

cc-by-nc-nd (c) Elsevier, 2019
Except where otherwise noted, this item's license is described as cc-by-nc-nd (c) Elsevier, 2019