An upper bound on the domination number of \(n\)-vertex connected cubic graphs (Q1011787)

From MaRDI portal
scientific article
Language Label Description Also known as
English
An upper bound on the domination number of \(n\)-vertex connected cubic graphs
scientific article

    Statements

    An upper bound on the domination number of \(n\)-vertex connected cubic graphs (English)
    0 references
    0 references
    0 references
    9 April 2009
    0 references
    cubic graphs
    0 references
    domination
    0 references
    connected graphs
    0 references

    Identifiers