The following pages link to On strongly identifying codes (Q1613540):
Displayed 20 items.
- Open neighborhood locating-dominating in trees (Q628345) (← links)
- On identifying codes in binary Hamming spaces (Q696908) (← links)
- Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs (Q742603) (← links)
- Fault tolerant detectors for distinguishing sets in graphs (Q891327) (← links)
- Optimal codes for strong identification (Q1612759) (← links)
- Families of optimal codes for strong identification (Q1613402) (← links)
- Separating codes and traffic monitoring (Q1704860) (← links)
- Characterizing extremal graphs for open neighbourhood location-domination (Q2043360) (← links)
- Optimal open-locating-dominating sets in infinite triangular grids (Q2354721) (← links)
- On identifying codes that are robust against edge changes (Q2373878) (← links)
- Fault-tolerant detectors for distinguishing sets in cubic graphs (Q2659159) (← links)
- (Q2741420) (← links)
- Separating Codes and Traffic Monitoring (Q2830061) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- Open-independent, open-locating-dominating sets (Q5006616) (← links)
- The open-locating-dominating number of some convex polytopes (Q5014387) (← links)
- My Favorite Domination Conjectures in Graph Theory Are Bounded (Q5506786) (← links)
- (Q5889911) (← links)
- Bounds and extremal graphs for total dominating identifying codes (Q6133156) (← links)
- Extremal Digraphs for open neighbourhood location-domination and identifying codes (Q6202938) (← links)