Fault-tolerant locating-dominating sets
From MaRDI portal
Publication:1598853
DOI10.1016/S0012-365X(01)00244-8zbMath1001.05090OpenAlexW2094351242WikidataQ128081770 ScholiaQ128081770MaRDI QIDQ1598853
Publication date: 28 May 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00244-8
Related Items (52)
On locating--dominating sets in infinite grids ⋮ A note on the locating-total domination in graphs ⋮ On the 2-metric resolvability of graphs ⋮ On identifying codes that are robust against edge changes ⋮ Extremal cubic graphs for fault-tolerant locating domination ⋮ On a new class of identifying codes in graphs ⋮ ON MULTIPLE INTRUDER LOCATING DOMINATION IN INFINITE GRIDS ⋮ Fault-tolerant detectors for distinguishing sets in cubic graphs ⋮ Tolerant identification with Euclidean balls ⋮ Metric dimension of directed graphs ⋮ Locating-dominating sets in hypergraphs ⋮ Domination parameters in hypertrees and sibling trees ⋮ Fault tolerant detectors for distinguishing sets in graphs ⋮ The metric dimension of the zero-divisor graph of a matrix semiring ⋮ On redundant locating-dominating sets ⋮ Identification in \(\mathbb Z^2\) using Euclidean balls ⋮ Open neighborhood locating-dominating in trees ⋮ \( [ 1 , 2 \)-dimension of graphs] ⋮ Progress on fault-tolerant locating-dominating sets ⋮ On the binary locating-domination number of regular and strongly-regular graphs ⋮ The binary locating-dominating number of some convex polytopes ⋮ An optimal locating-dominating set in the infinite triangular grid ⋮ Optimal identifying codes in the infinite 3-dimensional king grid ⋮ On the identification problems in products of cycles ⋮ Covering codes of a graph associated with a finite vector space ⋮ Fault-tolerant metric dimension of generalized wheels and convex polytopes ⋮ Locating and identifying codes in circulant networks ⋮ New lower bound for 2-identifying code in the square grid ⋮ Locating sensors in paths and cycles: the case of 2-identifying codes ⋮ Locating and identifying codes in circulant graphs ⋮ Edge Weighting Functions on Dominating Sets ⋮ Improved bounds on identifying codes in binary Hamming spaces ⋮ Locating-dominating codes in paths ⋮ Liar's domination ⋮ Domination Parameters in Hypertrees ⋮ Routing sets in the integer lattice ⋮ Optimal locating-total dominating sets in strips of height 3 ⋮ Locating-Domination and Identification ⋮ On \(r\)-locating-dominating sets in paths ⋮ Optimal bounds on codes for location in circulant graphs ⋮ Minimum-Density Identifying Codes in Square Grids ⋮ On identifying codes in the hexagonal mesh ⋮ Improved lower bound for locating-dominating codes in binary Hamming spaces ⋮ On identification in the triangular grid ⋮ Liar's domination in graphs ⋮ Metric-locating-dominating sets of graphs for constructing related subsets of vertices ⋮ Perfect domination ratios of Archimedean lattices ⋮ Locating-dominating sets of functigraphs ⋮ Locating-dominating sets: from graphs to oriented graphs ⋮ Open-independent, open-locating-dominating sets ⋮ Binary locating-dominating sets in rotationally-symmetric convex polytopes ⋮ Locating-paired-dominating sets in square grids
This page was built for publication: Fault-tolerant locating-dominating sets
