On the roman domination in the lexicographic product of graphs (Q442220): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Dominating direct products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal Problems for Roman Domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total 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: Roman domination in regular graphs / 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: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of selected recent results on total domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4523707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for the domination number and the total domination number of direct product graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Associative graph products and their independence, domination and coloring numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unique response Roman domination in graphs / rank
 
Normal rank

Revision as of 12:44, 5 July 2024

scientific article
Language Label Description Also known as
English
On the roman domination in the lexicographic product of graphs
scientific article

    Statements

    Identifiers