Vidyanandini Subramaniyan | Graph Labeling | Best Researcher Award

Posted on by Network Science

Dr. Vidyanandini Subramaniyan | Graph Labeling | Best Researcher Award

Assistant Professor at SRM IST, Kattankulathur, India📖

Mrs. S. Vidyanandini is an experienced academician and researcher in the field of Mathematics, particularly in Graph Theory. She currently serves as an Assistant Professor at SRM Institute of Science and Technology (SRMIST), Chennai. With a rich teaching background and a passion for research, she has contributed significantly to the development of her field. Her research interests focus on graph labeling, distance in graphs, and various combinatorics applications in computer science, physical sciences, and social sciences.

Profile

Orcid Profile

Google Scholar Profile

Education Background🎓

Mrs. Vidyanandini holds a Doctor of Philosophy (Ph.D.) in Mathematics from SRM Institute of Science and Technology, which she completed in 2019 with high commendation. She earned her Master of Philosophy (M.Phil.) in Mathematics from Avinashilingam Deemed University in 2006, graduating with first-class honors. Prior to that, she completed her M.Sc. in Mathematics and B.Sc. in Mathematics, both from Govt. Arts College, affiliated with Periyar University, in 2005 and 2003, respectively, where she also earned first-class distinctions.

Professional Experience🌱

Mrs. Vidyanandini’s career spans over a decade in academia. She began as a Lecturer at Paavai Engineering College in 2007, where she taught for two years. She then worked as a Project Assistant at IIT Madras in 2010 before joining SRMIST in 2010 as an Assistant Professor, where she continues to teach and guide students in the field of Mathematics. Additionally, she has been involved in numerous academic administrative roles such as Class In-charge, Admission Coordinator, NAAC Coordinator, and Academic and Administrative Audit Coordinator.

Research Interests🔬

Her primary research focus is in Graph Theory, especially topics such as Graph Labeling, Distance in Graphs, and Graph Coloring. These areas play a pivotal role in combinatorics, with applications in computer science, biological, physical, and social sciences. She has worked extensively on graceful trees, modular irregular labeling, and composite labeling techniques, contributing to both theoretical advancements and practical applications in network analysis.

Author Metrics

Mrs. Vidyanandini has co-authored several notable book chapters and conference papers. She is a contributor to the book “Cloud Computing for Geospatial Big Data Analytics” (Springer, 2019) and has authored multiple papers in IEEE Xplore conference proceedings. Her works on graph labeling, network analysis, and modular irregular labeling have been well-received in the academic community. She is also a reviewer for journals such as the Turkish Journal of Mathematics and Journal of Advances in Mathematics and Computer Science.

Awards and Recognition:

Mrs. Vidyanandini has been honored with several accolades throughout her career, including two gold coins for achieving a 100% result in 2009 at Paavai Engineering College. She received the “Emerging Scientist Award” from VD-Good Technology Factory in December 2020 and an Appreciation Award for Teaching and Research from SRMIST for the academic year 2021-2022. Furthermore, she was recognized by SRMIST in 2022 for her contributions to research and teaching.

Publications Top Notes 📄

1. An empirical study of supervised learning methods for breast cancer diseases

  • Authors: S. Sivakumar, S. R. Nayak, S. Vidyanandini, J. A. Kumar, G. Palai
  • Journal: Optik
  • Volume: 175
  • Pages: 105-114
  • Year: 2018
  • DOI: 10.1016/j.ijleo.2018.02.016
  • Summary: This paper presents an empirical study of various supervised learning algorithms to predict breast cancer, exploring the application of machine learning in healthcare.

2. Graceful labeling of a tree from caterpillars

  • Authors: N. Parvathi, S. Vidyanandini
  • Journal: Journal of Information and Optimization Sciences
  • Volume: 35 (4)
  • Pages: 387-393
  • Year: 2014
  • Summary: The paper investigates the concept of graceful labeling in graph theory, specifically applied to caterpillar trees, which has applications in network theory and combinatorial mathematics.

3. Square difference labeling for complete bipartite graphs and trees

  • Authors: S. Vidyanandini, N. Parvathi
  • Journal: International Journal of Pure and Applied Mathematics
  • Volume: 118 (10)
  • Pages: 427-434
  • Year: 2018
  • Summary: This research introduces square difference labeling techniques applied to complete bipartite graphs and trees, contributing to the field of graph labeling.

4. On edge irregularity strength of complete graphs and complete bipartite graphs

  • Authors: S. Vidyanandini, N. Parvathi, S. Sivakumar
  • Journal: International Journal of Pure and Applied Mathematics
  • Volume: 119 (14)
  • Pages: 341-344
  • Year: 2018
  • Summary: This paper explores edge irregularity strength, specifically for complete graphs and complete bipartite graphs, providing deeper insights into the irregularity of edges in these fundamental graph structures.

5. Graph Composite Labeling techniques and Practical Applications

  • Authors: A. Sethukkarasi, S. Vidyanandini
  • Conference: 2024 International Conference on Emerging Systems and Intelligent Computing
  • Year: 2024
  • Summary: The paper presents various techniques in graph composite labeling and their practical applications, particularly in network analysis and intelligent computing systems.

Conclusion

Dr. Vidyanandini Subramaniyan is a highly deserving candidate for the Best Researcher Award, given her extensive research contributions, academic excellence, and positive impact on both theoretical and applied mathematics. Her work in graph theory, especially in the areas of graph labeling and network analysis, stands as a testament to her intellectual rigor and commitment to advancing mathematics. As she continues to grow and evolve in her career, focusing on expanding interdisciplinary collaborations and incorporating emerging technologies into her research will further enhance her impact in the academic and industrial spheres.

Umar Ali | Graph Theory | Best Researcher Award

Posted on by Network Science

Dr. Umar Ali | Graph Theory | Best Researcher Award

Post doc at University of Shanghai for Science and Technology,  China📖

Dr. Umar Ali is a skilled mathematician with a focus on graph theory, spectral graph theory, and mathematical chemistry. He holds a Ph.D. in Mathematics from Anhui University, China, where his research centered on resistance distance-based graph invariants and spanning trees in specific classes of graphs. With extensive academic training and a commitment to advancing mathematical knowledge, Dr. Ali is proficient in mathematical modeling, analysis, and software applications, aiming to provide bespoke solutions for real-world problems.

Profile

Scopus Profile

Education Background🎓

  • Ph.D. in Mathematics (2018-2022), School of Mathematical Sciences, Anhui University, Hefei, China.
    Dissertation: Resistance Distance-Based Graph Invariants and Spanning Tree in Some Classes of Graphs.
    Supervisor: Prof. Xiang-Feng Pan
  • MPhil in Mathematics (2015-2017), University of Management and Technology (UMT), Lahore, Pakistan.
    Dissertation: 3-Total Edge Product Cordial Labelling of Some Standard Classes of Graphs and Convex Polytopes.
    Supervisor: Dr. Zohaib Zahid
  • M.Sc. in Mathematics (2010-2013), University of the Punjab, Lahore, Pakistan.
  • B.Sc. in Mathematics (2007-2010), University of the Punjab, Lahore, Pakistan.

Professional Experience🌱

Dr. Umar Ali has served as a researcher and lecturer at several academic institutions, contributing to the advancement of mathematical sciences. His expertise lies in graph theory and algebraic combinatorics. He has collaborated with various international scholars and researchers on cutting-edge mathematical problems and is actively involved in the publication of research papers in prestigious journals. Dr. Ali has also been a reviewer for several scientific journals, enhancing his engagement with the academic community.

Research Interests🔬

Dr. Umar Ali’s research interests include:

  • Discrete Mathematics
  • Graph Theory
  • Spectral Graph Theory
  • Algebraic Combinatorics
  • Mathematical Chemistry
  • Chemical Graph Theory

Author Metrics

Dr. Ali has authored several research papers, with notable publications in journals such as Polycyclic Aromatic Compounds (IF 3.744) and Symmetry (IF 2.713). His contributions include work on the normalized Laplacian spectrum, Kirchhoff index, resistance distance, and spanning trees in various graph structures. He has published in SCI-indexed journals and contributed significantly to the mathematical community.

Publications Top Notes 📄

1. Computing the Laplacian Spectrum and Wiener Index of Pentagonal-Derivation Cylinder/Möbius Network

Authors: Ali, U., Li, J., Ahmad, Y., Raza, Z.
Journal: Heliyon
Year: 2024
Volume: 10
Issue: 2
Article Number: e24182
DOI: Link disabled (No DOI available)
Abstract: This paper examines the Laplacian spectrum and Wiener index of the pentagonal-derivation cylinder and Möbius network. These networks are studied in the context of graph theory and chemical graph theory, exploring how their mathematical properties influence their structure and behavior.

2. Computing the Normalized Laplacian Spectrum and Spanning Tree of the Strong Prism of Octagonal Network

Authors: Ahmad, Y., Ali, U., Siddique, I., Afifi, W.A., Abd-El-Wahed Khalifa, H.
Journal: Journal of Mathematics
Year: 2022
Article ID: 9269830
DOI: 10.1155/2022/9269830
Abstract: This paper explores the normalized Laplacian spectrum and spanning tree properties of the strong prism of an octagonal network. The study aims to provide a deeper understanding of the structural properties of networks with octagonal symmetry and their applications in network science.

3. Resistance Distance-Based Indices and Spanning Trees of Linear Pentagonal-Quadrilateral Networks

Authors: Ali, U., Ahmad, Y., Xu, S.-A., Pan, X.-F.
Journal: Polycyclic Aromatic Compounds
Year: 2022
Volume: 42
Issue: 9
Pages: 6352–6371
DOI: Link disabled (No DOI available)
Abstract: This article focuses on the resistance distance-based indices and spanning tree properties of linear pentagonal-quadrilateral networks. It discusses how these networks’ resistance distance properties and spanning trees provide insight into the connectivity and robustness of the systems in question, with particular relevance to chemical graph theory.

4. On Normalized Laplacian, Degree-Kirchhoff Index of the Strong Prism of Generalized Phenylenes

Authors: Ali, U., Ahmad, Y., Xu, S.-A., Pan, X.-F.
Journal: Polycyclic Aromatic Compounds
Year: 2022
Volume: 42
Issue: 9
Pages: 6215–6232
DOI: Link disabled (No DOI available)
Abstract: This paper delves into the normalized Laplacian and degree-Kirchhoff indices of the strong prism of generalized phenylenes, contributing to the field of chemical graph theory. The work analyzes the impact of these indices on the stability and chemical properties of molecular networks.

5. On Normalized Laplacians, Degree-Kirchhoff Index, and Spanning Tree of Generalized Phenylene

Authors: Ali, U., Raza, H., Ahmed, Y.
Journal: Symmetry
Year: 2021
Volume: 13
Issue: 8
Article Number: 1374
DOI: Link disabled (No DOI available)
Abstract: This research investigates the normalized Laplacian, degree-Kirchhoff index, and spanning tree of generalized phenylene. The work aims to provide insights into the mathematical properties of molecular networks, particularly focusing on how these indices relate to the stability and behavior of chemical structures.

Conclusion

Dr. Umar Ali is a highly deserving candidate for the Best Researcher Award based on his deep expertise in graph theory, innovative contributions to chemical graph theory, and the substantial impact his research has had on both theoretical and applied mathematics. His academic credentials, research collaborations, and high-quality publications place him in an excellent position for this prestigious recognition.

His strengths in research output, theoretical advancements, and academic contributions clearly demonstrate that he is on the path to becoming a leading figure in his field. A slight improvement in interdisciplinary applications and engagement with industry could further elevate his already impressive profile. Given his outstanding achievements, Dr. Ali is a fitting candidate for the Best Researcher Award.