Properties of double Roman domination on cardinal products of graphs (Q4993967): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5206338 / 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: Roman Domination in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Varieties of Roman domination II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Roman domination in graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Roman domination number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4505117 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4937425 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results for Roman domination number on Cardinal product of paths and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Roman domination number on cardinal product of paths and cycles / rank
 
Normal rank

Revision as of 22:46, 25 July 2024

scientific article; zbMATH DE number 7357772
Language Label Description Also known as
English
Properties of double Roman domination on cardinal products of graphs
scientific article; zbMATH DE number 7357772

    Statements

    Properties of double Roman domination on cardinal products of graphs (English)
    0 references
    0 references
    0 references
    11 June 2021
    0 references
    Roman domination
    0 references
    double Roman domination
    0 references
    cardinal products of graphs
    0 references
    paths
    0 references
    cycles
    0 references

    Identifiers