Extremal results for graphs of bounded metric dimension

08/31/2020
by   Jesse Geneson, et al.
0

Metric dimension is a graph parameter motivated by problems in robot navigation, drug design, and image processing. In this paper, we answer several open extremal problems on metric dimension and pattern avoidance in graphs from (Geneson, Metric dimension and pattern avoidance, Discrete Appl. Math. 284, 2020, 1-7). Specifically, we construct a new family of graphs that allows us to determine the maximum possible degree of a graph of metric dimension at most k, the maximum possible degeneracy of a graph of metric dimension at most k, the maximum possible chromatic number of a graph of metric dimension at most k, and the maximum n for which there exists a graph of metric dimension at most k that contains K_n, n. We also investigate a variant of metric dimension called edge metric dimension and solve another problem from the same paper for n sufficiently large by showing that the edge metric dimension of P_n^d is d for n ≥ d^d-1. In addition, we use a probabilistic argument to make progress on another open problem from the same paper by showing that the maximum possible clique number of a graph of edge metric dimension at most k is 2^Θ(k). We also make progress on a problem from (N. Zubrilina, On the edge dimension of a graph, Discrete Math. 341, 2018, 2083-2088) by finding a family of new triples (x, y, n) for which there exists a graph of metric dimension x, edge metric dimension y, and order n. In particular, we show that for each integer k > 0, there exist graphs G with metric dimension k, edge metric dimension 3^k(1-o(1)), and order 3^k(1+o(1)).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/22/2018

Metric dimension and pattern avoidance in graphs

In this paper, we prove a number of results about pattern avoidance in g...
research
04/05/2019

Unavoidable minors for graphs with large ℓ_p-dimension

A metric graph is a pair (G,d), where G is a graph and d:E(G) →R_≥0 is a...
research
08/23/2023

Assouad-Nagata dimension of minor-closed metrics

Assouad-Nagata dimension addresses both large and small scale behaviors ...
research
10/09/2019

Metric Dimension

In this manuscript, we provide a concise review of the concept of metric...
research
03/13/2023

Complexity and equivalency of multiset dimension and ID-colorings

This investigation is firstly focused into showing that two metric param...
research
09/05/2017

MLSEB: Edge Bundling using Moving Least Squares Approximation

Edge bundling methods can effectively alleviate visual clutter and revea...
research
02/20/2020

The (Generalized) Orthogonality Dimension of (Generalized) Kneser Graphs: Bounds and Applications

The orthogonality dimension of a graph G=(V,E) over a field 𝔽 is the sma...

Please sign up or login with your details

Forgot password? Click here to reset