You Lu

most citedThe 2-Domination and 2-Bondage Numbers of Grid Graphs

5 citations · 6 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2012

The p-Domination Number of Complete Multipartite Graphs

You Lu, Jun-Ming Xu

Let $G = (V, E)$ be a graph and $p$ a positive integer. A subset $S \subseteq V$ is called a $p$ -dominating set of $G$ if every vertex not in $S$ has at least $p$ neighbors in $S$ . The…

math.CO2012★ 5 cited

The 2-Domination and 2-Bondage Numbers of Grid Graphs

You Lu, Jun-Ming Xu

Let $p$ be a positive integer and $G = (V, E)$ be a simple graph. A subset $D \subseteq V$ is a $p$ -dominating set if each vertex not in $D$ has at least $p$ neighbors in $D$ . The $p$ -…

math.CO2012★ 1 cited

On the p-reinforcement and the complexity

You Lu, Fu-Tao Hu, Jun-Ming Xu

Let $G = (V, E)$ be a graph and $p$ be a positive integer. A subset $S \subseteq V$ is called a $p$ -dominating set if each vertex not in $S$ has at least $p$ neighbors in $S$ . The $p$ -…