Micheal Arockiaraj

Papers

1

Total Citations

17

H-Index

1

About

Micheal Arockiaraj is a mathematician whose research focuses on graph theory, particularly the structural analysis of complex networks through metric dimensions and topological indices. His work on the partition dimension of series-parallel graphs, detailed in his most-cited 2019 paper (17 citations), provides foundational insights into how these graphs can be uniquely identified by their distance partitions—a problem with applications in network design and chemical graph theory. Arockiaraj’s contributions extend to computing distance-based and degree-based topological descriptors for molecular graphs, aiding in the prediction of physicochemical properties of chemical compounds. His research often bridges pure graph theory with applied problems in chemistry and computer science, demonstrating the utility of mathematical abstraction in real-world contexts. With a growing citation record, Arockiaraj’s work is increasingly recognized for its clarity and relevance, particularly in the study of series-parallel and related graph classes. His achievements include advancing the understanding of graph parameters that underpin efficient network analysis and molecular modeling, making him a notable figure in contemporary discrete mathematics.

Research Focus

Key Achievements

1
H-Index
1
Papers
17
Total Citations
17
Avg Citations/Paper
🏆 Most Cited Paper
Partition dimension of certain classes of series parallel graphs
17 citations · 2019
📈 Most Prolific Year: 2019 (1 Papers)
🤝 Key Collaborators: 3

Top Papers

  1. 1

Key Collaborators

Contact & Links

Available for collaboration
Content generated · 13 days ago