Strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers in trees (Q726513): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the total \(\{ k\} \)-domination and total \(\{ k\} \)-domatic number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signed \(k\)-domatic numbers of digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the 2-rainbow domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5278809 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(k\)-rainbow bondage number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds on the rainbow domination subdivision number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong equality of domination parameters in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2725015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired-domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The k-rainbow domatic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of graphs with equal domination number and vertex cover number / rank
 
Normal rank
Property / cites work
 
Property / cites work: A labeling algorithm for distance domination on block graphs / rank
 
Normal rank

Revision as of 06:48, 12 July 2024

scientific article
Language Label Description Also known as
English
Strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers in trees
scientific article

    Statements

    Identifiers