Bipartite graphs with all but two eigenvalues equal to \(0\) and \(\pm 1\)

Cites Work

Unnamed Item
Unnamed Item
Biregular graphs with three eigenvalues
Two spectral characterizations of regular, bipartite graphs with five eigenvalues
Spectra of graphs
Graphs with three eigenvalues and second largest eigenvalue at most 1
On the two largest \(Q\)-eigenvalues of graphs
Starlike trees are determined by their Laplacian spectrum
On the number of integral graphs
Spectral characterizations of lollipop graphs
Graphs cospectral with starlike trees
Graphs with integral spectrum
Developments on spectral characterizations of graphs
On graphs with exactly one eigenvalue less than -1
Nonregular graphs with three eigenvalues
Graphs with constant \(\mu\) and \(\overline{\mu}\)
Which graphs are determined by their spectrum?
Small regular graphs with four eigenvalues
The complement of the path is determined by its spectrum
Regular graphs with four eigenvalues
On the spectrum of an equitable quotient matrix and its application
Signed graphs with three eigenvalues: biregularity and beyond
Unit gain graphs with two distinct eigenvalues and systems of lines in complex space
Spectra of signed graphs with two eigenvalues
On the spectral characterization of mixed extensions of \(P_3\)
Spectral characterization of mixed extensions of small graphs
On signed graphs with just two distinct adjacency 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 spectral characterization of T-shape trees
The spectral characterization of graphs of index less than 2 with no path as a component
Spectral determinations and eccentricity matrix of graphs
On Graphs with Three or Four Distinct Normalized Laplacian Eigenvalues
Signed graphs with at most three eigenvalues
GRAPHS WITH A SMALL NUMBER OF DISTINCT EIGENVALUES

This page was built for publication: Bipartite graphs with all but two eigenvalues equal to \(0\) and \(\pm 1\)