Journal
JOURNAL OF MATHEMATICAL CHEMISTRY
Volume 47, Issue 1, Pages 21-28Publisher
SPRINGER
DOI: 10.1007/s10910-009-9529-1
Keywords
Molecular graph; Reciprocal distance matrix; Maximum eigenvalue; Diameter; Lower bound; Upper bound
Funding
- Sungkyunkwan University, Suwon, Republic of Korea
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
