Have a personal or library account? Click to login
On graphs with minimal distance signless Laplacian energy Cover

On graphs with minimal distance signless Laplacian energy

Open Access
|Dec 2021

Abstract

For a simple connected graph G of order n having distance signless Laplacian eigenvalues ρ1Qρ2QρnQ \rho _1^Q \ge \rho _2^Q \ge \cdots \ge \rho _n^Q , the distance signless Laplacian energy DSLE(G) is defined as DSLE(G)=i=1n| ρiQ-2W(G)n | DSLE\left( G \right) = \sum\nolimits_{i = 1}^n {\left| {\rho _i^Q - {{2W\left( G \right)} \over n}} \right|} where W(G) is the Weiner index of G. We show that the complete split graph has the minimum distance signless Laplacian energy among all connected graphs with given independence number. Further, we prove that the graph Kk ∨ ( Kt∪ Kn−k−t), 1t n-k2 1 \le t \le \left\lfloor {{{n - k} \over 2}} \right\rfloor has the minimum distance signless Laplacian energy among all connected graphs with vertex connectivity k.

Language: English
Page range: 450 - 467
Published on: Dec 30, 2021
In partnership with: Paradigm Publishing Services
Publication frequency: 2 issues per year

© 2021 S. Pirzada, Bilal A. Rather, Rezwan Ul Shaban, Merajuddin, published by Sapientia Hungarian University of Transylvania
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.