The following pages link to (Q3090475):
Displaying 12 items.
- Identifying codes and locating-dominating sets on paths and cycles (Q642979) (← links)
- Fault tolerant detectors for distinguishing sets in graphs (Q891327) (← links)
- Domination parameters in hypertrees and sibling trees (Q2181261) (← links)
- Locating-dominating codes in paths (Q2275442) (← links)
- Optimal bounds on codes for location in circulant graphs (Q2311421) (← links)
- Locating-paired-dominating sets in square grids (Q2346332) (← links)
- Locating and identifying codes in circulant networks (Q2446842) (← links)
- Fault-tolerant detectors for distinguishing sets in cubic graphs (Q2659159) (← links)
- Domination Parameters in Hypertrees (Q2795956) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- Open-independent, open-locating-dominating sets (Q5006616) (← links)
- Sharp bound on the truncated metric dimension of trees (Q6041544) (← links)
