The following pages link to (Q4329059):
Displayed 14 items.
- Which trees have a differentiating-paired dominating set? (Q543501) (← links)
- Improved bounds on identifying codes in binary Hamming spaces (Q966138) (← links)
- New identifying codes in the binary Hamming space (Q966160) (← links)
- Locating and paired-dominating sets in graphs (Q967383) (← links)
- On \(r\)-locating-dominating sets in paths (Q1024298) (← links)
- Polyhedra associated with identifying codes in graphs (Q1752479) (← links)
- Optimal identifying codes in cycles and paths (Q1926037) (← links)
- Locating and total dominating sets in trees (Q2495911) (← links)
- Liar's domination (Q3057104) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- Revisiting and Improving Upper Bounds for Identifying Codes (Q5048300) (← links)
- (Q5074499) (← links)
- Links Between Discriminating and Identifying Codes in the Binary Hamming Space (Q5386104) (← links)
- Bounds and extremal graphs for total dominating identifying codes (Q6133156) (← links)