Fault-tolerant locating-dominating sets
From MaRDI portal
Publication:1598853
DOI10.1016/S0012-365X(01)00244-8zbMath1001.05090WikidataQ128081770 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
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
The binary locating-dominating number of some convex polytopes, Edge Weighting Functions on Dominating Sets, Open-independent, open-locating-dominating sets, ON MULTIPLE INTRUDER LOCATING DOMINATION IN INFINITE GRIDS, Tolerant identification with Euclidean balls, \( [ 1 , 2 \)-dimension of graphs], Progress on fault-tolerant locating-dominating sets, Identification in \(\mathbb Z^2\) using Euclidean balls, Open neighborhood locating-dominating in trees, On locating--dominating sets in infinite grids, On a new class of identifying codes in graphs, Fault tolerant detectors for distinguishing sets in graphs, Improved bounds on identifying codes in binary Hamming spaces, Routing sets in the integer lattice, On \(r\)-locating-dominating sets in paths, On identifying codes in the hexagonal mesh, Liar's domination in graphs, On the identification problems in products of cycles, Locating-dominating sets in hypergraphs, On identification in the triangular grid, Improved lower bound for locating-dominating codes in binary Hamming spaces, Perfect domination ratios of Archimedean lattices, Locating-dominating sets: from graphs to oriented graphs, On the 2-metric resolvability of graphs, Extremal cubic graphs for fault-tolerant locating domination, Domination parameters in hypertrees and sibling trees, 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 graphs, Locating-dominating codes in paths, Optimal bounds on codes for location in circulant graphs, Metric-locating-dominating sets of graphs for constructing related subsets of vertices, Locating-dominating sets of functigraphs, Binary locating-dominating sets in rotationally-symmetric convex polytopes, Locating-paired-dominating sets in square grids, A note on the locating-total domination in graphs, On identifying codes that are robust against edge changes, An optimal locating-dominating set in the infinite triangular grid, Optimal identifying codes in the infinite 3-dimensional king grid, 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, Optimal locating-total dominating sets in strips of height 3, Fault-tolerant detectors for distinguishing sets in cubic graphs, On redundant locating-dominating sets, Domination Parameters in Hypertrees, Minimum-Density Identifying Codes in Square Grids, Metric dimension of directed graphs, Liar's domination, Locating-Domination and Identification
