bounds of point-set domination number

A subset $d$ of the vertex set $v(g)$ in a graph $g$ is a point-set dominating set (or, in short, psd-set) of $g$ if for every set $ssubseteq v- d$, there exists a vertex $vin d$ such that the induced subgraph $langle scup {v}rangle$ is connected.  the minimum cardinality of a psd-set of $g$ is called the point-set domination number of $g$. in this paper, we establish two sharp lower bounds for point-set domination number of a graph in terms of its diameter and girth. we characterize graphs for which lower bound of point set domination number is attained in terms of its diameter. we also establish an upper bound and give some classes of graphs which attains the upper bound of point set domination number.