Changhong Lü

collaborators

2 papers

math.CO2009

Vertices in all minimum paired-dominating sets of block graphs

Lei Chen, Changhong Lu, Zhenbing Zeng

Let $G = (V, E)$ be a simple graph without isolated vertices. A set $S \subseteq V$ is a paired-dominating set if every vertex in $V - S$ has at least one neighbor in $S$ and the subgrap…

math.CO2009

Identifying codes and locating-dominating sets on paths and cycles

Chunxia Chen, Changhong Lu, Zhengke Miao

Let $G = (V, E)$ be a graph and let $r \geq 1$ be an integer. For a set $D \subseteq V$ , define $N_{r} [x] = {y \in V : d (x, y) \leq r}$ and $D_{r} (x) = N_{r} [x] \cap D$ , where $d (x, y)$ denot…