QR koda

Some inequalities involving the distance signless Laplacian eigenvalues of graphs

‎Given a simple graph $G$‎, ‎the distance signlesss Laplacian‎ ‎$D^{Q}(G)=Tr(G)+D(G)$ is the sum of vertex transmissions matrix‎ ‎$Tr(G)$ and distance matrix $D(G)$‎. ‎In this paper‎, ‎thanks to the‎ ‎symmetry of $D^{Q}(G)$‎, ‎we obtain novel sharp bounds on the distance‎ ‎signless Laplacian eigenva...

Popoln opis

Shranjeno v:
Bibliografske podrobnosti
Principais autores: Abdollah Alhevaz, ‎Maryam Baghipur, Shariefuddin Pirzada, Yilun Shang
Format: Artigo
Jezik:Inglês
Izdano: University of Isfahan 2021-03-01
Serija:Transactions on Combinatorics
Teme:
Online dostop:https://toc.ui.ac.ir/article_24869_33e5843c0139fc2f041661ebaf4e1d2f.pdf
Oznake: Označite
Brez oznak, prvi označite!