On the Sum and Spread of Reciprocal Distance Laplacian Eigenvalues of Graphs in Terms of Harary Index

Saleem Khan, Shariefuddin Pirzada*, Yilun Shang*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

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), denoted by λ(G), 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 RTmax, minimum reciprocal distance degree RTmin, and Harary index H(G) 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 λ(G) 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 RDLS(G)=λ1(RDL(G))−λn−1(RDL(G)) in terms of various graph parameters. We determine the extremal graphs in many cases.
Original languageEnglish
Article number1937
Number of pages10
JournalSymmetry
Volume14
Issue number9
DOIs
Publication statusPublished - 17 Sep 2022

Fingerprint

Dive into the research topics of 'On the Sum and Spread of Reciprocal Distance Laplacian Eigenvalues of Graphs in Terms of Harary Index'. Together they form a unique fingerprint.

Cite this