Characterizing identifying codes from the spectrum of a graph or digraph
Visualitza/Obre
Cita com:
hdl:2117/165511
Tipus de documentArticle
Data publicació2019-06-01
EditorElsevier
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
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.
Citació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.
ISSN0024-3795
Versió de l'editorhttps://www.sciencedirect.com/science/article/abs/pii/S0024379519300655
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
Codis+espectreSubmittedCorrected(08-02-19).pdf | 363,1Kb | Visualitza/Obre |