Resolving dominating partitions in graphs

Abstract: A partition

P i = S_{1}, l d o t s, S_{k}

of the vertex set of a connected graph

G

is called a emph{resolving partition} of

G

if for every pair of vertices

u

and

v

,

d (u, S_{j}) e q d (v, S_{j})

, for some part

S_{j}

. The emph{partition dimension}

is the minimum cardinality of a resolving partition of

G

. A resolving partition

P i

is called emph{resolving dominating} if for every vertex

v

of

G

,

d (v, S_{j}) = 1

, for some part

S_{j}

of

P i

. The emph{dominating partition dimension}

e t a_{p} (G)

is the minimum cardinality of a resolving dominating partition of

G

. In this paper we show, among other results, that

. We also characterize all connected graphs of order

n g e 7

satisfying any of the following conditions:

e t a_{p} (G) = n

,

e t a_{p} (G) = n - 1

,

e t a_{p} (G) = n - 2

and

. Finally, we present some tight Nordhaus-Gaddum bounds for both the partition dimension

and the dominating partition dimension

e t a_{p} (G)

.

Recommendations

Cites work

Cited in

(6)

This page was built for publication: Resolving dominating partitions in graphs