Rainbow Dominator Coloring of Some Cycle Related Graphs

Title

Rainbow Dominator Coloring of Some Cycle Related Graphs

Creator

Madhumitha, S.; Naduvath, Sudev

Description

The concept of dominator coloring of graphs emerged as a combination of the two prominent structural aspects of graphs, namely coloring and domination in graphs. The vertex coloring that demands the existence of a rainbow path between any two vertices of a graph; that is, a path in which every internal vertex has a unique color, is called a rainbow vertex coloring of a graph. Melding the concepts of rainbow vertex coloring and dominator coloring of graphs, the rainbow dominator coloring of graphs has been studied, in the literature. In this article, we investigate the rainbow dominator coloring of some cycle related graphs, and their complements. 2025, SINUS Association. All rights reserved.

Source

Creative Mathematics and Informatics;Volume;34;Issue;3;pp.353-363

Date

01-01-2025

Publisher

SINUS Association

Subject

Coloring; domination; dominator coloring; rainbow dominator coloring

Coverage

Madhumitha S., DEPARTMENT OF MATHEMATICS, CHRIST UNIVERSITY, BANGALORE, India; Naduvath S., DEPARTMENT OF MATHEMATICS, CHRIST UNIVERSITY, BANGALORE, India

Rights

All Open Access; Bronze Open Access

Relation

ISSN: 1584286X;

Format

online

Language

English

Type

Article

Identifier

https://doi.org/10.37193/CMI.2025.03.03

https://www.scopus.com/pages/publications/105018724774?origin=resultslist