On 3-Rainbow Domination Number of Generalized Petersen Graphs <i>P</i>(6<i>k</i>,<i>k</i>)

We obtain new results on 3-rainbow domination numbers of generalized Petersen graphs <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>P</mi><mo>(</mo><mn>6</mn><mi...

Full description

Bibliographic Details
Main Authors: Rija Erveš, Janez Žerovnik
Format: Article
Language:English
Published: MDPI AG 2021-10-01
Series:Symmetry
Subjects:
Online Access:https://www.mdpi.com/2073-8994/13/10/1860
Description
Summary:We obtain new results on 3-rainbow domination numbers of generalized Petersen graphs <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>P</mi><mo>(</mo><mn>6</mn><mi>k</mi><mo>,</mo><mi>k</mi><mo>)</mo></mrow></semantics></math></inline-formula>. In some cases, for some infinite families, exact values are established; in all other cases, the lower and upper bounds with small gaps are given. We also define singleton rainbow domination, where the sets assigned have a cardinality of, at most, one, and provide analogous results for this special case of rainbow domination.
ISSN:2073-8994