PES University Staff Directory Go to PES.edu

Know their name?

Skip the browsing — jump straight to a name or department with search.

All Staff A–Z Sign In
All Campuses 080‑10‑297297
All Staff A–Z About Our Faculty
Home Leadership About Faculty
Admission Sign In
Home/ Staff A–Z/ Dr. Nagesh H M
Nagesh H M
Teaching

Dr. Nagesh H M

Associate Professor

Science & Humanities RR Campus nageshhm@pes.edu +91 80 2672 1983
1
Research Areas
32
Publications
2
Courses Taught
1
Qualifications
6
Roles Held
1
Achievements

About

Dr. Nagesh H. M is affiliated with the Department of Science and Humanities, PES University, where he is currently working as an Associate Professor of Mathematics. He has authored and co-authored several national and international publications. He is having an active association with the Academy of Discrete Mathematics and its Applications (ADMA). N H M's major research interest involves Graph Theory.

Research Areas

1
Research Guidance
  • Chemical Graph Theory - QSPR Analysis

Publications

32
Journals
  • A note on the edge irregularity strength of Dandelion graph. Southeast Asian Bulletin of Mathematics. 50(4) (2026) 549-554.
  • Topological indices and entropy measures in cove-edged graphene nanoribbons using curve-fitting models. Applied Physics A. 131 (2025). DOI: https://doi.org/10.1007/s00339-024-08081-7.
  • Degree-Based Topological Indices and QSPR Analysis of Cytomegalovirus Drugs. International Journal of Mathematics for Industry. 17(1) (2025) 2450030. DOI: https://doi.org/10.1142/S2661335224500308.
  • Statistical analysis of Revan topological indices for drug compounds used in the treatment of tuberculosis. Physica Scripta. 100 (2025) 035203. DOI: https://doi.org/10.1088/1402-4896/ada120.
  • Degree‐Based Hybrid Topological Indices and Entropies of Wavy Zigzag Nanoribbons. International Journal of Quantum Chemistry. 125(7) (2025) e70028. DOI: https://doi.org/10.1002/qua.70028.
  • Degree-based topological characterization and graph energy prediction of silicon carbide network $Si_{2}C_{3}-[k,l]$ via double graph operator. Scientific Annals of Computer Science (SACS). 1(25) (2025) 53-85. DOI: https://doi.org/10.47743/SACS.2025.1.53.
  • Prediction of Physicochemical Properties of Flavonoids via Modified Reverse Degree Topological Indices. Biointerface Research in Applied Chemistry. 15(5) (2025) 74. DOI: https://doi.org/10.33263/BRIAC155.074.
  • Vertex Energy of Small Integral Graphs. Boletim da Sociedade Paranaense de Matemática. 43 (2025) 1-14.
  • Topological indices, entropy measures, and graph energy prediction of porphyrazine and tetrakis porphyrazine. Results in Engineering. 28 (2025). DOI: 10.1016/j.rineng.2025.107448.
  • On the Distribution of Vertex Energy of Connected Non-Regular Non-Bipartite Integral Graphs with Maximum Vertex Degree Four. Scientific Annals of Computer Science (SAC. 35(2) (2025) 197–210 DOI: https://doi.org/10.47743/SACS.2025.2.197.
  • Zagreb-type topological indices and entropy measures of zinc oxide and silicate networks. Boletim da Sociedade Paranaense de Matemática. 43 (2025) 1-28.
  • Unicyclic Graphs and Their Zagreb Indices: A Subdivision Approach. Boletim da Sociedade Paranaense de Matemática. 44 (2026) 1-7. DOI: https://doi.org/10.5269/bspm.79112.
  • Vertex energy of some integral graphs. International Journal of Mathematics for Industry. 17(1) (2026). DOI: https://doi.org/10.1142/S2661335225500145.
  • On the vertex energy of small integral trees. MATCH Commun. Math. Comput. Chem. 95 (2026) 467–485. DOI: https://doi.org/110.46793/match.95-2.10325.
  • Edge Irregularity Strength of Graphs: Theoretical Results and Applications to Communication Networks. Acta Univ. Sapientiae Inform. 18(20) (2026). DOI: https://doi.org/10.1007/s44427-026-00036-5.
  • Edge irregularity strength of uniform theta graphs, generalized 4-prism graphs, and its applications in communication networks. Discrete Mathematics, Algorithms and Applications (2026) (ISSN: 1793-8317) DOI: https://doi.org/10.1142/S1793830925501423.
  • H. M. Nagesh and R. Chandrasekhar. On directed pathos line digraph of an arborescence. International Journal of Computational and Applied Mathematics.11(1):41-48, 2016.
  • Computational analysis of the face index of certain graph networks using multivariate regression. TWMS J. App. and Eng. Math. 16(8) (2026) 989-1005.
  • H. M. Nagesh. On pathos cube of a tree. Mathematical Forum. Volume 28 (2), pp. 61-72. 2021
  • H. M. Nagesh, Girish V.R and Azghar Pasha. B. On the entire Zagreb indices of the line graph and line cut-vertex graph of the subdivision graph. Bull. Int. Math. Virtual Inst., 12(1), 159-167, 2022.
  • H. M. Nagesh. Directed Pathos Middle Digraph of an Arborescence. TWMS J. of Apl. & Eng. Math. Volume .11, Number.2, pp. 480-489, 2021.
  • H. M. Nagesh, On pathos block line graph of a tree, Gulf J. Math. 6(1) (2018) 104-109.
  • H. M. Nagesh, M. C. Mahesh Kumar, Block digraph of a directed graph, Open Journal of Mathematical Science. 1 (2018) 202-208.
  • H. M. Nagesh, M. C. Mahesh Kumar, On directed pathos total digraph of an arborescence, Eng. Appl. Sci. Letters. 1 (2018) 29-42.
  • H. M. Nagesh, M. C. Mahesh Kumar, On directed pathos block vertex digraph of an arborescence, International Journal of Applied Graph Theory. Vol.3, No.1 (2019), 48 - 60.
  • H. M. Nagesh, Ashwini Kelker, K. Jaysurya, Block graph of a graph, Vladikavkaz Mathematical Journal. 21 (1) (2019) 74-78.
  • H. M. Nagesh, On pathos square graph of a tree, International Journal of Applied Graph Theory. Vol.3, No.2 (2019), 29 - 38.
  • H. M. Nagesh, On pathos block line cut-vertex graph of a tree, Communications of the Korean Mathematical Society. 35 (1) (2020) 1-12.
  • H. M. Nagesh and R. Chandrasekhar. Characterization of pathos adjacency blict graph of a tree. International J.Math.Combin., 1:61-66, 2014.
  • H. M. Nagesh and R. Chandrasekhar. On pathos adjacency cut-vertex jump graph of a tree. International J.Math.Combin., 2:89-95, 2014.
  • H. M. Nagesh, R. Chandrasekhar, and M. C. Mahesh Kumar. Directed pathos block line cut-vertex digraph of an arborescence. International Math.Combin.,4:144-152, 2016
  • H. M. Nagesh and R. Chandrasekhar. On directed pathos line cut-vertex digraph of an arborescence. Notes on Number Theory and Discrete Mathematics., 21(2):59-69, 2015.

Teaching

2
Engineering Mathematics-I, II, III, IV; Discrete Mathematics; MATDIP.

Education

1
  • M.Sc.,M.Phil.,Ph.D.,
    Visveswaraya Technological University (VTU), Belgaum.
    2017

Experience

6
  • Associate Professor
    PES University - Electronic City Campus
    March 01, 2023 – July 22, 2025
  • Associate Professor
    PES University - Ring Road Campus
    2025 – Till date
  • Assistant Professor
    PES University - Electronic City Campus
    2019 – 2022
  • Assistant Professor
    PES School of Engineering
    2011 – 2018
  • Lecturer
    PES School of Engineering
    2008 – 2010
  • Lecturer
    Dayananda Sagar College of Engineering
    2006 – 2007

Achievements

1

Responsibilities

1
  • Test Co-ordinator; Class Co-ordinator; Co-anchor; Anchor

Campus

RR Campus