RESEARCHER PROFILE
Dajin Wang
← Back to Montclair State University
D
Montclair State University
Dajin Wang works in Interconnection Networks and Systems, Energy Efficient Wireless Sensor Networks, Advanced Graph Theory Research, Complexity and Algorithms in Graphs, VLSI and Analog Circuit Testing. Recorded institutional associations include Montclair State University.
139Publications
1,933Citations
25H-index
Inclusion identifies researchers whose recorded research contributions may inform their university’s understanding of its research community. It does not rank individual research quality or establish current employment.
Selected research works
Up to 100 highly cited works; DOI links open the original research. Counts reflect the collected record, not real-time citation totals.
Structure connectivity and substructure connectivity of hypercubes
2016 · 146 citationsThe Extra Connectivity and Conditional Diagnosability of Alternating Group Networks
2014 · 100 citationsRelating Extra Connectivity and Extra Conditional Diagnosability in Regular Networks
2017 · 100 citationsDiagnosability of enhanced hypercubes
1994 · 97 citationsEmbedding Hamiltonian Cycles into Folded Hypercubes with Faulty Links
2001 · 84 citationsThe $t/k$-Diagnosability of Star Graph Networks
2014 · 74 citationsIdentification of an lncRNA-miRNA-mRNA interaction mechanism in breast cancer based on bioinformatic analysis
2017 · 64 citationsThe -Good-Neighbor Conditional Diagnosability of Arrangement Graphs
2016 · 58 citationsConstructing completely independent spanning trees in crossed cubes
2016 · 57 citationsThe Reliability Analysis Based on Subsystems of $(n,k)$ -Star Graph
2016 · 54 citationsStructure connectivity and substructure connectivity of bubble-sort star graph networks
2019 · 52 citationsThe Reliability of Subgraphs in the Arrangement Graph
2015 · 48 citationsA study of subdividing hexagon-clustered WSN for power saving: Analysis and simulation
2011 · 47 citationsConstructing Completely Independent Spanning Trees in Data Center Network Based on Augmented Cube
2020 · 44 citationsComponent diagnosability in terms of component connectivity of hypercube-based compound networks
2022 · 44 citationsEmbedding paths and cycles in 3-ary n-cubes with faulty nodes and links
2009 · 43 citationsOn Embedding Hamiltonian Cycles in Crossed Cubes
2008 · 41 citationsA rectilinear-monotone polygonal fault block model for fault-tolerant minimal routing in mesh
2003 · 38 citationsConditional diagnosability of arrangement graphs under the PMC model
2014 · 37 citationsRelating Diagnosability, Strong Diagnosability and Conditional Diagnosability of Strong Networks
2013 · 37 citationsIndependent Spanning Trees in Networks: A Survey
2023 · 34 citationsHamiltonian Embedding in Crossed Cubes with Failed Links
2012 · 30 citationsA Novel Measurement for Network Reliability
2020 · 29 citationsFault diagnosability of Bicube networks under the PMC diagnostic model
2020 · 29 citationsA propagation model with defensive measures for PLC-PC worms in industrial networks
2019 · 28 citations
