Pages that link to "Item:Q2430979"
From MaRDI portal
The following pages link to Extremal graphs for the identifying code problem (Q2430979):
Displayed 19 items.
- Identifying path covers in graphs (Q396675) (← links)
- On the size of identifying codes in triangle-free graphs (Q427898) (← links)
- Maximum size of a minimum watching system and the graphs achieving the bound (Q496659) (← links)
- Information retrieval and the average number of input clues (Q514538) (← links)
- Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs (Q742603) (← links)
- Identifying codes in vertex-transitive graphs and strongly regular graphs (Q888612) (← links)
- Locating-dominating sets in twin-free graphs (Q906432) (← links)
- Operads of finite posets (Q1753009) (← links)
- On the minimum size of an identifying code over all orientations of a graph (Q1753015) (← links)
- Minimum sizes of identifying codes in graphs differing by one edge (Q2016394) (← links)
- Characterizing extremal graphs for open neighbourhood location-domination (Q2043360) (← links)
- The compared costs of domination location-domination and identification (Q2282469) (← links)
- Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets (Q2376092) (← links)
- Minimum sizes of identifying codes in graphs differing by one vertex (Q2392684) (← links)
- On minimum identifying codes in some Cartesian product graphs (Q2409538) (← links)
- (Q2857369) (← links)
- Identifying codes and watching systems in Kneser graphs (Q2966507) (← links)
- (Q5135780) (← links)
- Identifying Codes in Line Graphs (Q5325952) (← links)