Graphs with large total 2-rainbow domination number
From MaRDI portal
(Redirected from Publication:1787767)
Recommendations
Cites work
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- scientific article; zbMATH DE number 6749240 (Why is no real title available?)
- 2-rainbow domination in generalized petersen graphs \(P(n,3)\)
- 2-rainbow domination of generalized Petersen graphs P(n,2)
- Bounds on the 2-rainbow domination number of graphs
- New bounds on the rainbow domination subdivision number
- Nordhaus-Gaddum bounds on the \(k\)-rainbow domatic number of a graph
- Note on 2-rainbow domination and Roman domination in graphs
- On 2-rainbow domination and roman domination in graphs
- On the 2-rainbow domination in graphs
- Rainbow domination in graphs
- Rainbow domination on trees
- Roman domination on strongly chordal graphs
- The \(k\)-rainbow domatic number of a graph
- Total \(k\)-rainbow domination numbers in graphs
- Total domination in graphs
- Total roman domination in graphs
Cited in
(9)- scientific article; zbMATH DE number 6929515 (Why is no real title available?)
- Trees with equal total domination and 2-rainbow domination numbers
- Total 2-rainbow domination numbers of trees
- Total k-rainbow reinforcement number in graphs
- A new upper bound on the independent 2-rainbow domination number in trees
- Outer-independent total 2-rainbow dominating functions in graphs
- A note on total domination and 2-rainbow domination in graphs
- Total 2-rainbow domination in graphs: complexity and algorithms
- Further results on maximal rainbow domination number
This page was built for publication: Graphs with large total 2-rainbow domination number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1787767)