Publication:3803159
From MaRDI portal
zbMath0656.05057MaRDI QIDQ3803159
Publication date: 1988
Related Items
On locating--dominating sets in infinite grids, Identification of points using disks, Computing the metric dimension of wheel related graphs, On the metric dimension of generalized tensor product of interval with paths and cycles, \(k\)-metric resolvability in graphs, LD-graphs and global location-domination in bipartite graphs, Identifying and locating-dominating codes on chains and cycles, On the metric basis in wheels with consecutive missing spokes, On the 2-metric resolvability of graphs, The identifying code, the locating-dominating, the open locating-dominating and the locating total-dominating problems under some graph operations, The difference between the metric dimension and the determining number of a graph, On identifying codes that are robust against edge changes, Locating-total dominating sets in twin-free graphs: a conjecture, Extremal cubic graphs for fault-tolerant locating domination, On a new class of identifying codes in graphs, A polyhedral approach to locating-dominating sets in graphs, On connected 3-\(\gamma_L\)-dot-critical graphs, Location-domination in line graphs, On strong metric dimension of graphs and their complements, Truncated metric dimension for finite graphs, The strong metric dimension of graphs and digraphs, Partition dimension of projective planes, On regular and new types of codes for location-domination, Coloring, location and domination of corona graphs, Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity, On the Roman domination stable graphs, Locating-dominating sets in hypergraphs, Optimal identifying codes in cycles and paths, On the metric dimension of join of a graph with empty graph(\(O_p\)), Linear-time algorithms for three domination-based separation problems in block graphs, Identifying codes in vertex-transitive graphs and strongly regular graphs, On the strong metric dimension of Cartesian and direct products of graphs, Fault tolerant detectors for distinguishing sets in graphs, Locating domination in bipartite graphs and their complements, On families of convex polytopes with constant metric dimension, Bounds on the locating Roman domination number in trees, The multibases of symmetric caterpillars, Graphs of order \(n\) with locating-chromatic number \(n-1\), Open neighborhood locating-dominating in trees, Locating-dominating codes: bounds and extremal cardinalities, On the metric dimension of circulant graphs, Locating-dominating sets in twin-free graphs, Location-domination and matching in cubic graphs, On the strong metric dimension of corona product graphs and join graphs, Locating-total domination in graphs, Bounds on the locating-domination number and differentiating-total domination number in trees, Identifying codes and locating-dominating sets on paths and cycles, Approximation complexity of metric dimension problem, Covering codes of a graph associated with a finite vector space, Well-located graphs: A collection of well-covered ones, Fault-tolerant metric dimension of generalized wheels and convex polytopes, Locating-total domination in claw-free cubic graphs, A note on \(k\)-metric dimensional graphs, Metric dimension and \(R\)-sets of connected graphs, On the upper bounds of fractional metric dimension of symmetric networks, The main vertices of a star set and related graph parameters, Centroidal localization game, Computing metric dimension of compressed zero divisor graphs associated to rings, On trees with unique locating kernels, Sharp bounds for partition dimension of generalized Möbius ladders, Computing the metric dimension of a graph from primary subgraphs, Metric dimension of crystal cubic carbon structure, Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds., Locating and identifying codes in circulant graphs, Conditional resolvability of honeycomb and hexagonal networks, Star complements in regular graphs: old and new results, On a conjecture regarding identification in Hamming graphs, Fault-tolerant resolvability in some classes of line graphs, Resolvability in subdivision of circulant networks \(C_n[1, k\)], Locating and paired-dominating sets in graphs, Locating-dominating codes in paths, The \(k\)-metric dimension of corona product graphs, Alternative parameterizations of \textsc{Metric Dimension}, Neighbor-locating colorings in graphs, The solid-metric dimension, Neighbor-locating coloring: graph operations and extremal cardinalities, Classification of upper bound sequences of local fractional metric dimension of rotationally symmetric hexagonal planar networks, Characterizing extremal graphs for open neighbourhood location-domination, Metric dimension of maximal outerplanar graphs, Upper bounds for binary identifying codes, On locating-dominating set of regular graphs, Locating and identifying codes in dihedral graphs, On \(r\)-locating-dominating sets in paths, Optimal bounds on codes for location in circulant graphs, Improved lower bound for locating-dominating codes in binary Hamming spaces, Resolvability and the upper dimension of graphs, Domination and location in twin-free digraphs, Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs, Liar's domination in graphs, The multiresolving sets of graphs with prescribed multisimilar equivalence classes, Resolvability in graphs and the metric dimension of a graph, On the \textsc{Distance Identifying Set} meta-problem and applications to the complexity of identifying problems on graphs, Metric-locating-dominating sets of graphs for constructing related subsets of vertices, Locating-dominating sets of functigraphs, Bounding the trace function of a hypergraph with applications, Locating-dominating sets: from graphs to oriented graphs, Locating-dominating sets and identifying codes in graphs of girth at least 5, Computing the metric dimension for chain graphs, Power graphs and exchange property for resolving sets, The metric dimension of Cayley digraphs, All metric bases and fault-tolerant metric dimension for square of grid, On metric dimension of P(n, 2)ʘK1 graph, Unnamed Item, Location domination number of line graph, Decomposition dimension of corona product of some classes of graphs, On the Connected Partition Dimension of a Wheel Related Graph, Vertex identification in trees, Unnamed Item, TOTAL RESOLVING NUMBER OF CORONA OF GRAPHS AND COMPLETE GRAPHS, The adjacency dimension of graphs, Unnamed Item, Bounds on the connected local dimension of graphs in terms of the marked dimension and the clique number, Sharp bound on the truncated metric dimension of trees, Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications, Unnamed Item, New bounds and constructions for neighbor-locating colorings of graphs, On redundant locating-dominating sets, On metric dimensions of symmetric graphs obtained by rooted product, \( [ 1 , 2 \)-dimension of graphs], Extremal Digraphs for open neighbourhood location-domination and identifying codes, Extremal graphs for the identifying code problem, On the metric dimension and diameter of circulant graphs with three jumps, An optimal locating-dominating set in the infinite triangular grid, Global location-domination in the join and Cartesian product of graphs, Domination and location in acyclic graphs, Unnamed Item, Unnamed Item, Nordhaus-Gaddum bounds for locating domination, Unnamed Item, Unnamed Item, On resolvability of a graph associated to a finite vector space, Optimal \((r,\leq 3)\)-locating-dominating codes in the infinite king grid, Locating and identifying codes in circulant networks, Location-2-Domination for Product of Graphs, The metric dimension of the lexicographic product of graphs, On Approximation Complexity of Metric Dimension Problem, 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, Unnamed Item, Unnamed Item, A linear algorithm for minimum 1-identifying codes in oriented trees, Locating and total dominating sets in trees, Unnamed Item, Liar's domination, Unnamed Item, The metric dimension of circulant graphs and their Cartesian products, Connected Resolvability of Graphs, On Connected Resolving Decompositions in Graphs, Varieties of Roman domination II, Discrepancies between metric dimension and partition dimension of a connected graph, Locating-Domination and Identification, GLOBAL LOCATION-DOMINATION IN THE LEXICOGRAPHIC PRODUCT AND CORONA OF GRAPHS, Computing the metric dimension of kayak paddles graph and cycles with chord, Unnamed Item, Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs, Unnamed Item, Lexicographic metric spaces: Basic properties and the metric dimension, ON CLASSES OF RATIONAL RESOLVING SETS OF DERIVED GRAPHS OF A PATH, On the Metric Dimension of Infinite Graphs, My Favorite Domination Conjectures in Graph Theory Are Bounded, Open-independent, open-locating-dominating sets, Finite metric and 𝑘-metric bases on ultrametric spaces, The open-locating-dominating number of some convex polytopes
