The graphs with all but two eigenvalues equal to \(-2\) or 0 (Q2364633): Difference between revisions
From MaRDI portal
Changed an Item |
Created claim: DBLP publication ID (P1635): journals/dcc/CioabaHV17, #quickstatements; #temporary_batch_1731475607626 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Graphs cospectral with a friendship graph or its complement / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Spectra of graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The graphs with all but two eigenvalues equal to \(\pm 1\) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4828550 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graphs with many valencies and few eigenvalues / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the spectrum of a complete multipartite graph / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/dcc/CioabaHV17 / rank | |||
Normal rank | |||
Latest revision as of 06:53, 13 November 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The graphs with all but two eigenvalues equal to \(-2\) or 0 |
scientific article |
Statements
The graphs with all but two eigenvalues equal to \(-2\) or 0 (English)
0 references
21 July 2017
0 references
graph spectrum
0 references
spectral characterizations
0 references
adjacency matrix
0 references
