Area of research
Computer Networks and Communications · Computational Theory and Mathematics
Research interest
Research focused on Combinatorics and Hypercube, with related work in Component (thermodynamics), Vertex (graph theory), Enhanced Data Rates for GSM Evolution. Notable publications include 'Reliability analysis of bijective connection networks in terms of the extra edge-connectivity', 'The Component Diagnosability of Hypercubes with Large-Scale Faulty Nodes', and 'Equal relation between g -good-neighbor diagnosability under the PMC model and g -good-neighbor diagnosability under the MM<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"...'.
Link fault tolerability of the Cartesian product power graph $$(K_{9}-C_{9})^{n}$$: conditional edge-connectivities under six link fault patterns
Edge isoperimetric method: At least <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e606" altimg="si31.svg"> <mml:mrow> <mml:mn>2</mml:mn> <mml:mo>/</mml:mo> <mml:mn>3</mml:mn> </mml:mrow> </mml:math> of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e616" altimg="si32.svg"> <mml:mi>h</mml:mi> </mml:math> -extra edge-connectivity of a kind of cube-based graphs concentrates on <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"
Reliability analysis of the augmented cubes in terms of the h-extra r-component edge-connectivity
The super-connectivity of graphs with two orbits
On modified l-embedded edge-connectivity of enhanced hypercubes
A survey on book-embedding of planar graphs
Conditional fractional matching preclusion of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e60" altimg="si3.svg"><mml:mi>n</mml:mi></mml:math>-dimensional torus networks
The Component Diagnosability of Hypercubes with Large-Scale Faulty Nodes
Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs
Equal relation between <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll" id="d1e61" altimg="si18.gif"><mml:mi>g</mml:mi></mml:math>-good-neighbor diagnosability under the PMC model and <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll" id="d1e66" altimg="si18.gif"><mml:mi>g</mml:mi></mml:math>-good-neighbor diagnosability under the MM<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflo
Making a dominating set of a graph connected
On the extra edge-connectivity of hypercubes
Reliability analysis of bijective connection networks in terms of the extra edge-connectivity
The minimum restricted edge-connected graph and the minimum size of graphs with a given edge–degree
Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees
Super restricted edge connectivity of regular graphs with two orbits
Collapsible graphs and Hamiltonian connectedness of line graphs
Hamiltonicity of 3-connected line graphs