The equidistant dimension of graphs

DOI10.1007/s40840-022-01295-zzbMath1498.05081arXiv2107.10805OpenAlexW3183301789MaRDI QIDQ2147613

Yanyan Li

Publication date: 20 June 2022

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2107.10805

zbMATH Keywords

resolving setmetric dimensiondoubly resolving setdistance-equalizer setequidistant dimension

Mathematics Subject Classification ID

Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

On (almost) \(2\)-\(Y\)-homogeneous distance-biregular graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sequences of integers avoiding 3-term arithmetic progressions
• Sequences containing no 3-term arithmetic progressions
• Minimal doubly resolving sets and the strong metric dimension of some convex polytopes
• On Roth's theorem on progressions
• Finding large 3-free sets. I. The small \(n\) case
• Computing minimal doubly resolving sets of graphs
• On the diagonal queens domination problem
• Resolvability in graphs and the metric dimension of a graph
• \(k\)-metric antidimension: a privacy measure for social graphs
• An improved construction of progression-free sets
• On the metric dimension of infinite graphs
• On the chromatic number, colorings, and codes of the Johnson graph
• Resolving sets for Johnson and Kneser graphs
• On triples in arithmetic progression
• Metric dimension of maximal outerplanar graphs
• Metric-locating-dominating sets of graphs for constructing related subsets of vertices
• Extremal graph theory for metric dimension and diameter
• Minimal doubly resolving sets of prism graphs
• Approximability of the Minimum Weighted Doubly Resolving Set Problem
• Johnson graphs are Hamilton-connected
• The Automorphism Group of a Johnson Graph
• A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1.
• On the spectra of Johnson graphs
• On the Metric Dimension of Cartesian Products of Graphs
• Integer Sets Containing No Arithmetic Progressions
• Logarithmic bounds for Roth's theorem via almost-periodicity
• On the Connectedness and Diameter of a Geometric Johnson Graph
• On Some Sequences of Integers
• On Certain Sets of Integers
• On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
• The Johnson graphs satisfy a distance extension property
• A new proof of Szemerédi's theorem

This page was built for publication: The equidistant dimension of graphs