An improved upper bound on the double Roman domination number of graphs with minimum degree at least two (Q2334052): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q127529762, #quickstatements; #temporary_batch_1722035971323
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2019.06.018 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2958098820 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the double Roman domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound on the double Roman domination number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Double Roman domination / 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: Double Roman domination and domatic numbers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Double Roman domination in trees / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127529762 / rank
 
Normal rank

Revision as of 00:25, 27 July 2024

scientific article
Language Label Description Also known as
English
An improved upper bound on the double Roman domination number of graphs with minimum degree at least two
scientific article

    Statements

    An improved upper bound on the double Roman domination number of graphs with minimum degree at least two (English)
    0 references
    0 references
    0 references
    0 references
    6 November 2019
    0 references
    double Roman domination number
    0 references
    Roman domination
    0 references
    domination
    0 references

    Identifiers