Loading...
Loading...

Go to the content (press return)

Characterizing identifying codes from the spectrum of a graph or digraph

Author
Balbuena, C.; Dalfo, C.; Martínez, B.
Type of activity
Journal article
Journal
Linear algebra and its applications
Date of publication
2019-06-01
Volume
570
First page
138
Last page
147
DOI
10.1016/j.laa.2019.02.010
Repository
http://hdl.handle.net/2117/165511 Open in new window
URL
https://www.sciencedirect.com/science/article/abs/pii/S0024379519300655 Open in new window
Abstract
A -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 l 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 l for digraphs. The results obtained here can also be applied to graphs.
Citation
Balbuena, C.; Dalfo, C.; Martínez, B. Characterizing identifying codes from the spectrum of a graph or digraph. "Linear algebra and its applications", 1 Juny 2019, vol. 570, p. 138-147.
Keywords
Graph, adjacency matrix, digraph, eigenvectors, identifying code, spectrum
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications