Pages that link to "Item:Q2016394"
From MaRDI portal
The following pages link to Minimum sizes of identifying codes in graphs differing by one edge (Q2016394):
Displaying 9 items.
- On the ensemble of optimal identifying codes in a twin-free graph (Q267807) (← links)
- A comparison of approaches for finding minimum identifying codes on graphs (Q296102) (← links)
- On the number of optimal identifying codes in a twin-free graph (Q476309) (← links)
- Structural properties of twin-free graphs (Q870075) (← links)
- Minimum sizes of identifying codes in graphs differing by one vertex (Q2392684) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- Identifying codes with small radius in some infinite regular graphs (Q5960786) (← links)
- On Iiro Honkala's contributions to identifying codes (Q6614534) (← links)
- Commutative rings introduce a class of identifiable graphs (Q6670665) (← links)