Generalized 3-rainbow domination in graphs and honeycomb system (HC(n))

MaRDI QIDQ6561532zbMATH OpenFDO

Authors G. H. Shirdel, Mahmood Ghanbari, Maziar Ramezani

Publication date 25 June 2024

Published in Utilitas Mathematica (Search for Journal in Brave)

zbMATH Keywords

dominating setgeneralized rainbow domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structure, classification theorems for modules and ideals in commutative rings (13C05) Module categories and commutative rings (13C60)

Review text

A variant of the rainbow domination concept in graphs is introduced. A function that assigns a subset of \(\{1,2,3\}\) to each vertex of the graph is called generalized 3-rainbow dominating if \(\bigcup_{u\in N[v]} f(u)=\{1,2,3\}\) for all vertices \(v\), where \(N[v]\) is the closed neighbourhood of the vertex \(v\). The exact value of the generalized 3-rainbow domination number is determined for some graph classes (complete graphs, stars, paths, cycles, one specific class of trees, and the class of honeycomb structures) and upper bounds are given for generalized Petersen graphs \(\mathrm{GP}(n,2)\) and \(\mathrm{GP}(n,3)\). The proofs are short and trivial.

Recommendations

• On rainbow domination numbers of graphs
• scientific article; zbMATH DE number 7227817
• Bounds on the 3-rainbow domination
• scientific article; zbMATH DE number 6107250
• A characterization of graphs with global 3-rainbow domination number equal to the number of vertices

Cites work

• On the 2-rainbow domination in graphs

This page was built for publication: Generalized 3-rainbow domination in graphs and honeycomb system \((\mathrm{HC}(n))\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6561532)