Reciprocal distance signless Laplacian spread of connected graphs

Let G be a connected graph with vertex set V ( G ) = { v 1 , v 2 , … , v n } . Recall that the reciprocal distance signless Laplacian matrix of G is defined to be R Q ( G ) = R T ( G ) + R D ( G ) , where RD ( G ) is the reciprocal distance matrix, and R T i is the reciprocal distance degree of vert...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Indian journal of pure and applied mathematics 2024-03, Vol.55 (1), p.400-411
Hauptverfasser:	Ma, Yuzheng, Gao, Yubin, Shao, Yanling
Format:	Artikel
Sprache:	eng
Schlagworte:	Applications of Mathematics Eigenvalues Mathematics Mathematics and Statistics Numerical Analysis Original Research Vertex sets
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!