Rainbow edge domination numbers in graphs
From MaRDI portal
Publication:5243691
DOI10.1142/S1793557120500047zbMath1427.05154OpenAlexW2883389327MaRDI QIDQ5243691
Hadi Jahani, Nader Jafari Rad, Hossein Abdollahzadeh Ahangar
Publication date: 19 November 2019
Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793557120500047
rainbow domination numberrainbow dominating functionrainbow edge dominating functionrainbow edge domination number
Related Items (2)
Further results on maximal rainbow domination number ⋮ Total k-rainbow reinforcement number in graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Signed mixed Roman domination numbers in graphs
- Bounds on the 2-rainbow domination number of graphs
- Nordhaus-Gaddum bounds on the \(k\)-rainbow domatic number of a graph
- Rainbow domination in graphs
- 2-rainbow domination in generalized petersen graphs \(P(n,3)\)
- Rainbow domination on trees
- 2-rainbow domination of generalized Petersen graphs \(P(n,2)\)
- Line domination in graphs
- Contamination of a well in a uniform background flow
- Edge domination in graphs
- Mixed Roman domination in graphs
- The Boltzmann equation for dissipative disparate mixtures
- On the 2-rainbow domination in graphs
- A note on the edge Roman domination in trees
- Irreversibility in Heisenberg Spin Systems. II. Approximate Solution of the High-Temperature Kinetic Equations
This page was built for publication: Rainbow edge domination numbers in graphs