NEW BOUNDS AND EXTREMAL GRAPHS FOR DISTANCE SIGNLESS LAPLACIAN SPECTRAL RADIUS
Publish place: Journal of Algebraic Systems، Vol: 8، Issue: 2
Publish Year: 1400
نوع سند: مقاله ژورنالی
زبان: English
View: 214
This Paper With 20 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_JAS-8-2_008
تاریخ نمایه سازی: 7 بهمن 1399
Abstract:
The distance signless Laplacian spectral radius of a connected graph $G$ is the largest eigenvalue of the distance signless Laplacian matrix of $G$, defined as $D^{Q}(G)=Tr(G)+D(G)$, where $D(G)$ is the distance matrix of $G$ and $Tr(G)$ is the diagonal matrix of vertex transmissions of $G$. In this paper, we determine some new upper and lower bounds on the distance signless Laplacian spectral radius of $G$ and characterize the extremal graphs attaining these bounds.
Keywords:
Authors
A. Alhevaz
Faculty of Mathematical Sciences, Shahrood
M. Baghipur
Department of Mathematics, University of
S. Paul
Department of Applied Sciences, Tezpur University,