Abstract

Let G be a simple undirected connected graph. The Harary matrix of graph G, which is also called as the Reciprocal Distance matrix, was introduced by Playsic et al. in 1993. Bapat and Panda, in 2018, defined the Reciprocal Distance Laplacian matrix, and Alhevaz et al., in 2019, defined the Reciprocal Distance signless Laplacian matrix. In this article, we find upper bounds and lower bounds for the spectral radius of the Reciprocal Distance matrix, Reciprocal Distance Laplacian matrix and Reciprocal Distance signless Laplacian matrix. (C) 2020 Elsevier Inc. All rights reserved.