A characterization of strongly regular graphs in terms of the largest signless Laplacian eigenvalues

DOI10.1016/J.LAA.2016.05.009zbMath1346.05162OpenAlexW2401608324MaRDI QIDQ739088

Feng-lei Fan, Chih-Wen Weng

Publication date: 17 August 2016

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2016.05.009

zbMATH Keywords

strongly regular graphssignless Laplacian matrix

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inequalities involving eigenvalues and eigenvectors (15A42)

Related Items (2)

Sharp upper bounds for the adjacency and the signless Laplacian spectral radius of graphs ⋮ Characterisation of all integral circulant graphs with multiplicative divisor sets and few eigenvalues

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A bound on the Laplacian spread which is tight for strongly regular graphs
• Upper bounds on the spectral radius of book-free and/or \(K_{2,l}\)-free graphs
• On conjectures involving second largest signless Laplacian eigenvalue of graphs
• The signless Laplacian spread
• The graphs with spectral radius between 2 and \(\sqrt{2+\sqrt{5}}\)
• The Gewirtz graph: An exercise in the theory of graph spectra
• The Laplacian spectrum of a graph
• TWO SHARP UPPER BOUNDS FOR THE SIGNLESS LAPLACIAN SPECTRAL RADIUS OF GRAPHS
• Towards a spectral theory of graphs based on the signless Laplacian, I
• The Laplacian Spectrum of a Graph II

This page was built for publication: A characterization of strongly regular graphs in terms of the largest signless Laplacian eigenvalues