Pages that link to "Item:Q2189840"
From MaRDI portal
The following pages link to Identifying codes in line digraphs (Q2189840):
Displaying 8 items.
- Partial linear spaces and identifying codes (Q627920) (← links)
- On the minimum size of an identifying code over all orientations of a graph (Q1753015) (← links)
- Sufficient conditions for a digraph to admit a \((1, \leq \ell )\)-identifying code (Q2042600) (← links)
- Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets (Q2376092) (← links)
- Identifying codes on directed de Bruijn graphs (Q2416416) (← links)
- Characterizing identifying codes from the spectrum of a graph or digraph (Q2418997) (← links)
- A linear algorithm for minimum 1-identifying codes in oriented trees (Q2495905) (← links)
- Edge identifying codes (Q2857369) (← links)