Hongyu Liang

activity

20102014

k

-Connectivity of Random Graphs

6 citations · 22 across the 7 of their papers we have counts for

collaborators

Showing cs.DMShow all

2 papers · 1 filter

cs.DM2012★ 2 cited

Signed and Minus Domination in Complete Multipartite Graphs

Hongyu Liang

In this paper we determine the exact values of the signed domination number, signed total domination number, and minus domination number of complete multipartite graphs, which subs…

cs.DM2012★ 5 cited

On the Signed (Total) $k$ -Domination Number of a Graph

Hongyu Liang

Let $k$ be a positive integer and $G = (V, E)$ be a graph of minimum degree at least $k - 1$ . A function $f : V \to {- 1, 1}$ is called a \emph{signed $k$ -dominating function} of $…

Signed and Minus Domination in Complete Multipartite Graphs

On the Signed (Total) k-Domination Number of a Graph

On the Signed (Total) $k$ -Domination Number of a Graph