On the partition dimension of unicyclic graphs

Abstract: Given an ordered partition

P i = P_{1}, P_{2}, ..., P_{t}

of the vertex set

V

of a connected graph

G = (V, E)

, the emph{partition representation} of a vertex

v i n V

with respect to the partition

P i

is the vector

r (v | P i) = (d (v, P_{1}), d (v, P_{2}), ..., d (v, P_{t}))

, where

d (v, P_{i})

represents the distance between the vertex

v

and the set

P_{i}

. A partition

P i

of

V

is a emph{resolving partition} if different vertices of

G

have different partition representations, i.e., for every pair of vertices

u, v i n V

,

r (u | P i) e r (v | P i)

. The emph{partition dimension} of

G

is the minimum number of sets in any resolving partition for

G

. In this paper we obtain several tight bounds on the partition dimension of unicyclic graphs.

Recommendations

Cited in

(8)

This page was built for publication: On the partition dimension of unicyclic graphs