Reciprocal distance signless Laplacian spread of connected graphs
Publication details: New Delhi Springer 2024Edition: Vol.55(1), MarDescription: 400-411pSubject(s): Online resources: In: Indian journal of pure and applied mathematicsSummary: Let G be a connected graph with vertex set . Recall that the reciprocal distance signless Laplacian matrix of G is defined to be , where RD(G) is the reciprocal distance matrix, and is the reciprocal distance degree of vertex for , . Denote by and the largest eigenvalue and the least eigenvalue of RQ(G), respectively. The reciprocal distance signless Laplacian spread of G is defined as . In this paper, we obtain some bounds on reciprocal distance signless Laplacian spread of a graph.| Item type | Current library | Status | Barcode | |
|---|---|---|---|---|
Articles Abstract Database
|
School of Engineering & Technology Archieval Section | Not for loan | 2024-1576 |
Let G be a connected graph with vertex set . Recall that the reciprocal distance signless Laplacian matrix of G is defined to be , where RD(G) is the reciprocal distance matrix, and is the reciprocal distance degree of vertex for , . Denote by and the largest eigenvalue and the least eigenvalue of RQ(G), respectively. The reciprocal distance signless Laplacian spread of G is defined as . In this paper, we obtain some bounds on reciprocal distance signless Laplacian spread of a graph.
There are no comments on this title.
Click on an image to view it in the image viewer