The connectivity of strongly regular graphs (Q1085180)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The connectivity of strongly regular graphs
scientific article

    Statements

    The connectivity of strongly regular graphs (English)
    0 references
    1985
    0 references
    Es wird bewiesen, daß in einem streng regulären Graphen jede kleinste trennende Eckenmenge aus den Nachbarn einer Ecke bestehen muß.
    0 references
    0 references
    0 references
    connectivity
    0 references
    strongly regular graph
    0 references
    smallest cutset
    0 references
    neighbourhood of a vertex
    0 references
    0 references
    0 references
    0 references