Pages that link to "Item:Q2446294"
From MaRDI portal
The following pages link to Watching systems in graphs: an extension of identifying codes (Q2446294):
Displaying 13 items.
- Identifying path covers in graphs (Q396675) (← links)
- Maximum size of a minimum watching system and the graphs achieving the bound (Q496659) (← links)
- Extremal cubic graphs for fault-tolerant locating domination (Q2143147) (← links)
- On the watching number of graphs using discharging procedure (Q2143854) (← links)
- The watching system as a generalization of identifying code (Q2180726) (← links)
- Watching systems in the King grid (Q2376080) (← links)
- Choice identification of a graph (Q2440100) (← links)
- Optimal \((r,\leq 3)\)-locating-dominating codes in the infinite king grid (Q2444553) (← links)
- On redundant locating-dominating sets (Q2686136) (← links)
- Identifying codes and watching systems in Kneser graphs (Q2966507) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- (Q5135780) (← links)
- (Q6139605) (← links)
