Contents

Ars Combinatoria

  • Research article

The Characterization of Graphs with the Largest Laplacian Eigenvalue at Most \(\frac{5+\sqrt{13}}{2}\)

G.R. Omidi1,2
1Department of Mathematical Sciences, Isfahan University of Technology, Isfahan, 84156-83111, Iran
2School of Mathematics, Institute for Research in Fundamental Sciences (IPM), P.O.Box:19395-5746, Tehran, Iran
  • Published: 31/01/2010

Abstract

In this paper, connected graphs with the largest Laplacian eigenvalue at most \(\frac{5+\sqrt{13}}{2}\) are characterized. Moreover, we prove that these graphs are determined by their Laplacian spectrum.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
G.R. Omidi. The Characterization of Graphs with the Largest Laplacian Eigenvalue at Most \(\frac{5+\sqrt{13}}{2}\)[J], Ars Combinatoria, Volume 094. 423-430. .