Bounds on the Reciprocal distance energy and Reciprocal distance Laplacian energies of a graph
- 30 September 2020
- journal article
- research article
- Published by Taylor & Francis in Linear and Multilinear Algebra
- Vol. 70 (16) , 3097-3118
Abstract
Let G be a simple undirected connected graph. In this article, we find bounds on the Reciprocal Distance Energy, Reciprocal Distance Laplacian Energy and Reciprocal Distance signless Laplacian Energy. Furthermore, we characterized the graphs that attained some of those bounds.Keywords
Funding Information
- Vicerrectoría de Investigación, Innovación y Postgrado
- MINEDUC-UA (ANT1855-ANT1856-ANT1956)
This publication has 9 references indexed in Scilit:
- Upper bounds and lower bounds for the spectral radius of Reciprocal Distance, Reciprocal Distance Laplacian and Reciprocal Distance signless Laplacian matricesLinear Algebra and its Applications, 2021
- The Spectral Radius of the Reciprocal Distance Laplacian Matrix of a GraphBulletin of the Iranian Mathematical Society, 2018
- Sharp upper bounds on the distance energies of a graphLinear Algebra and its Applications, 2018
- Maximum eigenvalue of the reciprocal distance matrixJournal of Mathematical Chemistry, 2009
- Maximum eigenvalues of the reciprocal distance matrix and the reverse Wiener matrixInternational Journal of Quantum Chemistry, 2007
- Maximal Energy GraphsAdvances in Applied Mathematics, 2001
- Matrix Iterative Analysis2000
- On the Harary index for the characterization of chemical graphsJournal of Mathematical Chemistry, 1993
- Properties of the Latent Roots of a Matrix: The Estimation of π-Electron EnergiesThe Journal of Chemical Physics, 1971