Affordable Access

Publisher Website

On conjectures involving second largest signless Laplacian eigenvalue of graphs

Authors
Journal
Linear Algebra and its Applications
0024-3795
Publisher
Elsevier
Publication Date
Volume
432
Issue
11
Identifiers
DOI: 10.1016/j.laa.2010.01.005
Keywords
  • Graph
  • Laplacian Matrix
  • Algebraic Connectivity
  • Signless Laplacian Matrix
  • The Largest Signless Laplacian Eigenvalue
  • The Second Largest Signless Laplacian Eigenvalue
  • Smallest Signless Laplacian Eigenvalue

Abstract

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.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments