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)

• Bounds on the domination number and the metric dimension of co-normal product of graphs
• On the metric dimension of generalized tensor product of interval with paths and cycles
• The metric dimension of some generalized Petersen graphs
• A polynomial sized kernel for tracking paths problem
• Tracking routes in communication networks
• On the metric dimension, the upper dimension and the resolving number of graphs
• The adjacency dimension of graphs
• On graphs with the maximum edge metric dimension
• On some plane graphs and their metric dimension
• \(k\)-metric antidimension: a privacy measure for social graphs
• Some structural, metric and convex properties on the boundary of a graph
• The localization game on oriented graphs
• Sharp bounds for partition dimension of generalized Möbius ladders
• The weighted 2-metric dimension of trees in the non-landmarks model
• On upper dimension of graphs and their bases sets
• Metric dimension of Cayley digraphs of split metacyclic groups
• Extremal results for graphs of bounded metric dimension
• Computing metric dimension and metric basis of 2D lattice of alpha-boron nanotubes
• On the edge metric dimension of convex polytopes and its related graphs
• Edge version of metric dimension and doubly resolving sets of the necklace graph
• Power graphs and exchange property for resolving sets
• Localization game for random graphs
• Title not available (Why is that?)
• On the metric dimension of a zero-divisor graph
• The \(k\)-metric dimension
• On the metric dimension of the folded \(n\)-cube
• Fault tolerant detectors for distinguishing sets in graphs
• Edge and pair queries-random graphs and complexity
• New resolvability parameters of graphs
• Metric dimension of Andrásfai graphs
• Upper dimension and bases of zero-divisor graphs of commutative rings
• Title not available (Why is that?)
• On the number of resolving pairs in graphs
• Extending the metric dimension to graphs with missing edges
• Metric dimension of fullerene graphs
• On the metric dimension of Cartesian powers of a graph
• On resolvability of a graph associated to a finite vector space
• On metric dimensions of hypercubes
• Symmetry properties of resolving sets and metric bases in hypercubes
• Metric Dimension of Bounded Tree-length Graphs
• Title not available (Why is that?)
• Metric dimension and pattern avoidance in graphs
• The twin non-commuting graph of a group
• Weak total resolvability in graphs
• The 2-dimension of a tree
• deBruijn-like sequences and the irregular chromatic number of paths and cycles
• The metric dimension of circulant graphs and their Cartesian products
• Connected Resolvability of Graphs
• On the \textsc{Distance Identifying Set} meta-problem and applications to the complexity of identifying problems on graphs
• Locating-dominating sets in hypergraphs
• On the metric dimension of Cayley graphs
• On the partition dimension of a class of circulant graphs
• The strong metric dimension of the power graph of a finite group
• Graphs of order \(n\) with determining number \(n-3\)
• The threshold dimension of a graph
• Error-correcting codes from \(k\)-resolving sets
• On the \(k\)-partition dimension of graphs
• On strong metric dimension of zero-divisor graphs of rings
• The \(k\)-size edge metric dimension of graphs
• Edge metric dimension of some graph operations
• Lexicographic metric spaces: Basic properties and the metric dimension
• The Local metric dimension of the lexicographic product of graphs
• Edge metric dimension of some generalized Petersen graphs
• The metric dimension of the enhanced power graph of a finite group
• Fault-tolerant metric dimension problem: a new integer linear programming formulation and exact formula for grid 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
• The comparative analysis of metric and edge metric dimension of some subdivisions of the wheel graph
• On mixed metric dimension in subdivision, middle, and total graphs
• On metric dimensions of symmetric graphs obtained by rooted product
• The metric dimension for resolving several objects
• Fault-tolerant metric dimension of circulant graphs \(C_n(1,2,3)\)
• On the fault-tolerant metric dimension of certain interconnection networks
• Metric properties of generalized Sierpiński graphs over stars
• On the metric representation of the vertices of a graph
• Graphs with doubly resolving number 2
• Computing the metric dimension of convex polytopes generated by wheel related graphs
• Metric dimension of heptagonal circular ladder
• Resolving dominating partitions in graphs
• Metric and strong metric dimension in cozero-divisor graphs
• Mixed metric dimension of graphs with edge disjoint cycles
• Bounds on metric dimensions of graphs with edge disjoint cycles
• Extremal mixed metric dimension with respect to the cyclomatic number
• Graphs with the edge metric dimension smaller than the metric dimension
• Metric dimension of critical Galton-Watson trees and linear preferential attachment trees
• Classification of upper bound sequences of local fractional metric dimension of rotationally symmetric hexagonal planar networks
• The locating number of hexagonal Möbius ladder network
• Metric-locating-dominating sets of graphs for constructing related subsets of vertices
• Metric dimension parameterized by treewidth
• Maker-breaker resolving game
• On the strong metric dimension of annihilator graphs of commutative rings
• On the limiting distribution of the metric dimension for random forests
• Resolving sets and integer programs for recommender systems
• Edge metric dimensions via hierarchical product and integer linear programming
• The connected metric dimension at a vertex of a graph
• Computing edge version of metric and double metric dimensions of kayak paddle graphs
• An IP-based swapping algorithm for the metric dimension and minimal doubly resolving set problems in hypercubes
• Further new results on strong resolving partitions for graphs
• Computation of edge resolvability of benzenoid tripod structure

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)