Abstract
The reciprocal distance Laplacian matrix of a connected graph G is defined as , where is the diagonal matrix of reciprocal distance degrees and is the Harary matrix. Clearly, is a real symmetric matrix, and we denote its eigenvalues as . The largest eigenvalue of , denoted by , is called the reciprocal distance Laplacian spectral radius. In this paper, we obtain several upper bounds for the sum of k largest reciprocal distance Laplacian eigenvalues of G in terms of various graph parameters, such as order n, maximum reciprocal distance degree , minimum reciprocal distance degree , and Harary index of G. We determine the extremal cases corresponding to these bounds. As a consequence, we obtain the upper bounds for reciprocal distance Laplacian spectral radius in terms of the parameters as mentioned above and characterize the extremal cases. Moreover, we attain several upper and lower bounds for reciprocal distance Laplacian spread in terms of various graph parameters. We determine the extremal graphs in many cases.