Spectral characterizations of almost complete graphs
From MaRDI portal
Publication:403557
DOI10.1016/j.dam.2013.08.002zbMath1298.05233arXiv1211.4420OpenAlexW2018398584MaRDI QIDQ403557
Publication date: 29 August 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1211.4420
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (29)
Complete split graph determined by its (signless) Laplacian spectrum ⋮ On the spectral characterizations of graphs ⋮ Graphs with eigenvalue \(-1\) of multiplicity \(2 \theta (G)+ \rho (G) -1\) ⋮ Gaussianization of the spectra of graphs and networks. Theory and applications ⋮ On the spectral characterization of pineapple graphs ⋮ Unnamed Item ⋮ On the spectral characterization of Kite graphs ⋮ Spectral characterization of the complete graph removing a path: completing the proof of Cámara-Haemers conjecture ⋮ On the eigenvalues of eccentricity matrix of graphs ⋮ Unnamed Item ⋮ Spectral characterization of the complete graph removing a cycle ⋮ The signed graphs with all but at most three eigenvalues equal to \(-1\) ⋮ New families of graphs determined by their generalized spectrum ⋮ Spectral characterization of the complete graph removing a path of small length ⋮ \( A_\alpha\)-spectral characterizations of some joins ⋮ Graphs determined by signless Laplacian spectra ⋮ A note on non-\(\mathbb{R}\)-cospectral graphs ⋮ Majorization, degree sequence and \(A_\alpha\)-spectral characterization of graphs ⋮ On the second largest \(A_{\alpha}\)-eigenvalues of graphs ⋮ The signless Laplacian spectral radius of some strongly connected digraphs ⋮ The characterizing properties of (signless) Laplacian permanental polynomials of almost complete graphs ⋮ Unnamed Item ⋮ On the spectral characterization of mixed extensions of \(P_3\) ⋮ The kite graph is determined by its adjacency spectrum ⋮ Spectral characterization of the complete graph removing a path ⋮ The characterization of graphs with eigenvalue -1 of multiplicity n-4 or n-5 ⋮ Aα and Lα-spectral properties of spider graphs ⋮ Per-spectral and adjacency spectral characterizations of a complete graph removing six edges ⋮ The multiplicity of -2 as an eigenvalue of the distance matrix of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Constructing cospectral graphs
- Spectral determination of graphs whose components are paths and cycles
- Cospectral graphs and the generalized adjacency matrix
- The lollipop graph is determined by its spectrum
- Developments on spectral characterizations of graphs
- A note on cospectral graphs
- Which graphs are determined by their spectrum?
- The complement of the path is determined by its spectrum
- On the spectral characterization of T-shape trees
- On the generalized spectral characterization of graphs having an isolated vertex
This page was built for publication: Spectral characterizations of almost complete graphs
