scientific article; zbMATH DE number 3544092

zbMATH Open0349.05118MaRDI QIDQ4119237FDOQ4119237

Authors: Robert A. Melter, Frank Harary 

Publication date: 1976

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Metric spaces, metrizability (54E35) Graph theory (05C99)

Cited In (only showing first 100 items - show all)

• A comparison on metric dimension of graphs, line graphs, and line graphs of the subdivision graphs
• The partition dimension of strong product graphs and Cartesian product graphs
• On the strong partition dimension of graphs
• Extremal Graph Theory for Metric Dimension and Diameter
• Vertex and edge metric dimensions of unicyclic graphs
• Conditional resolvability of honeycomb and hexagonal networks
• Localization game on geometric and planar graphs
• Strong resolving partitions for strong product graphs and Cartesian product graphs
• Bounding the order of a graph using its diameter and metric dimension: a study through tree decompositions and VC dimension
• On the power graphs of certain finite groups
• On the metric dimensions for sets of vertices
• On Connected Resolving Decompositions in Graphs
• Metric and upper dimension of zero divisor graphs associated to commutative rings
• On randomly \(k\)-dimensional graphs
• On the edge dimension and the fractional edge dimension of graphs
• Locating a robber with multiple probes
• On metric dimension of nonbinary Hamming spaces
• Locating a backtracking robber on a tree
• Annihilating-ideal graphs of commutative rings
• Subdivisions in the robber locating game
• Simultaneous resolvability in families of corona product graphs
• The simultaneous strong metric dimension of graph families
• A robber locating strategy for trees
• Graph theory (algorithmic, algebraic, and metric problems)
• Centroidal localization game
• On optimal approximability results for computing the strong metric dimension
• The fractional \(k\)-metric dimension of graphs
• Computing the metric dimension of graphs by genetic algorithms
• Locating and paired-dominating sets in graphs
• The fractional \(k\)-truncated metric dimension of graphs
• Computing minimal doubly resolving sets of graphs
• Network verification via routing table queries
• On lower bounds for the metric dimension of graphs
• On graphs with same metric and upper dimension
• A note on the complexity of \(k\)\textsc{-metric dimension}
• Discrepancies between metric dimension and partition dimension of a connected graph
• Title not available (Why is that?)
• On the constant metric dimension of generalized Petersen graphs \(P(n, 4)\)
• Some properties of the multiset dimension of graphs
• On the partition dimension of trees
• On approximation complexity of metric dimension problem
• Vertex and edge dimension of hypergraphs
• On metric dimension of permutation graphs
• The Edge Partition Dimension of Graphs
• The robber locating game
• Computing the metric dimension of a graph from primary subgraphs
• Relationships between the 2-metric dimension and the 2-adjacency dimension in the lexicographic product of graphs
• On the metric dimension of imprimitive distance-regular graphs
• On approximation algorithm for the edge metric dimension problem
• Metric dimension and \(R\)-sets of connected 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
• Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds.
• Computing metric dimension of compressed zero divisor graphs associated to rings
• Resolvability in circulant graphs
• On the metric dimension of barycentric subdivision of Cayley graphs
• Sequential metric dimension for random graphs
• On the metric dimension of incidence graphs
• On the edge dimension of a graph
• On the strong metric dimension of the strong products of graphs
• On the metric dimension of certain metric manifolds
• On strong metric dimension of graphs and their complements
• Minimal doubly resolving sets and the strong metric dimension of some convex polytopes
• Is it possible to determine a point lying in a simplex if we know the distances from the vertices?
• On families of convex polytopes with constant metric dimension
• Metric dimension of some distance-regular graphs
• The metric dimension of metric spaces
• On the metric dimension of bilinear forms graphs
• On the metric dimension of circulant graphs
• The metric dimension of geometric spaces
• Liar's domination
• A linear time algorithm for metric dimension of cactus block graphs
• The \(k\)-metric dimension of the lexicographic product of graphs
• \(k\)-metric resolvability in graphs
• Closed formulae for the local metric dimension of corona product graphs
• On the strong metric dimension of product graphs
• Simultaneous resolvability in graph families
• On the strong metric dimension of Cartesian and direct products of graphs
• Approximation complexity of metric dimension problem
• On the commuting graph of semidihedral group
• On the locating chromatic number of Kneser graphs
• Uniquely identifying the edges of a graph: the edge metric dimension
• A note on the partition dimension of Cartesian product graphs
• A characterization of some graphs with metric dimension two
• On the metric dimension of corona product graphs
• On the local metric dimension of corona product graphs
• The \(k\)-metric dimension of corona product graphs
• The metric dimension of the lexicographic product of graphs
• 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
• Mixed metric dimension of graphs
• On the metric dimension of infinite graphs
• Resolvability in graphs and the metric dimension of a graph
• Destroying automorphisms by fixing nodes
• The strong metric dimension of graphs and digraphs
• Locating-dominating codes: bounds and extremal cardinalities
• On minimum metric dimension of honeycomb networks
• Graphs of order \(n\) with locating-chromatic number \(n-1\)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4119237)