RESEARCHER PROFILE

Dajin Wang

← Back to Montclair State University

D

Montclair State University

Interconnection Networks and SystemsEnergy Efficient Wireless Sensor NetworksAdvanced Graph Theory ResearchComplexity and Algorithms in GraphsVLSI and Analog Circuit Testing

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.

  1. Structure connectivity and substructure connectivity of hypercubes

    2016 · 146 citations
  2. The Extra Connectivity and Conditional Diagnosability of Alternating Group Networks

    2014 · 100 citations
  3. Relating Extra Connectivity and Extra Conditional Diagnosability in Regular Networks

    2017 · 100 citations
  4. Diagnosability of enhanced hypercubes

    1994 · 97 citations
  5. Embedding Hamiltonian Cycles into Folded Hypercubes with Faulty Links

    2001 · 84 citations
  6. The $t/k$-Diagnosability of Star Graph Networks

    2014 · 74 citations
  7. Identification of an lncRNA-miRNA-mRNA interaction mechanism in breast cancer based on bioinformatic analysis

    2017 · 64 citations
  8. The -Good-Neighbor Conditional Diagnosability of Arrangement Graphs

    2016 · 58 citations
  9. Constructing completely independent spanning trees in crossed cubes

    2016 · 57 citations
  10. The Reliability Analysis Based on Subsystems of $(n,k)$ -Star Graph

    2016 · 54 citations
  11. Structure connectivity and substructure connectivity of bubble-sort star graph networks

    2019 · 52 citations
  12. The Reliability of Subgraphs in the Arrangement Graph

    2015 · 48 citations
  13. A study of subdividing hexagon-clustered WSN for power saving: Analysis and simulation

    2011 · 47 citations
  14. Constructing Completely Independent Spanning Trees in Data Center Network Based on Augmented Cube

    2020 · 44 citations
  15. Component diagnosability in terms of component connectivity of hypercube-based compound networks

    2022 · 44 citations
  16. Embedding paths and cycles in 3-ary n-cubes with faulty nodes and links

    2009 · 43 citations
  17. On Embedding Hamiltonian Cycles in Crossed Cubes

    2008 · 41 citations
  18. A rectilinear-monotone polygonal fault block model for fault-tolerant minimal routing in mesh

    2003 · 38 citations
  19. Conditional diagnosability of arrangement graphs under the PMC model

    2014 · 37 citations
  20. Relating Diagnosability, Strong Diagnosability and Conditional Diagnosability of Strong Networks

    2013 · 37 citations
  21. Independent Spanning Trees in Networks: A Survey

    2023 · 34 citations
  22. Hamiltonian Embedding in Crossed Cubes with Failed Links

    2012 · 30 citations
  23. A Novel Measurement for Network Reliability

    2020 · 29 citations
  24. Fault diagnosability of Bicube networks under the PMC diagnostic model

    2020 · 29 citations
  25. A propagation model with defensive measures for PLC-PC worms in industrial networks

    2019 · 28 citations

← Return to the university profile