Publication:4464781
From MaRDI portal
zbMath1039.05029MaRDI QIDQ4464781
Publication date: 27 May 2004
distance; connected graph; resolving set; metric dimension; decomposition dimension; orientable dimension
05C90: Applications of graph theory
05C12: Distance in graphs
05C20: Directed graphs (digraphs), tournaments
Related Items
Bounds on the sum of domination number and metric dimension of graphs, On the metric dimension and diameter of circulant graphs with three jumps, Different-Distance Sets in a Graph, On resolvability of a graph associated to a finite vector space, The metric dimension of the lexicographic product of graphs, Computing the metric dimension of wheel related graphs, The fractional metric dimension of graphs, The (weighted) metric dimension of graphs: hard and easy cases, On randomly \(k\)-dimensional graphs, Approximation for the minimum cost doubly resolving set problem, Discovery of network properties with all-shortest-paths queries, Edge version of metric dimension and doubly resolving sets of the necklace graph, On the locating chromatic number of certain barbell graphs, The weighted 2-metric dimension of trees in the non-landmarks model, On the metric dimension of infinite graphs, 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, Fault-tolerant metric dimension of generalized wheels and convex polytopes, On the edge metric dimension of convex polytopes and its related graphs, Fault-tolerant metric dimension of circulant graphs \(C_n(1,2,3)\), On the fault-tolerant metric dimension of certain interconnection networks, Resolvability and fault-tolerant resolvability structures of convex polytopes, 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, The \(k\)-metric dimension, On the strong metric dimension of tetrahedral diamond lattice, Discrepancies between metric dimension and partition dimension of a connected graph, Minimum weight resolving sets of grid graphs, Discovery of Network Properties with All-Shortest-Paths Queries
