On the partition dimension of unicyclic graphs

Details On the partition dimension of unicyclic graphs On the partition dimension of unicyclic graphs

2011-11-15

arxiv.org/abs/1111.3513v1

Mathematics

Combinatorics

Scientific paper

Given an ordered partition $\Pi =\{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\in V$ with respect to the partition $\Pi$ is the vector $r(v|\Pi)=(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 $\Pi$ 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\in V$, $r(u|\Pi)\ne r(v|\Pi)$. 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.

Affiliated with

Also associated with

No associations

Rating

On the partition dimension of unicyclic graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the partition dimension of unicyclic graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the partition dimension of unicyclic graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-709237