B. Deb, K. Kapoor and S. Pati, On mRJ reachability in trees, Discrete Mathematics, Algorithms and Applications, World Scientific, 2012, 4(4),pages 1250055-1250077.SCIE
B. Deb, K. Kapoor, Motion planning in Cartesian product graph, Discussiones Mathematicae Graph Theory, De Gruyter Open, 2014, 2(34), pages 207-221.
B. Deb, K. Kapoor, On Complete S-reachable Graphs, Journal of Discrete Mathematical Sciences and Cryptography Volume 18, 2015 - Issue 6, pages 689–703.
B. Deb, A Characterization of Biconnected Graphs Reachable by Robots Jumping over m Obstacles, Electronic Notes in Discrete Mathematics 63C (2017) pp. 177-187.
B. Deb, K. Kapoor, Motion planning in product graphs.( ICM 2014 )
Anjan Gautam and Biswajit Deb, Strongly k-regular Dominating Graphs, In: Banerjee, S., Saha, A. (eds) Nonlinear Dynamics and Applications. Springer Proceedings in Complexity. Springer, Cham. https://doi.org/10.1007/978-3-030-99792-2_46
Kshittiz Chettri and Biswajit Deb, On Balance and Consistency preserving 2-path Signed Graphs.(communicated)
Shivani Rai, Biswajit Deb and Sourav Mondal, On Vertex-Degree Based and Neighborhood Degree Sum-Based Topological Indices of Some Nanostructures.(communicated)
Shivani Rai, Biswajit Deb and Sourav Mondal, On Multiplicative Y-index of Product Graphs and its Application to Polycyclic Compounds.(communicated)
Shivani Rai, Biswajit Deb and Sourav Mondal, Chemical Significance of Some Neighborhood Degree-based Molecular Descriptors with Mathematical Properties.(communicated)
Shivani Rai, Biswajit Deb , On the First and Second Zagreb Indices of Some Products of Signed Graphs, AKCE International Journal of Graphs and Combinatorics (accepted)
Anjan Gautam, Biswajit Deb and Puran Dangal, ON THE BOUNDS OF THE DOMINATION NUMBER OF THE POWER GRAPH OF A GRAPH.(communicated)
Anjan Gautam, Biswajit Deb and Puran Dangal,On the Bounds of the Packing Number of the Power Graph of a Graph.(communicated)
Yukta Lodha and Biswajit Deb, Isomorphic classes of Alternating Sign Matrices.(communicated)
Puran Dangal, Biswajit Deb and Anjan Gautam, On Graphs Attaining Upper Bound of k-Rainbow Total Domination Number.(communicated)