-
Biosketch
- Ph.D.: National Institute of Technology Karnataka, Suarthkal (2018-2024)
- M.Sc.: Visva-Bharati (2015-2017)
- B.Sc.: Calcutta University (2012-2015)
-
Research
My present research revolves around some specific problems.
- Working to resolve a conjecture concerning the broadcast domination number and multipacking of a graph, which generalizes the classical packing problem in graphs.
- Devising a polynomial-time algorithm for the k-limited broadcast domination problem under the constraint of bounded treewidth.
- Addressing problems related to the dimension of partially ordered sets, that offers exciting intersections with graph theory.
-
Research Group
- Dr. Deepak Rajendraprasad (Faculty)(Mentor)
- Dr. Srimanta Bhattacharya (Faculty)
- Mr. Pawan Kumar (Ph.D. scholar)
- Mr. Varun Sani (B.Tech. student)
-
Additional Information
TitlePublicationDescription
- Critical Aspects in Broadcast Domination (with Srinivasa Rao Kola), Discuss. Math. Graph. T., 2024
DOI: 10.7151/dmgt.2506 - A note on bounds for the broadcast domination number of graphs (with Srinivasa Rao Kola), Discret. Appl. Math., 2024
DOI: 10.1016/j.dam.2024.02.010 - Broadcast domination in line graphs of trees (with Srinivasa Rao Kola), Ars Comb., 2023
DOI: 10.61091/ars157-12 - Broadcast domination of lexicographic and modular products of graphs (with Srinivasa Rao Kola), AKCE Int. J. Graphs Comb., 2022
DOI: 10.1080/09728600.2022.2093145
- Critical Aspects in Broadcast Domination (with Srinivasa Rao Kola), Discuss. Math. Graph. T., 2024
