Karthick V | Best Research Award | Graph Theory Applications Quantum Computing

Published on by Network Science

Best Research Award

Karthick V
AMET University, India,

Karthick V
Affiliation AMET University
Country India
Scopus ID 60046171600
Documents 3
Citations 1
h-index 1
Subject Area Graph Theory Applications Quantum Computing
Event International Research Awards on Network Science & Graph Analytics

Karthick’s academic profile combines graph-theoretical methods with interests in quantum computing. Graph theory provides mathematical frameworks for representing relationships and complex structures, while quantum computing introduces computational models based on quantum-mechanical principles. The intersection of these areas represents an emerging field of research with potential relevance to algorithms, optimization, networks and information processing. [1]

Abstract

Karthick, affiliated with AMET University, India, is identified with research interests in graph theory applications and quantum computing. His documented Scopus profile contains three documents under Author ID 60046171600. The combination of graph-theoretical reasoning and quantum computational concepts provides an interdisciplinary basis for investigating mathematical structures, computational models and emerging approaches to complex problem solving. [1] The available information supports consideration of his profile within an academic recognition framework focused on network science and graph analytics.

Keywords

  • Graph Theory
  • Quantum Computing
  • Network Science
  • Graph Analytics
  • Computational Mathematics

Introduction

Graph theory is an established mathematical discipline concerned with vertices, edges and the relationships represented between them. Its applications extend across computer science, engineering, communication networks, optimization and data analysis. Quantum computing, meanwhile, studies computational approaches that use quantum states and operations to address classes of problems that may be difficult for conventional computing systems. Research connecting graph structures with quantum computational methods is consequently relevant to contemporary theoretical and applied computing. [2]

Research Profile

Karthick’s supplied academic profile identifies AMET University as his institutional affiliation and India as his country. His stated subject area is graph theory application and quantum computing. The available bibliographic information records three documents in Scopus under Author ID 60046171600. Citation and h-index values were not supplied and are therefore not interpreted in this article. [1]

Research Contributions

The principal research direction associated with Karthick is the application of graph theory within computational contexts, together with an interest in quantum computing. Such an interdisciplinary direction can involve the representation of computational problems as graph structures, analysis of graph properties, and investigation of algorithms or models influenced by quantum computation. Graph-based approaches are also relevant to network representation and optimization, areas closely related to modern network science. [2]

Publications

The supplied profile indicates three documents associated with Scopus Author ID 60046171600. Specific publication titles, journals, publication years and DOI identifiers were not provided. Accordingly, individual publications are not attributed here without bibliographic verification. A complete publication assessment should use the researcher’s verified institutional record and authoritative bibliographic databases. [1]

Research Impact

Research combining graph theory and quantum computing is positioned within an expanding interdisciplinary landscape involving mathematical modelling, algorithms, optimization and information processing. The academic significance of an individual researcher in this area is best assessed through verified publications, citations, peer-reviewed contributions, collaborations and demonstrable applications. Because citation and h-index information for Karthick was not supplied, this article does not assign quantitative impact beyond the stated publication record.

Award Suitability

Based on the supplied information, Karthick’s research interests in graph theory applications and quantum computing are thematically aligned with the International Research Awards on Network Science & Graph Analytics. The profile presents an interdisciplinary research direction relevant to graph-based analysis and computational science. Final award evaluation should be based on the organizer’s eligibility requirements, independently verified academic records, publication quality, research originality and documented impact.

Conclusion

Karthick’s profile at AMET University reflects an academic interest in graph theory applications and quantum computing. With three documents listed under the supplied Scopus Author ID, the available record provides an initial basis for examining his research activity. Further bibliographic and citation verification would be appropriate for a comprehensive assessment of publication impact and scholarly contribution. [1]

References

  1. Elsevier. (n.d.). Scopus author details: Karthick, Author ID 60046171600. Scopus.https://www.scopus.com/authid/detail.uri?authorId=60046171600
  2. Nielsen, M. A., & Chuang, I. L. (2010). Quantum Computation and Quantum Information. Cambridge University Press.https://doi.org/10.1017/CBO9780511976667

Vidyanandini Subramaniyan | Graph Labeling | Best Researcher Award

Published 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.