Integer flows and cycle covers of graphs CQ Zhang CRC Press, 1997 | 440 | 1997 |

Laplacian centrality: A new centrality measure for weighted networks X Qi, E Fuller, Q Wu, Y Wu, CQ Zhang Information Sciences 194, 240-253, 2012 | 197 | 2012 |

Nowhere-zero 3-flows and modulo k-orientations LM Lovász, C Thomassen, Y Wu, CQ Zhang Journal of Combinatorial Theory, Series B 103 (5), 587-598, 2013 | 179 | 2013 |

Emergence of segregation in evolving social networks AD Henry, P Prałat, CQ Zhang Proceedings of the National Academy of Sciences 108 (21), 8605-8610, 2011 | 162 | 2011 |

On (*k*, *d*)‐colorings and fractional nowhere‐zero flowsLA Goddyn, M Tarsi, CQ Zhang Journal of Graph Theory 28 (3), 155-161, 1998 | 139 | 1998 |

Graphs with the circuit cover property B Alspach, L Goddyn, CQ Zhang Transactions of the American Mathematical Society 344 (1), 131-154, 1994 | 111 | 1994 |

HAMILTON CYCLES IN CUBIC CAYLEY-GRAPHS ON DIHEDRAL GROUPS B Alspach, CQ Zhang Ars Combinatoria 28, 101-108, 1989 | 89 | 1989 |

Finding critical independent sets and critical vertex subsets are polynomial problems CQ Zhang SIAM Journal on Discrete Mathematics 3 (3), 431-438, 1990 | 80 | 1990 |

A novel model for DNA sequence similarity analysis based on graph theory X Qi, Q Wu, Y Zhang, E Fuller, CQ Zhang Evolutionary Bioinformatics 7, EBO. S7364, 2011 | 73 | 2011 |

Hamilton cycles in claw‐free graphs CQ Zhang Journal of graph theory 12 (2), 209-216, 1988 | 69 | 1988 |

Circular flows of nearly Eulerian graphs and vertex‐splitting CQ Zhang Journal of Graph Theory 40 (3), 147-161, 2002 | 68 | 2002 |

Optimal local community detection in social networks based on density drop of subgraphs X Qi, W Tang, Y Wu, G Guo, E Fuller, CQ Zhang Pattern Recognition Letters 36, 46-53, 2014 | 66 | 2014 |

Circuit double cover of graphs CQ Zhang Cambridge University Press, 2012 | 63 | 2012 |

A new clustering method and its application in social networks P Zhao, CQ Zhang Pattern Recognition Letters 32 (15), 2109-2118, 2011 | 59 | 2011 |

The 3-flow conjecture, factors modulo k, and the 1-2-3-conjecture C Thomassen, Y Wu, CQ Zhang Journal of Combinatorial Theory, Series B 121, 308-325, 2016 | 58 | 2016 |

Method for data clustering and classification by a graph theory model—network partition into high density subgraphs CQ Zhang, Y Ou US Patent 7,523,117, 2009 | 52 | 2009 |

Nowhere-zero 3-flows in triangularly connected graphs G Fan, H Lai, R Xu, CQ Zhang, C Zhou Journal of Combinatorial Theory, Series B 98 (6), 1325-1336, 2008 | 52 | 2008 |

Terrorist networks, network energy and node removal: A new measure of centrality based on Laplacian energy X Qi, RD Duval, K Christensen, E Fuller, A Spahiu, Q Wu, Y Wu, W Tang, ... Social Networking 2 (01), 19, 2013 | 51 | 2013 |

Predicting glioblastoma prognosis networks using weighted gene co-expression network analysis on TCGA data Y Xiang, CQ Zhang, K Huang BMC bioinformatics 13, 1-8, 2012 | 47 | 2012 |

On flows in bidirected graphs R Xu, CQ Zhang Discrete mathematics 299 (1-3), 335-343, 2005 | 47 | 2005 |