Publication:4119237
From MaRDI portal
zbMath0349.05118MaRDI QIDQ4119237
Robert A. Melter, Frank Harary
Publication date: 1976
Related Items
Is it possible to determine a point lying in a simplex if we know the distances from the vertices?, A linear time algorithm for metric dimension of cactus block graphs, The \(k\)-metric dimension of the lexicographic product of graphs, Closed formulae for the local metric dimension of corona product graphs, \(k\)-metric resolvability in graphs, On the strong metric dimension of product graphs, Simultaneous resolvability in graph families, On the metric dimension of circulant and Harary graphs, The difference between the metric dimension and the determining number of a graph, Resolving-power dominating sets, On the fractional strong metric dimension of graphs, Complexity of metric dimension on planar graphs, Closed formulae for the strong metric dimension of lexicographic product graphs, On metric orbit spaces and metric dimension, The simultaneous metric dimension of families composed by lexicographic product graphs, Metric dimension of some distance-regular graphs, Coloring, location and domination of corona graphs, The metric dimension of metric spaces, The partition dimension of strong product graphs and Cartesian product graphs, On the strong metric dimension of Cartesian and direct products of graphs, On the strong partition dimension of graphs, On the metric dimension of bilinear forms graphs, The fractional metric dimension of graphs, On the metric dimension of circulant graphs, Minimal doubly resolving sets and the strong metric dimension of some convex polytopes, Approximation complexity of metric dimension problem, The structure and metric dimension of the power graph of a finite group, The metric dimension of geometric spaces, On the constant metric dimension of generalized Petersen graphs \(P(n, 4)\), Vertex and edge dimension of hypergraphs, On metric dimension of permutation graphs, The (weighted) metric dimension of graphs: hard and easy cases, The robber locating game, Relationships between the 2-metric dimension and the 2-adjacency dimension in the lexicographic product of graphs, Computing the metric dimension of a graph from primary subgraphs, On the metric dimension of imprimitive distance-regular graphs, Comparing the metric and strong dimensions of graphs, Signature codes for noisy multiple access adder channel, Vertices, edges, distances and metric dimension in graphs, Resolvability and strong resolvability in the direct product of graphs, On optimal approximability results for computing the strong metric dimension, Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds., On the metric dimension of barycentric subdivision of Cayley graphs, On randomly \(k\)-dimensional graphs, Graph theory (algorithmic, algebraic, and metric problems), A note on the partition dimension of Cartesian product graphs, On families of convex polytopes with constant metric dimension, Open neighborhood locating-dominating in trees, On the metric dimension of corona product graphs, Metric dimension and \(R\)-sets of connected graphs, Centroidal localization game, Conditional resolvability of honeycomb and hexagonal networks, Locating a robber on a graph, Simultaneous resolvability in families of corona product graphs, The \(k\)-metric dimension of corona product graphs, On the local metric dimension of corona product graphs, The simultaneous strong metric dimension of graph families, Network verification via routing table queries, On the locating chromatic number of Kneser graphs, The twin non-commuting graph of a group, Metric dimension and pattern avoidance in graphs, 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 the metric dimension of generalized tensor product of interval with paths and cycles, Computing the metric dimension of graphs by genetic algorithms, Destroying automorphisms by fixing nodes, The strong metric dimension of graphs and digraphs, Fault tolerant detectors for distinguishing sets in graphs, On the number of resolving pairs in graphs, The simultaneous metric dimension of graph families, Extending the metric dimension to graphs with missing edges, Locating-dominating codes: bounds and extremal cardinalities, Weak total resolvability in graphs, Extremal problems on detectable colorings of trees, On minimum metric dimension of honeycomb networks, Locating and paired-dominating sets in graphs, Computing minimal doubly resolving sets of graphs, deBruijn-like sequences and the irregular chromatic number of paths and cycles, Liar's domination in graphs, Graphs of order \(n\) with locating-chromatic number \(n-1\), Resolvability and the upper dimension of graphs, Resolvability in graphs and the metric dimension of a graph, Localization game on geometric and planar graphs, Uniquely identifying the edges of a graph: the edge metric dimension, Edge version of metric dimension and doubly resolving sets of the necklace graph, Symmetry properties of resolving sets and metric bases in hypercubes, Locating-dominating sets in hypergraphs, On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results, The strong metric dimension of the power graph of a finite group, Error-correcting codes from \(k\)-resolving sets, The metric dimension of some generalized Petersen graphs, On graphs with the maximum edge metric dimension, Computing the \(k\)-metric dimension of graphs, Computing metric dimension of compressed zero divisor graphs associated to rings, Sharp bounds for partition dimension of generalized Möbius ladders, Mixed metric dimension of graphs, On the metric dimension of incidence graphs, \(k\)-metric antidimension: a privacy measure for social graphs, The weighted 2-metric dimension of trees in the non-landmarks model, On the edge dimension of a graph, Bounds on the sum of domination number and metric dimension of graphs, On the metric dimension of infinite graphs, Variable neighborhood search for metric dimension and minimal doubly resolving set problems, Locating a robber on a graph via distance queries, Resolvability in circulant graphs, On the strong metric dimension of corona product graphs and join graphs, Edge metric dimension of some graph operations, The threshold dimension of a graph, Fault-tolerant resolvability in some classes of line graphs, Resolvability in subdivision of circulant networks \(C_n[1, k\)], On the fault-tolerant metric dimension of convex polytopes, The fractional metric dimension of permutation graphs, An IP-based swapping algorithm for the metric dimension and minimal doubly resolving set problems in hypercubes, Metric dimension, minimal doubly resolving sets, and the strong metric dimension for jellyfish graph and cocktail party graph, Further new results on strong resolving partitions for graphs, On metric dimension of nonbinary Hamming spaces, The multibases of symmetric caterpillars, Edge metric dimension of \(k\) multiwheel graph, Computing minimal doubly resolving sets and the strong metric dimension of the layer sun graph and the line graph of the layer sun graph, Fault-tolerant metric dimension of generalized wheels and convex polytopes, A note on \(k\)-metric dimensional graphs, On the geodesic identification of vertices in convex plane graphs, Improved algorithm for the locating-chromatic number of trees, Metric and upper dimension of zero divisor graphs associated to commutative rings, On approximation algorithm for the edge metric dimension problem, Asymptotic behavior of the edge metric dimension of the random graph, On the strong metric dimension of the strong products of graphs, The Local metric dimension of the lexicographic product of graphs, Edge metric dimension of some generalized Petersen graphs, Computing a metric basis of a 2-connected bipartite distance-hereditary graph, Local metric dimension of graphs: generalized hierarchical products and some applications, On the \(k\)-partition dimension of graphs, The connected metric dimension at a vertex of a graph, Alternative parameterizations of \textsc{Metric Dimension}, Neighbor-locating colorings in graphs, The solid-metric dimension, The metric dimension of \(\mathbb{Z}_n \times \mathbb{Z}_n \times \mathbb{Z}_n\) is \(\lfloor 3n/2 \rfloor \), Distance-based vertex identification in graphs: the outer multiset dimension, Metric dimension of Cayley digraphs of split metacyclic groups, On the edge metric dimension of convex polytopes and its related graphs, On the metric dimension of the folded \(n\)-cube, Fault-tolerant metric dimension of circulant graphs \(C_n(1,2,3)\), Low-dimensional representation of genomic sequences, Metric dimension of generalized wheels, On the fault-tolerant metric dimension of certain interconnection networks, The multiresolving sets of graphs with prescribed multisimilar equivalence classes, Metric-locating-dominating sets of graphs for constructing related subsets of vertices, The simultaneous local metric dimension of graph families, Computing the metric dimension of gear graphs, Computing metric dimension and metric basis of 2D lattice of alpha-boron nanotubes, Resolvability and fault-tolerant resolvability structures of convex polytopes, Computing the metric dimension for chain graphs, On the limiting distribution of the metric dimension for random forests, Identifying codes and searching with balls in graphs, On strong metric dimension of graphs and their complements, Computing the metric dimension of convex polytopes generated by wheel related graphs, A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs, Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity, The \(k\)-metric dimension, A robber locating strategy for trees, Locating a robber with multiple probes, On the metric dimension of join of a graph with empty graph(\(O_p\)), Partition dimension of rooted product graphs, Partition dimension of certain classes of series parallel graphs, On the metric dimension of Cartesian powers of a graph, Nordhaus-Gaddum bounds for locating domination, On the metric dimension, the upper dimension and the resolving number of graphs, On the partition dimension of a class of circulant graphs, Resolving the hypercube, On the fractional metric dimension of graphs, Locating a backtracking robber on a tree, Locating and total dominating sets in trees, On the strong metric dimension of tetrahedral diamond lattice, Discrepancies between metric dimension and partition dimension of a connected graph, Landmarks in graphs, Subdivisions in the robber locating game, The metric dimension for resolving several objects, The local metric dimension of strong product graphs, On the partition dimension of trees, Metric dimension and metric independence number of incidence graphs of symmetric designs, Unnamed Item, Minimum weight resolving sets of grid graphs, Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs, On the Metric Dimension of Infinite Graphs, The Fractional Strong Metric Dimension of Graphs, Unnamed Item, On the Connected Partition Dimension of a Wheel Related Graph, Metric Dimension for Amalgamations of Graphs, Metric Dimension of Bounded Width Graphs, On the metric dimension of a zero-divisor graph, On Approximation Complexity of Metric Dimension Problem, Liar's domination, The metric dimension of annihilator graphs of commutative rings, Local Distance Pattern Distinguishing Sets in Graphs, Connected Resolvability of Graphs, On Connected Resolving Decompositions in Graphs, Computing the metric dimension of kayak paddles graph and cycles with chord, On the metric dimension of some families of graphs, Some structural, metric and convex properties on the boundary of a graph, Extremal Graph Theory for Metric Dimension and Diameter, On the metric dimension and diameter of circulant graphs with three jumps, Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension, The metric dimension of circulant graphs and their Cartesian products, The metric dimension of the enhanced power graph of a finite group, Edge version of metric dimension for the families of grid graphs and generalized prism graphs, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Metric dimension of Andrásfai graphs, Resolvability of Hamming Graphs, Metric Dimension of Graph Join P2 and Pt, Resolving domination number of graphs, A Bound for the Locating Chromatic Numbers of Trees, Bounds on the sum of broadcast domination number and strong metric dimension of graphs, Metric dimension of metric transform and wreath product, On the k-metric dimension of metric spaces, Resolving sets of directed Cayley graphs for the direct product of cyclic groups, ON CLASSES OF RATIONAL RESOLVING SETS OF DERIVED GRAPHS OF A PATH, On strong metric dimension of zero-divisor graphs of rings, Metric Dimension of Bounded Tree-length Graphs, The 2-dimension of a Tree, A characterization of some graphs with metric dimension two, On resolvability of a graph associated to a finite vector space, The metric dimension of the lexicographic product of graphs, Sequential metric dimension, Strong resolving partitions for strong product graphs and Cartesian product graphs, Tracking routes in communication networks, A polynomial sized kernel for tracking paths problem
