Pages that link to "Item:Q2346565"
From MaRDI portal
The following pages link to On the ensemble of optimal dominating and locating-dominating codes in a graph (Q2346565):
Displaying 10 items.
- On the ensemble of optimal identifying codes in a twin-free graph (Q267807) (← links)
- On the number of optimal identifying codes in a twin-free graph (Q476309) (← links)
- Unique (optimal) solutions: complexity results for identifying and locating-dominating codes (Q1733054) (← links)
- Which graphs occur as \(\gamma\)-graphs? (Q2191276) (← links)
- Covering codes of a graph associated with a finite vector space (Q2214154) (← links)
- Binary locating-dominating sets in rotationally-symmetric convex polytopes (Q2337871) (← links)
- Optimal \((r,\leq 3)\)-locating-dominating codes in the infinite king grid (Q2444553) (← links)
- The binary locating-dominating number of some convex polytopes (Q4604525) (← links)
- On Stronger Types of Locating-dominating Codes (Q5377220) (← links)
- On the binary locating-domination number of regular and strongly-regular graphs (Q6200320) (← links)