Characterizing identifying codes from the spectrum of a graph or digraph
From MaRDI portal
Recommendations
- On a new class of identifying codes in graphs
- Locating and identifying codes in dihedral graphs
- Locating and identifying codes in circulant graphs
- Identifying codes in vertex-transitive graphs and strongly regular graphs
- Identifying codes in line digraphs
- Extremal graphs for the identifying code problem
- Identifying codes of lexicographic product of graphs
- scientific article; zbMATH DE number 2186985
- On a new class of codes for identifying vertices in graphs
- Identifying codes in trees and planar graphs
Cites work
- An introduction to the theory of graph spectra
- Graph partitioning by eigenvectors
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 2081125 (Why is no real title available?)
- On a new class of codes for identifying vertices in graphs
- On cages admitting identifying codes
- Problems in algebraic combinatorics
- The spectra of some families of digraphs
Cited in
(7)- Strong identification codes for graphs
- Sufficient conditions for a digraph to admit a (1, )-identifying code
- Identifying codes in line digraphs
- Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets
- Lower bounds for the spectral norm of digraphs
- On identifying vertices of tournament digraphs
- Identifying codes in the direct product of a path and a complete graph
This page was built for publication: Characterizing identifying codes from the spectrum of a graph or digraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2418997)
