
doi: 10.3390/math8050792
In this article, we find sharp lower bounds for the spectral radius of the distance signless Laplacian matrix of a simple undirected connected graph and we apply these results to obtain sharp upper bounds for the distance signless Laplacian energy graph. The graphs for which those bounds are attained are characterized.
spectral radius, distance signless Laplacian energy, distance signless Laplacian matrix, QA1-939, Mathematics, distance signless Laplacian matrix; spectral radius; distance signless Laplacian energy
spectral radius, distance signless Laplacian energy, distance signless Laplacian matrix, QA1-939, Mathematics, distance signless Laplacian matrix; spectral radius; distance signless Laplacian energy
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 8 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
