The domination complexity and related extremal values of large 3D torus (Q1791110)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The domination complexity and related extremal values of large 3D torus
scientific article

    Statements

    The domination complexity and related extremal values of large 3D torus (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 October 2018
    0 references
    Summary: Domination is a structural complexity of chemical molecular graphs. A dominating set in a (molecular) graph \(G = \left(V, E\right)\) is a subset \(S \subseteq V\) such that each vertex in \(V \backslash S\) is adjacent to at least one vertex in \(S\). The domination number \(\gamma \left(G\right)\) of a graph \(G\) is the minimum size of a dominating set in \(G\). In this paper, computer-aided approaches for obtaining bounds for domination number on torus graphs are here considered, and many new exact values and bounds are obtained.
    0 references
    structural complexity
    0 references
    domination complexity
    0 references
    chemical molecular graphs
    0 references
    torus graphs
    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