Max-cut and extendability of matchings in distance-regular graphs (Q518196)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Max-cut and extendability of matchings in distance-regular graphs
scientific article

    Statements

    Max-cut and extendability of matchings in distance-regular graphs (English)
    0 references
    0 references
    0 references
    0 references
    28 March 2017
    0 references
    \(t\)-extendable connected graph
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    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