scientific article
From MaRDI portal
Publication:3789614
zbMath0646.05065MaRDI QIDQ3789614
Charles J. Colbourn, Lorna K. Stewart, Peter J. Slater
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On locating--dominating sets in infinite grids, Identifying and locating-dominating codes on chains and cycles, The difference between the metric dimension and the determining number of a graph, Locating-total dominating sets in twin-free graphs: a conjecture, Approximability of identifying codes and locating-dominating codes, A polyhedral approach to locating-dominating sets in graphs, Location-domination in line graphs, Extremal cardinalities for identifying and locating-dominating codes in graphs, Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity, Locating-dominating sets in hypergraphs, Some results about a conjecture on identifying codes in complete suns, Some rainbow problems in graphs have complexity equivalent to satisfiability problems, On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results, Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard., On redundant locating-dominating sets, Open neighborhood locating-dominating in trees, \( [ 1 , 2 \)-dimension of graphs], Progress on fault-tolerant locating-dominating sets, On the size of identifying codes in triangle-free graphs, Locating-dominating sets in twin-free graphs, Bounds on the differentiating-total domination number of a tree, Location-domination and matching in cubic graphs, Identifying codes and locating-dominating sets on paths and cycles, Covering codes of a graph associated with a finite vector space, Well-located graphs: A collection of well-covered ones, Locating and identifying codes in circulant networks, On minimum dominating sets with minimum intersection, Unique (optimal) solutions: complexity results for identifying and locating-dominating codes, The metric dimension of the lexicographic product of graphs, Locating sensors in paths and cycles: the case of 2-identifying codes, On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs, Bounds on the locating-total domination number of a tree, Locating and paired-dominating sets in graphs, Determining sets, resolving sets, and the exchange property, Minimal identifying codes in trees and planar graphs with large girth, 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, On two variations of identifying codes, Bounds on the locating-total domination number in trees, The compared costs of domination location-domination and identification, Upper bounds for binary identifying codes, Locating-Domination and Identification, The determining number of a Cartesian product, Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs, Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs, On the \textsc{Distance Identifying Set} meta-problem and applications to the complexity of identifying problems on graphs, Locating-dominating sets of functigraphs, Locating-paired-dominating sets in square grids, Discriminating codes in bipartite graphs, Bibliography on domination in graphs and some basic definitions of domination parameters
