Characterizing identifying codes from the spectrum of a graph or digraph

DOI10.1016/j.laa.2019.02.010zbMath1411.05098OpenAlexW2767169846WikidataQ128311879 ScholiaQ128311879MaRDI QIDQ2418997

C. Dalfó, Berenice Martínez-Barona, Camino Balbuena

Publication date: 29 May 2019

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2117/165511

zbMATH Keywords

digrapheigenvectorsspectrumadjacency matrixidentifying code

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Theory of error-correcting codes and error-detecting codes (94B99)

Related Items (4)

Lower bounds for the spectral norm of digraphs ⋮ Identifying codes in line digraphs ⋮ Strong identification codes for graphs ⋮ Sufficient conditions for a digraph to admit a \((1, \leq \ell )\)-identifying code

Cites Work

• The spectra of some families of digraphs
• Graph partitioning by eigenvectors
• Problems in algebraic combinatorics
• On cages admitting identifying codes
• On a new class of codes for identifying vertices in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Characterizing identifying codes from the spectrum of a graph or digraph