Graphs that are simultaneously efficient open domination and efficient closed domination graphs (Q516892)

From MaRDI portal
Revision as of 23:37, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Graphs that are simultaneously efficient open domination and efficient closed domination graphs
scientific article

    Statements

    Graphs that are simultaneously efficient open domination and efficient closed domination graphs (English)
    0 references
    0 references
    0 references
    0 references
    15 March 2017
    0 references
    efficient open domination
    0 references
    efficient closed domination
    0 references
    perfect code
    0 references
    computational complexity
    0 references
    Sierpiński graph
    0 references

    Identifiers