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