The graphs with all but two eigenvalues equal to \(-2\) or 0 (Q2364633): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
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

Latest revision as of 04:49, 14 July 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
    0 references
    0 references
    0 references
    21 July 2017
    0 references
    0 references
    graph spectrum
    0 references
    spectral characterizations
    0 references
    adjacency matrix
    0 references
    0 references
    0 references
    0 references