Pages that link to "Item:Q819007"

The following pages link to On locating--dominating sets in infinite grids (Q819007):

Displaying 24 items.

• Fault tolerant detectors for distinguishing sets in graphs (Q891327) (← links)
• On \(r\)-locating-dominating sets in paths (Q1024298) (← links)
• Extremal cubic graphs for fault-tolerant locating domination (Q2143147) (← links)
• Domination parameters in hypertrees and sibling trees (Q2181261) (← links)
• Locating and identifying codes in circulant graphs (Q2244371) (← links)
• Locating-dominating codes in paths (Q2275442) (← links)
• Optimal bounds on codes for location in circulant graphs (Q2311421) (← links)
• Metric-locating-dominating sets of graphs for constructing related subsets of vertices (Q2333263) (← links)
• Binary locating-dominating sets in rotationally-symmetric convex polytopes (Q2337871) (← links)
• Locating-paired-dominating sets in square grids (Q2346332) (← links)
• On identifying codes that are robust against edge changes (Q2373878) (← links)
• Locating domination in bipartite graphs and their complements (Q2420423) (← links)
• Optimal \((r,\leq 3)\)-locating-dominating codes in the infinite king grid (Q2444553) (← links)
• Locating and identifying codes in circulant networks (Q2446842) (← links)
• Domination Parameters in Hypertrees (Q2795956) (← links)
• Liar's domination (Q3057104) (← links)
• Locating-Domination and Identification (Q3384611) (← links)
• The binary locating-dominating number of some convex polytopes (Q4604525) (← links)
• Open-independent, open-locating-dominating sets (Q5006616) (← links)
• ON MULTIPLE INTRUDER LOCATING DOMINATION IN INFINITE GRIDS (Q5075640) (← links)
• Fault-tolerant resolvability of some graphs of convex polytopes (Q6169631) (← links)
• On the binary locating-domination number of regular and strongly-regular graphs (Q6200320) (← links)
• Optimal local identifying and local locating-dominating codes (Q6614544) (← links)
• Optimal error-detection system for identifying codes (Q6663966) (← links)