Dublin Core The Dublin Core metadata element set is common to all Omeka records, including items, files, and collections. For more information see, http://dublincore.org/documents/dces/. Title A name given to the resource Faculty Publications Article Faculty Publications -Articles Dublin Core The Dublin Core metadata element set is common to all Omeka records, including items, files, and collections. For more information see, http://dublincore.org/documents/dces/. Creator An entity primarily responsible for making the resource Madhumitha, S.; Naduvath, Sudev Title A name given to the resource Rainbow Dominator Coloring of Graphs Date A point or period of time associated with an event in the lifecycle of the resource 01-01-2025 Source A related resource from which the described resource is derived Creative Mathematics and Informatics;Volume;34;Issue;2;pp.317-327 Identifier An unambiguous reference to the resource within a given context <a href="https://doi.org/10.37193/CMI.2025.02.14" target="_blank" rel="noreferrer noopener">https://doi.org/10.37193/CMI.2025.02.14</a> <br /><br /><a href="https://www.scopus.com/pages/publications/105018642505?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/105018642505?origin=resultslist</a> Coverage The spatial or temporal topic of the resource, the spatial applicability of the resource, or the jurisdiction under which the resource is relevant Madhumitha S., DEPARTMENT OF MATHEMATICS, CHRIST UNIVERSITY, BANGALORE, India; Naduvath S., DEPARTMENT OF MATHEMATICS, CHRIST UNIVERSITY, BANGALORE, India Description An account of the resource Coloring and domination in graphs are two well explored areas of research in graph theory. Blending these notions, the dominator coloring of graphs was introduced in the literature; following which several variants of domination related coloring patterns have been defined and studied, based on different types of coloring and domination in graphs. A vertex coloring of a graph that demands the existence of a path in which every internal vertex between two vertices has a unique color is called a rainbow vertex coloring of the graph. In this article, we investigate the rainbow dominator coloring of graphs; a vertex coloring that combines the concepts of rainbow vertex coloring and dominator coloring of graphs. We discuss some properties of the rainbow dominator coloring of graphs and determine the rainbow dominator chromatic number of certain classes of graphs and their complements. 2025, SINUS Association. All rights reserved. Subject The topic of the resource Coloring; domination; dominator coloring; rainbow dominator coloring Publisher An entity responsible for making the resource available SINUS Association Relation A related resource ISSN: 1584286X; Language A language of the resource English Type The nature or genre of the resource Article Rights Information about rights held in and over the resource All Open Access; Bronze Open Access Format The file format, physical medium, or dimensions of the resource online