scientific article
From MaRDI portal
Publication:3684148
zbMath0568.05033MaRDI QIDQ3684148
Douglas F. Rall, Peter J. Slater
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (48)
On locating--dominating sets in infinite grids ⋮ Identification of points using disks ⋮ Identifying Codes in Hereditary Classes of Graphs and VC-Dimension ⋮ On identifying codes that are robust against edge changes ⋮ Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets ⋮ Locating-total dominating sets in twin-free graphs: a conjecture ⋮ On a new class of identifying codes in graphs ⋮ On connected 3-\(\gamma_L\)-dot-critical graphs ⋮ Location-domination in line graphs ⋮ On regular and new types of codes for location-domination ⋮ Locating-dominating sets in hypergraphs ⋮ Locating domination in bipartite graphs and their complements ⋮ Neighbourhood complexity of graphs of bounded twin-width ⋮ On three domination-based identification problems in block graphs ⋮ Open neighborhood locating-dominating in trees ⋮ Extremal graphs for the identifying code problem ⋮ On the size of identifying codes in triangle-free graphs ⋮ Locating-dominating sets in twin-free graphs ⋮ Location-domination and matching in cubic graphs ⋮ An optimal locating-dominating set in the infinite triangular grid ⋮ Covering codes of a graph associated with a finite vector space ⋮ Locating and identifying codes in circulant networks ⋮ Discriminating codes in (bipartite) planar graphs ⋮ Parameterized and approximation complexity of \textsc{Partial VC Dimension} ⋮ Computing the \(k\)-metric dimension of graphs ⋮ Locating sensors in paths and cycles: the case of 2-identifying codes ⋮ Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds. ⋮ On a conjecture regarding identification in Hamming graphs ⋮ Locating and paired-dominating sets in graphs ⋮ Determining sets, resolving sets, and the exchange property ⋮ A linear algorithm for minimum 1-identifying codes in oriented trees ⋮ Locating and total dominating sets in trees ⋮ Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes ⋮ Locating-dominating codes in paths ⋮ Liar's domination ⋮ The solid-metric dimension ⋮ Locating-Domination and Identification ⋮ The determining number of a Cartesian product ⋮ Optimal bounds on codes for location in circulant graphs ⋮ Improved lower bound for locating-dominating codes in binary Hamming spaces ⋮ Domination and location in twin-free digraphs ⋮ Locating-dominating sets of functigraphs ⋮ Bounding the trace function of a hypergraph with applications ⋮ Locating-dominating sets: from graphs to oriented graphs ⋮ On the density of identifying codes in the square lattice ⋮ Locating-paired-dominating sets in square grids ⋮ On the ensemble of optimal dominating and locating-dominating codes in a graph ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters
This page was built for publication:
