1,257 research outputs found
Computing the reciprocal distance signless Laplacian eigenvalues and energy of graphs
‎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
A Sharp upper bound for the spectral radius of a nonnegative matrix and applications
In this paper, we obtain a sharp upper bound for the spectral radius of a
nonnegative matrix. This result is used to present upper bounds for the
adjacency spectral radius, the Laplacian spectral radius, the signless
Laplacian spectral radius, the distance spectral radius, the distance Laplacian
spectral radius, the distance signless Laplacian spectral radius of a graph or
a digraph. These results are new or generalize some known results.Comment: 16 pages in Czechoslovak Math. J., 2016. arXiv admin note: text
overlap with arXiv:1507.0705
Developments on Spectral Characterizations of Graphs
In [E.R. van Dam and W.H. Haemers, Which graphs are determined by their spectrum?, Linear Algebra Appl. 373 (2003), 241-272] we gave a survey of answers to the question of which graphs are determined by the spectrum of some matrix associated to the graph. In particular, the usual adjacency matrix and the Laplacian matrix were addressed. Furthermore, we formulated some research questions on the topic. In the meantime some of these questions have been (partially) answered. In the present paper we give a survey of these and other developments.2000 Mathematics Subject Classification: 05C50Spectra of graphs;Cospectral graphs;Generalized adjacency matrices;Distance-regular graphs
- …