SPECTRA OF CLOSENESS LAPLACIAN AND CLOSENESS SIGNLESS LAPLACIAN OF GRAPHS

For a graph G with vertex set V(G) and u, v is an element of V(G), the distance between vertices u and v in G, denoted by d(G)(u, v), is the length of a shortest path connecting them and it is infinity if there is no such a path, and the closeness of vertex u in G is c(G)(u) = Sigma(w is an element of V(G)) 2(-dG(u,w)). Given a graph G that is not necessarily connected, for u, v is an element of V(G), the closeness matrix of G is the matrix whose (u, v)-entry is equal to 2(-dG(u, v)) if u not equal v and 0 otherwise, the closeness Laplacian is the matrix whose (u, v)-entry is equal to {-2(-dG(u,v)) if u not equal v, c(G)(u) otherwise and the closeness signless Laplacian is the matrix whose (u, v)-entry is equal to {-2(-dG (u, v)) if u not equal v, c(G)(u) otherwise. We establish relations connecting the spectral properties of closeness Laplacian and closeness signless Laplacian and the structural properties of graphs. We give tight upper bounds for all nontrivial closeness Laplacian eigenvalues and characterize the extremal graphs, and determine all trees and unicyclic graphs that maximize the second smallest closeness Laplacian eigenvalue. Also, we give tight upper bounds for the closeness signless Laplacian eigenvalues and determine the trees whose largest closeness signless Laplacian eigenvalues achieve the first two largest values.