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
• Minimum weight resolving sets of grid graphs
• The doubly metric dimension of cylinder graphs and torus graphs
• Fault-tolerant metric dimension of generalized wheels and convex polytopes
• On the geodesic identification of vertices in convex plane graphs
• Improved algorithm for the locating-chromatic number of trees
• The equidistant dimension of graphs
• On the connected metric dimension of graphs and their complements
• On metric dimension of P(n, 2)ʘK₁ graph
• The threshold dimension and irreducible graphs
• A note on \(k\)-metric dimensional graphs
• Unicyclic graphs with non-isolated resolving number $2$
• The solid-metric dimension
• The vertex-edge resolvability of some wheel-related graphs
• On unicyclic graphs of metric dimension 2 with vertices of degree 4
• Identifying codes and searching with balls in graphs
• Bounds on the sum of domination number and metric dimension of graphs
• Fault-tolerant edge metric dimension of certain families of graphs
• On the metric basis in wheels with consecutive missing spokes
• On the 2-metric resolvability of graphs
• FAULT-TOLERANT METRIC DIMENSION OF CIRCULANT GRAPHS
• Metric dimension and edge metric dimension of windmill graphs
• Metric dimension of generalized wheels
• Mixed metric dimension of some plane graphs
• Metric dimensions vs. cyclomatic number of graphs with minimum degree at least two
• On the neighbor-distinguishing in generalized Petersen graphs
• On the robustness of the metric dimension of grid graphs to adding a single edge
• Open-independent, open-locating-dominating sets
• TOTAL RESOLVING NUMBER OF CORONA OF GRAPHS AND COMPLETE GRAPHS
• A survey on enhanced power graphs of finite groups
• On adjacency metric dimension of some families of graph
• A note on the metric and edge metric dimensions of 2-connected graphs
• On vertices contained in all or in no metric basis
• Fault-tolerant metric dimension of two-fold heptagonal-nonagonal circular ladder
• Alternative parameterizations of \textsc{Metric Dimension}
• Resolvability and fault-tolerant resolvability structures of convex polytopes
• Edge metric dimension and mixed metric dimension of planar graph \(Q_n\)
• Truncated metric dimension for finite graphs
• Vertex and edge metric dimensions of cacti
• Resolving sets tolerant to failures in three-dimensional grids
• The effect of vertex and edge deletion on the edge metric dimension of graphs

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)