Area of research
Computer Networks and Communications · Electrical and Electronic Engineering
Research interest
Research interests include Mathematics, Combinatorics, Enhanced Data Rates for GSM Evolution, Computer science, Connected component, and Cube (algebra).
Link fault tolerance of the Cartesian product power graph <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e497" altimg="si237.svg"> <mml:msup> <mml:mrow> <mml:mrow> <mml:mo>(</mml:mo> <mml:msub> <mml:mrow> <mml:mi>K</mml:mi> </mml:mrow> <mml:mrow> <mml:mn>9</mml:mn> </mml:mrow> </mml:msub> <mml:mo>−</mml:mo> <mml:msub> <mml:mrow> <mml:mi>C</mml:mi> </mml:mrow> <mml:mrow> <mml:mn>9</mml:mn> </mml:mrow> </mml:msub> <mml:mo>)</mml:mo> </mml:mrow> </mml:mrow> <mml:mro
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 for link fault tolerance of the complete Josephus cube under five models: A unified approach
Fault tolerance assessment for hamming graphs based on r-restricted R-structure(substructure) fault pattern
Assessing reliability in Complete Josephus Cube networks via strongly Menger edge-connectivity
Link fault tolerance of BC networks and folded hypercubes on h-extra r-component edge-connectivity
The generalized measure of edge fault tolerance in exchanged 3-ary<i>n</i>-cube
Fault tolerance analysis for hamming graphs with large-scale faulty links based on k-component edge-connectivity
The <i>a</i>-average Degree Edge-Connectivity of Bijective Connection Networks