We consider the problem of ordering connected graphs by index (the largest eigenvalue). The asymptotic ordering for the connected graphs with index less than √2+ √5 is determined. Its application to the study of acyclic Kekulean molecules with big HOMO-LUMO separation is also given.
All Science Journal Classification (ASJC) codes
- Discrete Mathematics and Combinatorics
- Applied Mathematics