Pages that link to "Item:Q2418997"
From MaRDI portal
The following pages link to Characterizing identifying codes from the spectrum of a graph or digraph (Q2418997):
Displaying 5 items.
- Strong identification codes for graphs (Q2037550) (← links)
- Sufficient conditions for a digraph to admit a \((1, \leq \ell )\)-identifying code (Q2042600) (← links)
- Identifying codes in line digraphs (Q2189840) (← links)
- Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets (Q2376092) (← links)
- Lower bounds for the spectral norm of digraphs (Q2656645) (← links)