The Roman \(\{2 \}\)-domatic number of graphs (Q1732117): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2018.11.027 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2904463651 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal Problems for Roman Domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Roman \(\{2 \}\)-domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Roman domination in graphs. / 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: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Complementary Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defendens Imperium Romanum: A Classical Problem in Military Strategy / rank
 
Normal rank
Property / cites work
 
Property / cites work: The roman domatic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2914509 / rank
 
Normal rank

Latest revision as of 21:43, 18 July 2024

scientific article
Language Label Description Also known as
English
The Roman \(\{2 \}\)-domatic number of graphs
scientific article

    Statements

    The Roman \(\{2 \}\)-domatic number of graphs (English)
    0 references
    0 references
    22 March 2019
    0 references
    0 references
    domination
    0 references
    Roman \(\{2 \}\)-domination
    0 references
    Roman \(\{2 \}\)-domatic number
    0 references
    0 references