A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs (Q1752600)

From MaRDI portal
Revision as of 21:54, 18 April 2024 by Importer (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs
scientific article

    Statements

    A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs (English)
    0 references
    0 references
    0 references
    24 May 2018
    0 references
    weighted independence number in graphs
    0 references
    independent domination number in graphs
    0 references
    linear complementarity problems
    0 references
    well covered graphs
    0 references
    Lovasz theta
    0 references
    continuous formulations of discrete problems
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references