The following pages link to Da-Jin Wang (Q1701743):
Displaying 28 items.
- (Q239052) (redirect page) (← links)
- Structure connectivity and substructure connectivity of hypercubes (Q284586) (← links)
- Conditional diagnosability of arrangement graphs under the PMC model (Q401482) (← links)
- Constructing completely independent spanning trees in crossed cubes (Q505430) (← links)
- Embedding multi-dimensional meshes into twisted cubes (Q612755) (← links)
- Embedding paths and cycles in 3-ary \(n\)-cubes with faulty nodes and links (Q845346) (← links)
- Uncertain random spectra: a new metric for assessing the survivability of mobile wireless sensor networks (Q1701744) (← links)
- On the reliability of alternating group graph-based networks (Q1749479) (← links)
- Embedding Hamiltonian cycles into folded hypercubes with faulty links (Q1862467) (← links)
- Fault diagnosability of bicube networks under the PMC diagnostic model (Q2220807) (← links)
- The structure fault tolerance of arrangement graphs (Q2242673) (← links)
- Structure connectivity and substructure connectivity of bubble-sort star graph networks (Q2286154) (← links)
- Probabilistic diagnosis of clustered faults for hypercube-based multiprocessor system (Q2326404) (← links)
- A new approach to finding the extra connectivity of graphs (Q2656973) (← links)
- The $t/k$-Diagnosability of Star Graph Networks (Q2982406) (← links)
- ON HIERARCHICAL CONFIGURATION OF DISTRIBUTED SYSTEMS ON MESH AND HYPERCUBE (Q3022017) (← links)
- A Novel Measurement for Network Reliability (Q3390010) (← links)
- Fault-tolerance schemes for clusterheads in clustered mesh networks (Q3499025) (← links)
- Diagnosability of enhanced hypercubes (Q4419760) (← links)
- (Q4489166) (← links)
- Diagnosability of hypercubes and enhanced hypercubes under the comparison diagnosis model (Q4571438) (← links)
- Constructing optimal subnetworks for the crossed cube network (Q4648694) (← links)
- The Diagnosability of (K4 – {e})-free Graphs under the PMC Diagnosis Model (Q4988922) (← links)
- Shapley Distance and Shapley Index for Some Special Graphs (Q5087076) (← links)
- Constructing Completely Independent Spanning Trees in a Family of Line-Graph-Based Data Center Networks (Q5095079) (← links)
- Relating Diagnosability, Strong Diagnosability and Conditional Diagnosability of Strong Networks (Q5268154) (← links)
- Fault-tolerant and deadlock-free routing in 2-D meshes using rectilinear-monotone polygonal fault blocks (Q5460651) (← links)
- A low-cost fault-tolerant structure for the hypercube (Q5959811) (← links)