Spectral characterization of the complete graph removing a cycle

Recommendations

Spectral characterization of the complete graph removing a path of small length
Spectral characterizations of almost complete graphs
Per-spectral and adjacency spectral characterizations of a complete graph removing six edges
Spectral characterization of the complete graph removing a path
Spectral characterization of the complete graph removing a path: completing the proof of Cámara-Haemers conjecture

Cites work

A sharp upper bound of the spectral radius of graphs
An introduction to the theory of graph spectra
Characterization of outerplanar graphs whose second largest eigenvalue is at most 1
Discrete hyperbolic geometry
Graphs with three eigenvalues and second largest eigenvalue at most 1
scientific article; zbMATH DE number 3825855 (Why is no real title available?)
scientific article; zbMATH DE number 3394189 (Why is no real title available?)
Interlacing eigenvalues and graphs
On bicyclic graphs whose second largest eigenvalue does not exceed 1
On generalized -graphs whose second largest eigenvalue does not exceed 1
On graphs whose second largest eigenvalue equals 1 -- the star complement technique
On graphs whose second largest eigenvalue is at most 1
On graphs with exactly one eigenvalue less than -1
On graphs with smallest eigenvalue at least \(-3\) and their lattices
On regular graphs and coronas whose second largest eigenvalue does not exceed 1
On the nullity of graphs
On unicyclic graphs whose second largest eigenvalue does not exceed 1
Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey
Reflexive bipartite regular graphs
Reflexive cacti: a survey
Spectra of graphs
Spectral characterization of the complete graph removing a path
Spectral characterization of the complete graph removing a path of small length
Spectral characterization of the complete graph removing a path: completing the proof of Cámara-Haemers conjecture
Spectral characterizations of almost complete graphs
The complement of the path is determined by its spectrum
The second largest eigenvalue of a tree
Which graphs are determined by their spectrum?

Cited in

(7)

On the spectral characterization of graphs with respect to the normalized Laplacian
Determining some graph joins by the signless Laplacian spectrum
Two classes of graphs determined by the signless Laplacian spectrum
Connected triangle-free planar graphs whose second largest eigenvalue is at most 1
Signless Laplacian characterization of cones over disjoint unions of cycles, edges and isolated vertices
On K₄-minor free graphs whose second largest eigenvalue does not exceed 1
Signless Laplacian spectral characterization of structural modifications of complete and complete bipartite graphs

This page was built for publication: Spectral characterization of the complete graph removing a cycle

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6126164)