Pages that link to "Item:Q1883609"
From MaRDI portal
The following pages link to Identifying and locating-dominating codes on chains and cycles (Q1883609):
Displaying 19 items.
- Optimal identifying codes in the infinite 3-dimensional king grid (Q2441660) (← links)
- Watching systems in graphs: an extension of identifying codes (Q2446294) (← links)
- Locating and identifying codes in circulant networks (Q2446842) (← links)
- Identifying codes of corona product graphs (Q2449061) (← links)
- Locating sensors in paths and cycles: the case of 2-identifying codes (Q2462318) (← links)
- Identifying codes of cycles (Q2488842) (← links)
- A linear algorithm for minimum 1-identifying codes in oriented trees (Q2495905) (← links)
- Fault-tolerant detectors for distinguishing sets in cubic graphs (Q2659159) (← links)
- Complexity results for identifying codes in planar graphs (Q3002553) (← links)
- Liar's domination (Q3057104) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- Solving Two Conjectures regarding Codes for Location in Circulant Graphs (Q4611776) (← links)
- Minimum identifying codes in some graphs differing by matchings (Q4965914) (← links)
- Open-independent, open-locating-dominating sets (Q5006616) (← links)
- Revisiting and Improving Upper Bounds for Identifying Codes (Q5048300) (← links)
- On Stronger Types of Locating-dominating Codes (Q5377220) (← links)
- On three domination-based identification problems in block graphs (Q6614535) (← links)
- An extension of locating-total domination problem and its complexity (Q6652677) (← links)
- Commutative rings introduce a class of identifiable graphs (Q6670665) (← links)