Pages that link to "Item:Q1598853"
From MaRDI portal
The following pages link to Fault-tolerant locating-dominating sets (Q1598853):
Displaying 50 items.
- Identification in \(\mathbb Z^2\) using Euclidean balls (Q628317) (← links)
- Open neighborhood locating-dominating in trees (Q628345) (← links)
- On locating--dominating sets in infinite grids (Q819007) (← links)
- On a new class of identifying codes in graphs (Q845971) (← links)
- Fault tolerant detectors for distinguishing sets in graphs (Q891327) (← links)
- Improved bounds on identifying codes in binary Hamming spaces (Q966138) (← links)
- Routing sets in the integer lattice (Q997064) (← links)
- On \(r\)-locating-dominating sets in paths (Q1024298) (← links)
- On identifying codes in the hexagonal mesh (Q1029036) (← links)
- Liar's domination in graphs (Q1045132) (← links)
- On the identification problems in products of cycles (Q1420607) (← links)
- Locating-dominating sets in hypergraphs (Q1677551) (← links)
- On identification in the triangular grid (Q1826954) (← links)
- Improved lower bound for locating-dominating codes in binary Hamming spaces (Q2068380) (← links)
- Perfect domination ratios of Archimedean lattices (Q2088708) (← links)
- Locating-dominating sets: from graphs to oriented graphs (Q2092344) (← links)
- On the 2-metric resolvability of graphs (Q2132227) (← links)
- Extremal cubic graphs for fault-tolerant locating domination (Q2143147) (← links)
- Domination parameters in hypertrees and sibling trees (Q2181261) (← links)
- Covering codes of a graph associated with a finite vector space (Q2214154) (← links)
- Fault-tolerant metric dimension of generalized wheels and convex polytopes (Q2214773) (← 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)
- Locating-dominating sets of functigraphs (Q2333813) (← links)
- Binary locating-dominating sets in rotationally-symmetric convex polytopes (Q2337871) (← links)
- Locating-paired-dominating sets in square grids (Q2346332) (← links)
- A note on the locating-total domination in graphs (Q2364093) (← links)
- On identifying codes that are robust against edge changes (Q2373878) (← links)
- An optimal locating-dominating set in the infinite triangular grid (Q2433724) (← links)
- Optimal identifying codes in the infinite 3-dimensional king grid (Q2441660) (← links)
- Locating and identifying codes in circulant networks (Q2446842) (← links)
- New lower bound for 2-identifying code in the square grid (Q2446847) (← links)
- Locating sensors in paths and cycles: the case of 2-identifying codes (Q2462318) (← links)
- Optimal locating-total dominating sets in strips of height 3 (Q2516671) (← links)
- Fault-tolerant detectors for distinguishing sets in cubic graphs (Q2659159) (← links)
- On redundant locating-dominating sets (Q2686136) (← links)
- Domination Parameters in Hypertrees (Q2795956) (← links)
- Minimum-Density Identifying Codes in Square Grids (Q2830060) (← links)
- Locating and liar domination of circulant networks. (Q2918554) (← links)
- Metric dimension of directed graphs (Q2935364) (← links)
- Liar's domination (Q3057104) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- The binary locating-dominating number of some convex polytopes (Q4604525) (← links)
- False alarms in fault-tolerant dominating sets in graphs (Q4908866) (← links)
- Edge Weighting Functions on Dominating Sets (Q4916094) (← links)
- Open-independent, open-locating-dominating sets (Q5006616) (← links)
- ON MULTIPLE INTRUDER LOCATING DOMINATION IN INFINITE GRIDS (Q5075640) (← links)
- Tolerant identification with Euclidean balls (Q5326789) (← links)
