Pages that link to "Item:Q4635026"
From MaRDI portal
The following pages link to Total $k$-Rainbow domination numbers in graphs (Q4635026):
Displaying 26 items.
- On the rainbow domination number of digraphs (Q343745) (← links)
- The \(k\)-rainbow bondage number of a graph (Q400538) (← links)
- \(k\)-rainbow domatic numbers (Q423920) (← links)
- The \(k\)-rainbow reinforcement numbers in graphs (Q516871) (← links)
- A sharp upper bound on the independent 2-rainbow domination in graphs with minimum degree at least two (Q821316) (← links)
- On total rainbow \(k\)-connected graphs (Q1739988) (← links)
- Graphs with large total 2-rainbow domination number (Q1787767) (← links)
- Bounding the \(k\)-rainbow total domination number (Q2032845) (← links)
- Total domination in generalized prisms and a new domination invariant (Q2042628) (← links)
- Total 2-rainbow domination numbers of trees (Q2227097) (← links)
- The \(k\)-rainbow domatic number of a graph (Q2906372) (← links)
- Rainbow Domination in Graphs (Q3384615) (← links)
- On the outer independent 2-rainbow domination number of Cartesian products of paths and cycles (Q4957573) (← links)
- Total Roman domination in digraphs (Q4986528) (← links)
- Further results on maximal rainbow domination number (Q4997220) (← links)
- (Q5021092) (← links)
- Trees with total Roman domination number equal to Roman domination number plus its domination number: complexity and structural properties (Q5074890) (← links)
- (Q5278809) (← links)
- Total k-rainbow reinforcement number in graphs (Q5859516) (← links)
- Restrained k-rainbow reinforcement number in graphs (Q5876873) (← links)
- Algorithmic aspects of certified domination in graphs (Q6101494) (← links)
- (Q6155871) (← links)
- (Q6159875) (← links)
- Total 2-rainbow domination in graphs: complexity and algorithms (Q6629672) (← links)
- The \(l\)-distance \(k\)-rainbow domination numbers of graphs (Q6650431) (← links)
- Independent <i>k</i> -rainbow bondage number of graphs (Q6651170) (← links)
