Graphs whose normalized Laplacian has three eigenvalues

DOI10.1016/J.LAA.2011.02.005zbMath1222.05185arXiv1202.3027OpenAlexW2127769624MaRDI QIDQ550639

Gholam Reza Omidi, van Dam, Edwin R.

Publication date: 13 July 2011

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

Full work available at URL: https://arxiv.org/abs/1202.3027

zbMATH Keywords

strongly regular graphseigenvaluestransition matrixgraph spectranormalized Laplacian matrixquasi-symmetric designs

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (16)

Full characterization of graphs having certain normalized Laplacian eigenvalue of multiplicity \(n-3\) ⋮ On the multiplicity of the least signless Laplacian eigenvalue of a graph ⋮ On graphs with three distinct signless Laplacian eigenvalues ⋮ The normalized Laplacians on both \(k\)-triangle graph and \(k\)-quadrilateral graph with their applications ⋮ Complete characterization of the bidegreed split graphs with three or four distinct \(A_{\alpha}\)-eigenvalues ⋮ Characterisation of all integral circulant graphs with multiplicative divisor sets and few eigenvalues ⋮ Characterization of graphs with some normalized Laplacian eigenvalue of multiplicity \(n - 3\) ⋮ On split graphs with three or four distinct (normalized) Laplacian eigenvalues ⋮ On the normalized Laplacians with some classical parameters involving graph transformations ⋮ On the multiplicities of normalized Laplacian eigenvalues of graphs ⋮ Integral unicyclic graphs ⋮ A family of graphs that are determined by their normalized Laplacian spectra ⋮ Graphs with three distinct \(\alpha\)-eigenvalues ⋮ Trees with 4 or 5 distinct normalized Laplacian eigenvalues ⋮ Normalized algebraic connectivity of graphs ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Universal adjacency matrices with two eigenvalues
• A construction of cospectral graphs for the normalized Laplacian
• On graphs with three distinct Laplacian eigenvalues
• On the normalized Laplacian energy and general Randić index \(R_{-1}\) of graphs
• Developments on spectral characterizations of graphs
• Graphs with three distinct eigenvalues and largest eigenvalue less than 8
• Strongly regular designs and coherent configurations of type \([{32\atop\;3}\)]
• Multiplicative cones - a family of three eigenvalue graphs
• Nonregular graphs with three eigenvalues
• Graphs with constant \(\mu\) and \(\overline{\mu}\)
• On Cheeger inequalities of a graph
• Which graphs are determined by their spectrum?
• On graphs with three eigenvalues
• Small regular graphs with four eigenvalues
• Some characterizations of quasi-symmetric designs with a spread
• A nonregular analogue of conference graphs
• Regular graphs with four eigenvalues
• Strongly regular graphs with strongly regular decomposition
• A note on graphs whose signless Laplacian has three distinct eigenvalues
• A note about cospectral graphs for the adjacency and normalized Laplacian matrices
• An Interlacing Result on Normalized Laplacians
• Strongly Regular Graphs Derived from Combinatorial Designs

This page was built for publication: Graphs whose normalized Laplacian has three eigenvalues