On the distribution of eigenvalues of the reciprocal distance Laplacian matrix of graphs
S. Pirzada, Saleem Khan

TL;DR
This paper investigates the eigenvalues of the reciprocal distance Laplacian matrix of graphs, revealing their multiplicities, extremal properties, and spectral determination for several classes of graphs.
Contribution
It characterizes the eigenvalue multiplicities, identifies graphs with extremal spectral radii, and determines the spectrum for key graph families based on the reciprocal distance Laplacian matrix.
Findings
Multiplicity of the eigenvalue n relates to the complement graph's components.
Complete bipartite graphs maximize spectral radius among bipartite graphs.
Star graphs uniquely maximize spectral radius among trees.
Abstract
The reciprocal distance Laplacian matrix of a connected graph is defined as , where is the diagonal matrix of reciprocal distance degrees and is the Harary matrix. Since is a real symmetric matrix, we denote its eigenvalues as . The largest eigenvalue of is called the reciprocal distance Laplacian spectral radius. In this article, we prove that the multiplicity of as a reciprocal distance Laplacian eigenvalue of is exactly one less than the number of components in the complement graph of . We show that the class of the complete bipartite graphs maximize the reciprocal distance Laplacian spectral radius among all the bipartite graphs with vertices. Also, we show that the star graph is the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Synthesis and Properties of Aromatic Compounds · Magnetism in coordination complexes
