Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs (Q2828824)

From MaRDI portal
Revision as of 19:17, 12 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
Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs
scientific article

    Statements

    Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs (English)
    0 references
    0 references
    0 references
    26 October 2016
    0 references
    spectral graph theory
    0 references
    eigenvalue
    0 references
    connectivity
    0 references
    toughness
    0 references
    spanning \(k\)-tree
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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