Uttam Kumar Gupta

@magadhuniversity.ac.in

Assistant Professor of Mathematics
Magadh University Bodh Gaya (Anugrah Memorial College Gaya)

Uttam Kumar Gupta

EDUCATION

PhD in Graph Theory (Mathematics) from IIT (ISM) Dhanbad, India

RESEARCH, TEACHING, or OTHER INTERESTS

Discrete Mathematics and Combinatorics, Theoretical Computer Science
5

Scopus Publications

41

Scholar Citations

3

Scholar h-index

1

Scholar i10-index

Scopus Publications

  • Secure domination in P5-free graphs
    Uttam K. Gupta, Michael A. Henning, Paras Vinubhai Maniya, Dinabandhu Pradhan
    Discrete Mathematics, 2026
    A dominating set of a graph G is a set S ⊆ V ( G ) such that every vertex in V ( G ) ∖ S has a neighbor in S , where two vertices are neighbors if they are adjacent. A secure dominating set of G is a dominating set S of G with the additional property that for every vertex v ∈ V ( G ) ∖ S , there exists a neighbor u of v in S such that ( S ∖ { u } ) ∪ { v } is a dominating set of G . The secure domination number of G , denoted by γ s ( G ) , is the minimum cardinality of a secure dominating set of G . We prove that if G is a P 5 -free graph, then γ s ( G ) ≤ 3 2 α ( G ) , where α ( G ) denotes the independence number of G . We further show that if G is a connected ( P 5 , H ) -free graph for some H ∈ { P 3 ∪ P 1 , K 2 ∪ 2 K 1 , paw , C 4 } , then γ s ( G ) ≤ max ⁡ { 3 , α ( G ) } . We also show that if G is a ( P 3 ∪ P 2 ) -free graph, then γ s ( G ) ≤ α ( G ) + 1 .
  • List recoloring of planar graphs
    L. Sunil Chandran, Uttam K. Gupta, Dinabandhu Pradhan
    Discrete Applied Mathematics, 2025
  • Strengthening Brooks’ chromatic bound on P6-free graphs
    Uttam K. Gupta, Dinabandhu Pradhan
    Discrete Applied Mathematics, 2024
  • Cops and robber on subclasses of P5-free graphs
    Uttam K. Gupta, Suchismita Mishra, Dinabandhu Pradhan
    Discrete Mathematics, 2023
  • Borodin–Kostochka’s conjecture on (P5, C4) -free graphs
    Uttam K. Gupta, D. Pradhan
    Journal of Applied Mathematics and Computing, 2021

RECENT SCHOLAR PUBLICATIONS

  • Secure domination in P5-free graphs
    UK Gupta, MA Henning, PV Maniya, D Pradhan
    Discrete Mathematics 349 (4), 114905 , 2026
    2026
    Citations: 1
  • Aging-aware module composition in a lithium-ion battery pack
    U Gupta, S Khange, V Kumar, AK Sharma
    2025 IEEE 5th International Conference on Sustainable Energy and Future … , 2025
    2025
  • List recoloring of planar graphs
    LS Chandran, UK Gupta, D Pradhan
    Discrete Applied Mathematics 363, 71-87 , 2025
    2025
    Citations: 3
  • Strengthening Brooks’ chromatic bound on P6-free graphs
    UK Gupta, D Pradhan
    Discrete Applied Mathematics 342, 334-346 , 2024
    2024
    Citations: 6
  • Cops and robber on subclasses of P5-free graphs
    UK Gupta, S Mishra, D Pradhan
    Discrete Mathematics 346 (6), 113353 , 2023
    2023
    Citations: 4
  • Borodin–Kostochka’s conjecture on -free graphs
    UK Gupta, D Pradhan
    Journal of Applied Mathematics and Computing 65 (1), 877-884 , 2021
    2021
    Citations: 27

MOST CITED SCHOLAR PUBLICATIONS

  • Borodin–Kostochka’s conjecture on -free graphs
    UK Gupta, D Pradhan
    Journal of Applied Mathematics and Computing 65 (1), 877-884 , 2021
    2021
    Citations: 27
  • Strengthening Brooks’ chromatic bound on P6-free graphs
    UK Gupta, D Pradhan
    Discrete Applied Mathematics 342, 334-346 , 2024
    2024
    Citations: 6
  • Cops and robber on subclasses of P5-free graphs
    UK Gupta, S Mishra, D Pradhan
    Discrete Mathematics 346 (6), 113353 , 2023
    2023
    Citations: 4
  • List recoloring of planar graphs
    LS Chandran, UK Gupta, D Pradhan
    Discrete Applied Mathematics 363, 71-87 , 2025
    2025
    Citations: 3
  • Secure domination in P5-free graphs
    UK Gupta, MA Henning, PV Maniya, D Pradhan
    Discrete Mathematics 349 (4), 114905 , 2026
    2026
    Citations: 1
  • Aging-aware module composition in a lithium-ion battery pack
    U Gupta, S Khange, V Kumar, AK Sharma
    2025 IEEE 5th International Conference on Sustainable Energy and Future … , 2025
    2025