On conjectures involving second largest signless Laplacian eigenvalue of graphs

64Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

Abstract

Let G = (V, E) be a simple graph. Denote by D (G) the diagonal matrix of its vertex degrees and by A (G) its adjacency matrix. Then the Laplacian matrix of G is L (G) = D (G) - A (G) and the signless Laplacian matrix of G is Q (G) = D (G) + A (G). In this paper we obtain a lower bound on the second largest signless Laplacian eigenvalue and an upper bound on the smallest signless Laplacian eigenvalue of G. In [5], Cvetković et al. have given a series of 30 conjectures on Laplacian eigenvalues and signless Laplacian eigenvalues of G (see also [1]). Here we prove five conjectures. © 2010 Elsevier Inc. All rights reserved.

Cite

CITATION STYLE

APA

Das, K. C. (2010). On conjectures involving second largest signless Laplacian eigenvalue of graphs. Linear Algebra and Its Applications, 432(11), 3018–3029. https://doi.org/10.1016/j.laa.2010.01.005

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free