Area of research
Computational Theory and Mathematics · Computer Networks and Communications
Research interest
Research interests include Combinatorics, Mathematics, Graph, Conjecture, Disjoint sets, and Dominating set.
The <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e93" altimg="si44.svg"><mml:msub><mml:mrow><mml:mi>κ</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:math>-connectivity of line graphs
Steiner tree packing number and tree connectivity
Making a dominating set of a graph connected
2-Edge connected dominating sets and 2-Connected dominating sets of a graph
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