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

Rija Erveš; Janez Žerovnik

doi:10.3390/sym13101860

ScienceGate Book Chapters

JOURNAL ARTICLE

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

Rija Erveš Janez Žerovnik

Year: 2021 Journal: Symmetry Vol: 13 (10)Pages: 1860-1860 Publisher: Multidisciplinary Digital Publishing Institute

DOI: 10.3390/sym13101860

Get Full-Text PDF Get Analytical Report

Abstract

We obtain new results on 3-rainbow domination numbers of generalized Petersen graphs P(6k,k). 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.

Keywords:

Rainbow Domination analysis Combinatorics Mathematics Cardinality (data modeling) Singleton Discrete mathematics Graph Computer science Physics Biology

Metrics

Cited By

0.64

FWCI (Field Weighted Citation Impact)

Refs

0.72

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

Limits and Structures in Graph Theory

Physical Sciences → Mathematics → Discrete Mathematics and Combinatorics

Complexity and Algorithms in Graphs

Physical Sciences → Computer Science → Computational Theory and Mathematics

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

Abstract

Metrics

Citation History

Topics

Related Documents

On 2-Rainbow Domination Number of Generalized Petersen Graphs P(5k,k)

On 2-Rainbow Domination of Generalized Petersen Graphs P(ck,k)

Total Domination Number of Generalized Petersen Graphs P(ck,k)

Rainbow domination numbers of generalized Petersen graphs

On 2-rainbow domination in generalized Petersen graphs