Computing the reciprocal distance signless Laplacian eigenvalues and energy of graphs
Abstract
In this paper, we study the eigenvalues of the reciprocal distance signless Laplacian matrix of a connected graph and
obtain some bounds for the maximum
eigenvalue of this matrix. We also focus on bipartite graphs and find some bounds for the spectral radius of the reciprocal distance signless Laplacian matrix of this class of graphs. Moreover, we give bounds for the reciprocal distance signless Laplacian energy.
Copyright (c) 2019 Abdollah Alhevaz, Maryam Baghipur, Harishchandra Ramane
This work is licensed under a Creative Commons Attribution 4.0 International License.
The authors retain all rights to the original work without any restrictions.
License for Published Contents
"Le Matematiche" published articlesa are distribuited with Creative Commons Attribution 4.0 International. You are free to copy, distribute and transmit the work, and to adapt the work. You must attribute the work in the manner specified by the author or licensor (but not in any way that suggests that they endorse you or your use of the work).
License for Metadata
"Le Matematiche" published articles metadata are dedicated to the public domain by waiving all publisher's rights to the work worldwide under copyright law, including all related and neighboring rights, to the extent allowed by law.
You can copy, modify, distribute and perform the work, even for commercial purposes, all without asking permission.
No Fee Charging
No fee is required to complete the submission/review/publishing process of authors paper.
