Abstract
In this paper, we obtain the lower and upper bounds of the maximum eigenvalue of the reciprocal distance matrix of a connected (molecular) graph. We also give the Nordhaus-Gaddum-type result for the maximum eigenvalue.
| Original language | English |
|---|---|
| Pages (from-to) | 21-28 |
| Number of pages | 8 |
| Journal | Journal of Mathematical Chemistry |
| Volume | 47 |
| Issue number | 1 |
| DOIs | |
| State | Published - Jan 2009 |
Keywords
- Diameter
- Lower bound
- Maximum eigenvalue
- Molecular graph
- Reciprocal distance matrix
- Upper bound