Fault-tolerant metric dimension of P(n, 2)ʘK₁ graph

Publication date 21 February 2022

Abstract: Let

G

be a connected graph and

d (a, b)

be the distance between the vertices

a

and

b

. A subset

U = u_{1}, u_{2}, c d o t s, u_{k}

of the vertices is called a resolving set for

G

if for every two distinct vertices

a, b i n V (G)

, there is a vertex

u_{x} i i n U

such that

d (a, u_{x} i) e q d (b, u_{x} i)

. A resolving set containing a minimum number of vertices is called a metric basis for

G

and the number of vertices in a metric basis is its metric dimension denoted by

d i m (G)

. A resolving set

U

for

G

is fault-tolerant if

U s e t m i n u s u

is also a resolving set, for each

u i n U

, and the fault-tolerant metric dimension of

G

is the minimum cardinality of such a set. In this paper we introduce the study of the fault-tolerant metric dimension of

P (n, 2)

with prism graph.

Recommendations

Cites work

Cited in

(13)

This page was built for publication: Fault-tolerant metric dimension of P(n, 2)ʘK₁ graph

Fault-tolerant metric dimension of P(n, 2)ʘK1 graph