On the rainbow domination subdivision numbers in graphs
From MaRDI portal
Publication:2806100
DOI10.1142/S1793557116500182zbMATH Open1335.05129MaRDI QIDQ2806100FDOQ2806100
Authors: M. Falahat, N. Dehgardi, Seyed Mahmood Sheikholeslami, Abdollah Khodkar
Publication date: 13 May 2016
Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)
Cites Work
Cited In (10)
- Trees with equal total domination and 2-rainbow domination numbers
- On the outer independent 2-rainbow domination number of Cartesian products of paths and cycles
- New bounds on the rainbow domination subdivision number
- Total \(k\)-rainbow domination subdivision number in graphs
- Rainbow Turán number of clique subdivisions
- Title not available (Why is that?)
- Rainbow game domination subdivision number of a graph
- Title not available (Why is that?)
- Rainbow domination in graphs
- On two open problems concerning weak Roman domination in trees
This page was built for publication: On the rainbow domination subdivision numbers in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2806100)