| Diagnosability of hypercubes and enhanced hypercubes under the comparison diagnosis model D Wang IEEE Transactions on Computers 48 (12), 1369-1374, 1999 | 153 | 1999 |
| Diagnosability of enhanced hypercubes D Wang IEEE Transactions on Computers 43 (9), 1054-1061, 1994 | 119 | 1994 |
| Structure connectivity and substructure connectivity of hypercubes CK Lin, L Zhang, J Fan, D Wang Theoretical Computer Science 634, 97-107, 2016 | 112 | 2016 |
| Embedding Hamiltonian cycles into folded hypercubes with faulty links D Wang Journal of Parallel and Distributed Computing 61 (4), 545-564, 2001 | 108 | 2001 |
| The extra connectivity and conditional diagnosability of alternating group networks L Lin, S Zhou, L Xu, D Wang IEEE Transactions on Parallel and Distributed Systems 26 (8), 2352-2362, 2014 | 92 | 2014 |
| The -Diagnosability of Star Graph Networks S Zhou, L Lin, L Xu, D Wang IEEE Transactions on Computers 64 (2), 547-555, 2013 | 69 | 2013 |
| Relating extra connectivity and extra conditional diagnosability in regular networks L Lin, L Xu, R Chen, SY Hsieh, D Wang IEEE Transactions on Dependable and Secure Computing 16 (6), 1086-1097, 2017 | 65 | 2017 |
| Constructing completely independent spanning trees in crossed cubes B Cheng, D Wang, J Fan Discrete Applied Mathematics 219, 100-109, 2017 | 49 | 2017 |
| The-Good-Neighbor Conditional Diagnosability of Arrangement Graphs L Lin, L Xu, D Wang, S Zhou IEEE Transactions on Dependable and Secure Computing 15 (3), 542-548, 2016 | 49 | 2016 |
| A study of subdividing hexagon-clustered WSN for power saving: Analysis and simulation D Wang, L Lin, L Xu Ad Hoc Networks 9 (7), 1302-1311, 2011 | 49 | 2011 |
| On embedding Hamiltonian cycles in crossed cubes D Wang IEEE Transactions on Parallel and Distributed Systems 19 (3), 334-346, 2008 | 49 | 2008 |
| Embedding paths and cycles in 3-ary n-cubes with faulty nodes and links Q Dong, X Yang, D Wang Information Sciences 180 (1), 198-208, 2010 | 46 | 2010 |
| A rectilinear-monotone polygonal fault block model for fault-tolerant minimal routing in mesh D Wang IEEE Transactions on Computers 52 (3), 310-320, 2003 | 46 | 2003 |
| Structure connectivity and substructure connectivity of bubble-sort star graph networks G Zhang, D Wang Applied Mathematics and Computation 363, 124632, 2019 | 44 | 2019 |
| The reliability of subgraphs in the arrangement graph L Lin, L Xu, S Zhou, D Wang IEEE Transactions on Reliability 64 (2), 807-818, 2015 | 41 | 2015 |
| The Reliability Analysis Based on Subsystems of -Star Graph X Li, S Zhou, X Xu, L Lin, D Wang IEEE Transactions on Reliability 65 (4), 1700-1709, 2016 | 39 | 2016 |
| Fault-tolerant and deadlock-free routing in 2-D meshes using rectilinear-monotone polygonal fault blocks J Wu, D Wang International Journal of Parallel, Emergent and Distributed Systems 20 (2 …, 2005 | 38 | 2005 |
| Conditional diagnosability of arrangement graphs under the PMC model L Lin, S Zhou, L Xu, D Wang Theoretical Computer Science 548, 79-97, 2014 | 34 | 2014 |
| Relating diagnosability, strong diagnosability and conditional diagnosability of strong networks Q Zhu, G Guo, D Wang IEEE Transactions on Computers 63 (7), 1847-1851, 2013 | 34 | 2013 |
| Constructing completely independent spanning trees in data center network based on augmented cube G Chen, B Cheng, D Wang IEEE Transactions on Parallel and Distributed Systems 32 (3), 665-673, 2020 | 30 | 2020 |
