Partitioning the Vertices of a Graph into Two Total Dominating Sets (Q5236035)

From MaRDI portal
Revision as of 15:44, 20 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7117152
Language Label Description Also known as
English
Partitioning the Vertices of a Graph into Two Total Dominating Sets
scientific article; zbMATH DE number 7117152

    Statements

    Partitioning the Vertices of a Graph into Two Total Dominating Sets (English)
    0 references
    0 references
    0 references
    0 references
    15 October 2019
    0 references
    total domination
    0 references
    vertex partitions
    0 references
    dominating sets
    0 references
    self-complementary graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers