Graphs with at most three distance eigenvalues different from \(-1\) and \(-2\) (Q1637095)

From MaRDI portal
Revision as of 19:52, 15 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
Graphs with at most three distance eigenvalues different from \(-1\) and \(-2\)
scientific article

    Statements

    Graphs with at most three distance eigenvalues different from \(-1\) and \(-2\) (English)
    0 references
    0 references
    0 references
    0 references
    7 June 2018
    0 references
    distance matrix
    0 references
    third largest distance eigenvalue
    0 references
    second least distance eigenvalue
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references