Assistant Professor at Kohima Science College, Jotsoma India.
Dr. Aronthung S. Odyuo is a mathematician and Assistant Professor at Kohima Science College, Jotsoma. He holds a Ph.D. in Graph Theory with a focus on Fibonacci-based graph labeling and the golden ratio. Dr. Odyuo has contributed to several international journals and conferences, presenting cutting-edge work in discrete and algebraic graph theory. He has also authored book chapters in advanced algebra and computational mathematics. A dedicated academic, he combines theoretical insights with practical mathematical modeling for network analysis and cryptographic systems.
Profile
Scopus
Orcid
Google Scholar
🎓 Education
Dr. Aronthung S. Odyuo earned his Bachelor of Science degree in Mathematics, Physics, and Statistics from Kohima Science College, Jotsoma (affiliated with Nagaland University). He went on to complete both his Master of Science and Doctor of Philosophy (Ph.D.) in Mathematics at St. Joseph University, Ikishe Model Village, Dimapur, Nagaland. His Ph.D. research focused on Graph Theory, with a dissertation titled “Fibonacci Range Labeling With Special Emphasis to Golden Ratio (φ = 1.618).”
💼 Experience
Dr. Odyuo began his academic career as a Guest Faculty at the Indian Institute of Information Technology (IIIT), Manipur from September 2023 to January 2024. He then served as an Assistant Professor (Contractual) at the same institution from February 2024 to July 2024. Since August 2024, he has held a regular faculty position as an Assistant Professor of Mathematics at Kohima Science College, Jotsoma.
🔬 Research Focus
Dr. Odyuo’s primary research interests lie in Graph Theory, Discrete Mathematics, Combinatorics, Algebraic Graph Theory, Number Theory, and Cryptography. His specialization includes innovative applications of the Fibonacci sequence and the golden ratio (φ = 1.618) to graph labeling, structure decomposition, and mean labeling in complex networks.
Author Metrics
-
Total Research Articles: 6 peer-reviewed journal papers
-
Book Chapters: 2 (Walter De Gruyter, 2024)
-
Conference Presentations: 4 international, 1 national
-
Accepted Publications: 1 (2024, Journal of Discrete Mathematical Sciences and Cryptography)
-
Publishing Journals: Springer Nature, Bulletin of Calcutta Mathematical Society, TWMS Journal of Applied and Engineering Mathematics
-
Professional Memberships: Life Member (Communicated) – Calcutta Mathematical Society & Ramanujan Mathematical Society
Publication
-
Odyuo, A. S., Mercy, P., & Patel, M. K. (2022). On Fibonacci range labeling based on vertex switching of a graph. Bulletin of Calcutta Mathematical Society, 114(6), 829–840.
Citations: 3
-
Odyuo, A. S., & Mercy, P. (2023). On Fibonacci range labeling for standard shell graphs. Journal of Advances in Mathematics and Computer Science, 38(6), 67–75.
Citations: 1
-
Odyuo, A. S., Mercy, P., & Patel, M. K. (2024). Fibonacci range labeling on direct product of path and cycles graphs. TWMS Journal of Applied and Engineering Mathematics, 13(3).
-
Odyuo, A. S., Mercy, P., & Patel, M. K. (2023). Fibonacci range labeling for shell-flower related graphs. In Advances in Pure and Applied Algebra (De Gruyter Proceedings). Berlin, Boston: De Gruyter.
Citations: 3
-
Odyuo, A. S., Mercy, P., & Patel, M. K. (2024). FR-labeling on hybrid partition shell graphs. In Advances in Mathematical and Computational Sciences: Proceedings of The … (De Gruyter Proceedings).
🎯Conclusion
Dr. Aronthung S. Odyuo stands out as a highly promising young researcher in Graph Theory with demonstrated originality, dedication, and early-career achievement. His specialized focus on Fibonacci-based graph labeling is mathematically elegant and carries potential applications in cryptographic systems, making his work both relevant and forward-looking. He is highly suitable for the Research for Young Scientist Award, particularly in mathematical sciences or theoretical computer science domains. With strategic visibility and enhanced collaborations, he is well-positioned to become a leading voice in modern discrete mathematics.