New Bounds for Distance Energy of A Graph

G. Sridhara, Rajesh Kanna, H.L. Parashivamurthy

Abstract


For any connected graph G, the distance energy, E_D(G) is defined as the sum of the absolute eigenvalues of its distance matrix.  Distance energy was introduced by Indulal et al in the year 2008. It has significant importance in QSPR analysis of molecular descriptor to study  their physico-chemical properties. Our interest in this article is to establish new lower and upper bounds for distance energy.


Full Text:

PDF


DOI: https://doi.org/10.22342/jims.26.2.789.213-223

Refbacks

  • There are currently no refbacks.



Journal of the Indonesian Mathematical Society
Mathematics Department, Universitas Gadjah Mada
Senolowo, Sinduadi, Mlati, Sleman Regency, Special Region of Yogyakarta 55281, Telp. (0274) 552243
Email: jims.indoms@gmail.com


p-ISSN: 2086-8952 | e-ISSN: 2460-0245


Journal of the Indonesian Mathematical Society is licensed under a Creative Commons Attribution 4.0 International License

web statistics
View My Stats