Computing the reciprocal distance signless Laplacian eigenvalues and energy of graphs
Copyright policy )Computing the reciprocal distance signless Laplacian eigenvalues and energy of graphs
Summary: 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.
Eigenvalues, singular values, and eigenvectors, Distance in graphs, Graphs and linear algebra (matrices, eigenvalues, etc.), reciprocal distance signless Laplacian matrix, maximum eigenvalues
Eigenvalues, singular values, and eigenvectors, Distance in graphs, Graphs and linear algebra (matrices, eigenvalues, etc.), reciprocal distance signless Laplacian matrix, maximum eigenvalues
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).0 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.Average 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.Average
Citations provided by BIP!Popularity provided by BIP!