Rainbow domination regular graphs that are not vertex transitive
From MaRDI portal
Publication:6130222
DOI10.1016/j.dam.2024.02.013OpenAlexW4391938683MaRDI QIDQ6130222
Publication date: 2 April 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2024.02.013
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On \(k\)-rainbow domination in regular graphs
- Rainbow domination in graphs
- Wide-diameter of Product Graphs
- Paired-domination of Cartesian products of graphs and rainbow domination
- A theorem on tait colorings with an application to the generalized Petersen graphs
- Self-dual configurations and regular graphs
This page was built for publication: Rainbow domination regular graphs that are not vertex transitive