On the Sum and Spread of Reciprocal Distance Laplacian Eigenvalues of Graphs in Terms of Harary Index
On the Sum and Spread of Reciprocal Distance Laplacian Eigenvalues of Graphs in Terms of Harary Index
The reciprocal distance Laplacian matrix of a connected graph G is defined as RDL(G)=RT(G)−RD(G), where RT(G) is the diagonal matrix of reciprocal distance degrees and RD(G) is the Harary matrix. Clearly, RDL(G) is a real symmetric matrix, and we denote its eigenvalues as λ1(RDL(G))≥λ2(RDL(G))≥…≥λn(RDL(G)). The largest eigenvalue λ1(RDL(G)) of RDL(G), …