On split graphs with three or four distinct (normalized) Laplacian eigenvalues

DOI10.1002/jcd.21743OpenAlexW3042429179MaRDI QIDQ6188120

Wanting Sun, Shuchao Li

Publication date: 1 February 2024

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.21743

zbMATH Keywords

split graphcombinatorial designnormalized Laplacian matrixbidegreed graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Structural characterization of families of graphs (05C75)

Related Items (1)

Complete characterization of the bidegreed split graphs with three or four distinct \(A_{\alpha}\)-eigenvalues

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Biregular graphs with three eigenvalues
• On graphs with just three distinct eigenvalues
• On regular graphs with four distinct eigenvalues
• Universal adjacency matrices with two eigenvalues
• Graphs whose normalized Laplacian has three eigenvalues
• Two spectral characterizations of regular, bipartite graphs with five eigenvalues
• Graphs with four distinct Laplacian eigenvalues
• Spectra of graphs
• On graphs with three distinct Laplacian eigenvalues
• Multiplicative cones - a family of three eigenvalue graphs
• Graphs with constant \(\mu\) and \(\overline{\mu}\)
• On graphs with three eigenvalues
• Small regular graphs with four eigenvalues
• Split graphs
• Regular graphs with four eigenvalues
• On split graphs with four distinct eigenvalues
• Characterization of split graphs with at most four distinct eigenvalues
• The graphs with all but two eigenvalues equal to \(\pm 1\)
• The graphs with all but two eigenvalues equal to \(-2\) or 0
• On the spectrum of an extremal graph with four eigenvalues
• On characterizing certain graphs with four eigenvalues by their spectra
• The non-bipartite graphs with all but two eigenvalues in [–1, 1]
• A note on graphs whose signless Laplacian has three distinct eigenvalues
• Combinatorial Designs
• Integral circulant graphs with four distinct eigenvalues
• The Group Inverse of the Laplacian Matrix of a Graph
• On Graphs with Three or Four Distinct Normalized Laplacian Eigenvalues
• Split non-threshold Laplacian integral graphs

This page was built for publication: On split graphs with three or four distinct (normalized) Laplacian eigenvalues