The graphs with all but two eigenvalues equal to \(\pm 1\) (Q2346766)

From MaRDI portal
Revision as of 04:58, 10 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The graphs with all but two eigenvalues equal to \(\pm 1\)
scientific article

    Statements

    The graphs with all but two eigenvalues equal to \(\pm 1\) (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 June 2015
    0 references
    0 references
    adjacency matrix
    0 references
    friendship graph
    0 references
    spectral characterization
    0 references
    0 references
    0 references