Exploring Dominator Coloring In Splitting Graphs of Specific Types of Graphs

View at publisher Summarise with VIRAT
Authors: S. Seethaladevi, G. Jayaraman
Cited by: 0

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

Every vertex in a graph G has its own color class or dominates every vertex of at least one color class, this is known as dominator coloring. χ d ( G ) is symbolized by the least color needed for a dominator coloring of G is the dominator chromatic number. These studies explored relation between domination and graph coloring. This study aims to discuss the dominator chromatic no., of splitting graphs - path, complete graph, star graph, ladder rung graph, banana tree and n-sunlet graph, Comb graph, twig graph, Complete bipartite graph, bistar graph, pan graph.

Fields of Study & Subjects

Advanced Graph Theory Research Graph Labeling and Dimension Problems Graph theory and applications

Publication details

Journal / source
CRC Press eBooks
Pages
416–420
Publication date
31 March 2026
Language
EN
Document type
Book chapter