The cop density of a graph A Bonato, G Hahn, C Wang Contributions to Discrete Mathematics 2 (2), 2007 | 38 | 2007 |

Models of online social networks A Bonato, N Hadi, P Horn, P Prałat, C Wang Internet Mathematics 6 (3), 285-313, 2009 | 36 | 2009 |

The Signed k-Domination Numbers In Graphs. C Wang Ars Comb. 106, 205-211, 2012 | 32 | 2012 |

The signed star domination numbers of the Cartesian product graphs C Wang Discrete Applied Mathematics 155 (11), 1497-1505, 2007 | 29 | 2007 |

Pursuit-evasion in models of complex networks A Bonato, P Prałat, C Wang Internet Mathematics 4 (4), 419-436, 2007 | 22 | 2007 |

The negative decision number in graphs C Wang Australasian Journal of Combinatorics 41, 263, 2008 | 14 | 2008 |

A dynamic model for on-line social networks A Bonato, N Hadi, P Horn, P Prałat, C Wang Algorithms and Models for the Web-Graph, 127-142, 2009 | 12 | 2009 |

Subdigraphs with orthogonal factorizations of digraphs C Wang European Journal of Combinatorics 33 (6), 1015-1021, 2012 | 11 | 2012 |

Vertex pursuit games in stochastic network models A Bonato, P Prałat, C Wang Combinatorial and Algorithmic Aspects of Networking, 46-56, 2007 | 10 | 2007 |

The global connected domination in graphs D Delic, C Wang | 8* | |

Signed b-matchings and b-edge covers of strong product graphs C Wang Contributions to Discrete Mathematics 5 (2), 2010 | 7 | 2010 |

Subgraphs with orthogonal factorizations and algorithms C Wang European Journal of Combinatorics 31 (7), 1706-1713, 2010 | 6 | 2010 |

Upper signed< i> k</i>-domination in a general graph D Delić, C Wang Information Processing Letters 110 (16), 662-665, 2010 | 6 | 2010 |

The independent domination number of random graph C Wang Utilitas Mathematica 82, 161, 2010 | 6 | 2010 |

A note on domination parameters in random graphs. A Bonato, C Wang Discussiones Mathematicae Graph Theory 28 (2), 335-343, 2008 | 6 | 2008 |

The independent domination number of maximal triangle-free graphs C Wang Australas J Combin 42, 129-136, 2008 | 6 | 2008 |

The signed matchings in graphs. C Wang Discussiones Mathematicae Graph Theory 28 (3), 477-486, 2008 | 5 | 2008 |

Growth deletion models for the web graph and other massive networks C Wang CAAN05, Waterloo, 2005 | 5 | 2005 |

Voting'Against'in regular and nearly regular graphs C Wang Applicable Analysis and Discrete Mathematics 4 (1), 207-218, 2010 | 4 | 2010 |

The signed k-submatchings in graphs C Wang Graphs and Combinatorics, 1-11, 2012 | 3 | 2012 |