Upper bounds on the \(k\)-tuple (Roman) domination number of a graph (Q2657089): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Double Roman domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Roman domination in graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total Domination in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: ROMAN k-DOMINATION IN GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4108373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5133062 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some progress on the double Roman domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds on the \(k\)-domination number and the \(k\)-tuple domination number / rank
 
Normal rank

Latest revision as of 19:00, 24 July 2024

scientific article
Language Label Description Also known as
English
Upper bounds on the \(k\)-tuple (Roman) domination number of a graph
scientific article

    Statements

    Upper bounds on the \(k\)-tuple (Roman) domination number of a graph (English)
    0 references
    0 references
    0 references
    17 March 2021
    0 references
    \(k\)-tuple domination
    0 references
    Roman domination
    0 references
    vertex cover
    0 references
    Brooks' theorem
    0 references

    Identifiers