Graphs with small second largest Laplacian eigenvalue

  • Authors:
  • Yarong Wu;Guanglong Yu;Jinlong Shu

  • Affiliations:
  • -;-;-

  • Venue:
  • European Journal of Combinatorics
  • Year:
  • 2014

Quantified Score

Hi-index 0.00

Visualization

Abstract

Let L(G) be the Laplacian matrix of G. In this paper, we characterize all of the connected graphs with second largest Laplacian eigenvalue no more than l; where l@?3.2470 is the largest root of the equation @m^3-5@m^2+6@m-1=0. Moreover, this result is used to characterize all connected graphs with second largest Laplacian eigenvalue no more than three.