Link Dimension and Exact Construction of a Graph

06/13/2019
by   Gunjan S. Mahindre, et al.
0

Minimum resolution set and associated metric dimension provide the basis for unique and systematic labeling of nodes of a graph using distances to a set of landmarks. Such a distance vector set, however, may not be unique to the graph and does not allow for its exact construction. The concept of construction set is presented, which facilitates the unique representation of nodes and the graph as well as its exact construction. Link dimension is the minimum number of landmarks in a construction set. Results presented include necessary conditions for a set of landmarks to be a construction set, bounds for link dimension, and guidelines for transforming a resolution set to a construction set.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/11/2023

Congruence distance magic graphs

In this paper, we introduce a series of necessary conditions namely the ...
research
12/07/2017

On the metric dimension of Cartesian powers of a graph

A set of vertices S resolves a graph if every vertex is uniquely determi...
research
02/25/2020

The Threshold Dimension and Irreducible Graphs

Let G be a graph, and let u, v, and w be vertices of G. If the distance ...
research
02/28/2019

Construction Methods for Gaussoids

The number of n-gaussoids is shown to be a double exponential function i...
research
03/19/2018

Exact Distance Oracles Using Hopsets

For fixed h ≥ 2, we consider the task of adding to a graph G a set of we...
research
11/11/2022

A Universal Construction for Unique Sink Orientations

Unique Sink Orientations (USOs) of cubes can be used to capture the comb...
research
03/14/2021

Computing the Multicover Bifiltration

Given a finite set A⊂ℝ^d, let Cov_r,k denote the set of all points withi...

Please sign up or login with your details

Forgot password? Click here to reset