Metric dimension, minimal doubly resolving sets, and the strong metric dimension for jellyfish graph and cocktail party graph

Abstract: Let

G a m m a

be a simple connected undirected graph with vertex set

V (G a m m a)

and edge set

E (G a m m a)

. The metric dimension of a graph

G a m m a

is the least number of vertices in a set with the property that the list of distances from any vertex to those in the set uniquely identifies that vertex. For an ordered subset

W = w_{1}, w_{2}, ..., w_{k}

of vertices in a graph

G a m m a

and a vertex

v

of

G a m m a

, the metric representation of

v

with respect to

W

is the

k

-vector

r (v | W) = (d (v, w_{1}), d (v, w_{2}), ..., d (v, w_{k}))

. If every pair of distinct vertices of

G a m m a

have different metric representations then the ordered set

W

is called a resolving set of

G a m m a

. It is known that the problem of computing this invariant is NP-hard. In this paper, we consider the problem of determining the cardinality

p s i (G a m m a)

of minimal doubly resolving sets of

G a m m a

, and the strong metric dimension for jellyfish graph

J F G (n, m)

and cocktail party graph

C P (k + 1)

.

Recommendations

Cites work

Cited in

(10)

This page was built for publication: Metric dimension, minimal doubly resolving sets, and the strong metric dimension for jellyfish graph and cocktail party graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2188178)