On upper bounds for multiple domination numbers of graphs (Q2444571): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Transversal numbers of uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating a Family of Graphs with Small Connected Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The upper bound on \(k\)-tuple domination numbers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-domination and \(k\)-independence in graphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3691778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalised upper bound for the \(k\)-tuple domination number / 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: Q4552196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-tuple total domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the ratio of optimal integral and fractional covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: False alarms in fault-tolerant dominating sets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4108373 / 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
Property / cites work
 
Property / cites work: Liar's domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Liar's domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of a conjecture on \(k\)-tuple domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(k\)-tuple domination number revisited / rank
 
Normal rank

Latest revision as of 14:06, 7 July 2024

scientific article
Language Label Description Also known as
English
On upper bounds for multiple domination numbers of graphs
scientific article

    Statements

    On upper bounds for multiple domination numbers of graphs (English)
    0 references
    0 references
    10 April 2014
    0 references
    dominating set
    0 references
    \(k\)-dominating set
    0 references
    \(k\)-tuple dominating set
    0 references
    \(k\)-tuple total dominating set
    0 references
    domination number
    0 references
    \(k\)-domination number
    0 references
    \(k\)-tuple domination number
    0 references
    \(k\)-tuple total domination number
    0 references
    liar's dominating set
    0 references

    Identifiers