Pages that link to "Item:Q426794"
From MaRDI portal
The following pages link to Bounds for identifying codes in terms of degree parameters (Q426794):
Displaying 12 items.
- On the size of identifying codes in triangle-free graphs (Q427898) (← links)
- Bounds on the identifying codes in trees (Q2000553) (← links)
- Strong identification codes for graphs (Q2037550) (← links)
- Locating-dominating sets and identifying codes in graphs of girth at least 5 (Q2344817) (← links)
- On the limiting distribution of the metric dimension for random forests (Q2349959) (← links)
- Identifying codes and searching with balls in graphs (Q2355743) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- Revisiting and Improving Upper Bounds for Identifying Codes (Q5048300) (← links)
- (Q6075963) (← links)
- Bounds and extremal graphs for total dominating identifying codes (Q6133156) (← links)
- (Q6139605) (← links)
- Extremal Digraphs for open neighbourhood location-domination and identifying codes (Q6202938) (← links)