Abstract
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.
Original language | English (US) |
---|---|
Pages (from-to) | 295-306 |
Number of pages | 12 |
Journal | Discrete Applied Mathematics |
Volume | 121 |
Issue number | 1-3 |
DOIs | |
State | Published - Sep 15 2002 |
All Science Journal Classification (ASJC) codes
- Discrete Mathematics and Combinatorics
- Applied Mathematics