Contents

Ars Combinatoria

  • Research article

Graphs with Fourth Largest Signless-Laplacian Eigenvalue Less Than Two

Yarong Wu1, Hailiang Zhang2, Bingbing Wang3
1College of Arts and Sciences, Shanghai Maritime University, Shanghai 201306, China
2Department of Mathematics, Taizhou University, Linhai Zhejiang 317000, China
3Yinzhou Gulin Vocational High School, Ningbo Zhejiang 315177, China
  • Published: 31/07/2013

Abstract

In this paper, all connected graphs with the fourth largest signless-Laplacian eigenvalue less than two are determined.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

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

Citation
Yarong Wu, Hailiang Zhang, Bingbing Wang. Graphs with Fourth Largest Signless-Laplacian Eigenvalue Less Than Two[J], Ars Combinatoria, Volume 111. 289-303. .