On the Roman {2}-domatic number of graphs (Q5025122): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Roman \(\{2 \}\)-domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a theory of domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Roman domination in graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Italian domination in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Italian domination on Mycielskian and Sierpinski graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Roman \(\{2 \}\)-domatic number of graphs / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s179383092150052x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3097958908 / rank
 
Normal rank

Latest revision as of 08:31, 30 July 2024

scientific article; zbMATH DE number 7467902
Language Label Description Also known as
English
On the Roman {2}-domatic number of graphs
scientific article; zbMATH DE number 7467902

    Statements

    On the Roman {2}-domatic number of graphs (English)
    0 references
    1 February 2022
    0 references
    Roman \(\{2\}\)-dominating
    0 references
    Roman \(\{2\}\)-domatic number
    0 references

    Identifiers