Prof. Dr. Rao Li | Hamiltonian Graph | Best Researcher Award

Professor at University of South Carolina Aiken, United States📖

Dr. Rao Li is a distinguished professor in the Department of Computer Science, Engineering, and Mathematics at the University of South Carolina Aiken, with extensive experience in teaching, research, and academic leadership. His expertise spans graph theory, algorithm design, network science, and programming, making significant contributions to the fields of mathematics and computer science. He has served five terms as the Bridgestone/Firestone SC Endowed Professor for Mathematics and Computer Science and is dedicated to mentoring students and advancing computational research.

Profile

Scopus Profile

Google Scholar Profile

Education Background🎓

Ph.D. in Mathematical Science (Graph Theory)
University of Memphis, Memphis, TN (1999)
Dissertation: Hamiltonian Properties of Claw-Free or Clawlike-Free Graphs
M.S. in Mathematical Science (Computer Science)
University of Memphis, Memphis, TN (1999)
Thesis: A Polynomial-Time Algorithm for Finding the Independence Number of a Special Class of Graphs
M.A. in Mathematics
University of Pittsburgh, Pittsburgh, PA (1994)
M.S. in Applied Mathematics (Graph Theory)
Harbin Institute of Technology, China (1988)
Thesis: The Studies of Hamilton Problem in Graph Theory
B.S. in Mathematics
Huaibei Normal University, China (1985)

Professional Experience🌱

Dr. Li has been a faculty member at the University of South Carolina Aiken since 2001, where he has progressed from tenure-track assistant professor to full professor. He has taught an extensive range of courses, including cryptography, algorithm design, mobile computing, and graph theory. His previous roles include tenure-track assistant professor at Georgia Southwestern State University and teaching positions at the University of Memphis, University of Pittsburgh, and Liaoning University of Petroleum and Chemical Technology in China. His teaching integrates cutting-edge tools like TI-83 calculators, Java programming, and Android application development.

Research Interests🔬

Dr. Li’s research focuses on:

Graph Theory: Hamiltonian properties, chromatic numbers, Zagreb index, and spectral graph theory.
Algorithm Design: Variants of the longest common subsequence problem and algorithmic graph theory.
Network Science: Centrality measures, spectral clustering algorithms, and latent semantic indexing.
Machine Learning: Principal component analysis and singular value decomposition for neural networks.

Author Metrics

Dr. Rao Li is a prolific researcher with a robust academic footprint, as evidenced by his author metrics. His works have garnered over 300 citations, reflecting their impact and relevance in the fields of mathematics and computer science. With an h-index exceeding 10 and an i10-index of 10+, Dr. Li’s contributions are well-recognized in areas such as graph theory, algorithm design, and network science. His publications, featured in esteemed journals and conferences, underscore his commitment to advancing research and addressing complex computational problems. These metrics highlight his influence as a thought leader in his domain.

Publications Top Notes 📄

1. Lower Bounds for the Kirchhoff Index

Author: Rao Li
Journal: MATCH Communications in Mathematical and Computer Chemistry
Volume: 70
Pages: 163-174
Year: 2013
Citations: 36
Summary: This paper derives new lower bounds for the Kirchhoff index, a key graph invariant used in chemistry and network theory. The results have significant applications in understanding resistance distances.

2. Some Lower Bounds for Laplacian Energy of Graphs

Author: Rao Li
Journal: International Journal of Contemporary Mathematical Sciences
Volume: 4
Issue: 5
Pages: 219-223
Year: 2009
Citations: 26
Summary: The paper investigates lower bounds for the Laplacian energy of graphs, advancing the study of spectral properties and energy computations in graph structures.

3. A New Sufficient Condition for Hamiltonicity of Graphs

Author: Rao Li
Journal: Information Processing Letters
Volume: 98
Issue: 4
Pages: 159-161
Year: 2006
Citations: 22
Summary: This work provides a new sufficient condition for Hamiltonicity in graphs, contributing to the understanding of graph traversal and cycles.

4. Harary Index and Some Hamiltonian Properties of Graphs

Author: Rao Li
Journal: AKCE International Journal of Graphs and Combinatorics
Volume: 12
Issue: 1
Pages: 64-69
Year: 2015
Citations: 19
Summary: This paper links the Harary index, a graph invariant, to Hamiltonian properties, offering insights into graph connectivity and design.

5. The First Zagreb Index and Some Hamiltonian Properties of the Line Graph of a Graph

Authors: Rao Li and M.M. Taylor
Journal: Journal of Discrete Mathematical Sciences and Cryptography
Volume: 20
Issue: 2
Pages: 445-451
Year: 2017
Citations: 18
Summary: The research connects the first Zagreb index to Hamiltonian properties of line graphs, contributing to both theoretical and practical aspects of graph theory.

Conclusion

Dr. Rao Li’s extensive contributions to graph theory, his robust academic metrics, and his commitment to interdisciplinary research make him a strong contender for the Best Researcher Award. His work demonstrates a balance of theoretical rigor and practical application, which is essential for advancing computational and mathematical sciences. While he already excels in his domain, expanding collaborations and integrating his research with emerging fields could elevate his profile further.

Recommendation: Dr. Rao Li is not only a suitable candidate but an exemplar of research excellence, deserving recognition for his sustained contributions to mathematics and computer science.

Introduction of Excellence in Academic Research Award in Network Science and Graph Analytics

Welcome to the pinnacle of recognition in the realm of Network Science and Graph Analytics - the 'Excellence in Academic Research Award.' This distinguished award celebrates and honors outstanding contributions to the academic landscape in these cutting-edge fields.

Eligibility:

This award is open to researchers and academics who have demonstrated exceptional prowess in the domains of Network Science and Graph Analytics. There are no age limits; the focus is solely on the quality of research contributions.

Qualifications:

Candidates must hold a Ph.D. in a relevant field and showcase a significant body of work that has made a noteworthy impact on the academic community. Qualifications will be assessed based on the depth and breadth of the candidate's contributions.

Publications and Requirements:

Applicants should have a track record of high-quality publications in reputable journals and conferences. A comprehensive research portfolio that includes innovative approaches, methodologies, and insights in Network Science and Graph Analytics is highly encouraged.

Evaluation Criteria:

The selection process will consider the originality, significance, and impact of the candidate's research. Emphasis will be placed on the academic merit, methodological rigor, and practical implications of the contributions.

Submission Guidelines:

Detailed submission guidelines can be found [here], ensuring a seamless process for candidates to present their achievements and qualifications.

Recognition:

The awardee will receive a prestigious trophy, a certificate of excellence, and the opportunity to present their work at a distinguished event within the academic community.

Community Impact:

Beyond personal recognition, the award aims to highlight the broader impact of academic research in Network Science and Graph Analytics, fostering collaboration and knowledge exchange within the community.

Biography, Abstract, and Supporting Files:

Candidates are required to submit a brief biography, an abstract summarizing their key contributions, and supporting files that demonstrate the impact of their research. These elements collectively provide a comprehensive overview of the candidate's academic journey.

Rao Li | Hamiltonian Graph | Best Researcher Award

Prof. Dr. Rao Li | Hamiltonian Graph | Best Researcher Award

Profile

Education Background🎓

Author Metrics

Excellence in Academic Research Award in Network Science and Graph Analytics

Introduction of Excellence in Academic Research Award in Network Science and Graph Analytics

Eligibility:

Qualifications:

Publications and Requirements:

Evaluation Criteria:

Submission Guidelines:

Recognition:

Community Impact:

Biography, Abstract, and Supporting Files:

RECOMMENDED

Mail us