Minus domination number in \(k\)-partite graphs. (Q1426125): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The algorithmic complexity of minus domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minus domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4374702 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strict majority functions on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inequalities relating domination parameters in cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552219 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the minus domination and \(k\)-subdomination numbers. / rank
 
Normal rank

Latest revision as of 15:48, 6 June 2024

scientific article
Language Label Description Also known as
English
Minus domination number in \(k\)-partite graphs.
scientific article

    Statements

    Minus domination number in \(k\)-partite graphs. (English)
    0 references
    0 references
    0 references
    0 references
    14 March 2004
    0 references
    0 references
    Domination
    0 references
    Minus domination
    0 references
    \(k\)-partite graph
    0 references
    0 references