Pages that link to "Item:Q2426452"
From MaRDI portal
The following pages link to On cages admitting identifying codes (Q2426452):
Displaying 13 items.
- Optimal identification of sets of edges using 2-factors (Q389983) (← links)
- Extension of universal cycles for globally identifying colorings of cycles (Q526222) (← links)
- Partial linear spaces and identifying codes (Q627920) (← links)
- On a new class of identifying codes in graphs (Q845971) (← links)
- Codes identifying sets of vertices in random networks (Q870971) (← links)
- Identifying codes in vertex-transitive graphs and strongly regular graphs (Q888612) (← links)
- Minimal identifying codes in trees and planar graphs with large girth (Q976158) (← links)
- Sufficient conditions for a digraph to admit a \((1, \leq \ell )\)-identifying code (Q2042600) (← links)
- Locating and identifying codes in circulant graphs (Q2244371) (← links)
- On two variations of identifying codes (Q2275454) (← links)
- Characterizing identifying codes from the spectrum of a graph or digraph (Q2418997) (← links)
- Locating and identifying codes in circulant networks (Q2446842) (← links)
- Codes Identifying Vertices in Graphs (Q3439339) (← links)