Characterizing identifying codes from the spectrum of a graph or digraph

Balbuena Martínez, Camino; Dalfó, Cristina; Martínez Barona, Berenice

doi:https://doi.org/10.1016/j.laa.2019.02.010

View/Open

Postprint (374.1Kb)
Sol·licita una còpia

Issue date

2019

Author

Balbuena Martínez, Camino

Dalfó, Cristina

Martínez Barona, Berenice

Suggested 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.

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.

URI

http://hdl.handle.net/10459.1/65753

DOI

https://doi.org/10.1016/j.laa.2019.02.010

Is part of

Linear Algebra and its Applications, 2019, vol. 570, p. 138-147

Collections

The following license files are associated with this item:

Creative Commons

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