Color Class Dominating Sets on Regular Graphs of Degree 5

International Journal for Research in Applied Science and Engineering Technology 2026 Open access

Read full text
Authors: A. Vijayalekshmi, S. G. Vidhya
DOI: 10.22214/ijraset.2026.76855
Cited by: 0

Abstract

in ऍ is dominated by a vertex in G. A color class dominating set is said to be minimal color class dominating set if no proper subset of ऍ is a color class dominating set of G. The color class domination number of G is the minimum cardinality taken over all minimal color class dominating sets of G and is denoted by ࢽ (ࡳ(. Here we also obtain ࢽ (ࡳ (of regular graph degree 5.

Fields of Study & Subjects

Advanced Graph Theory Research Graph Labeling and Dimension Problems Complexity and Algorithms in Graphs

Publication details

Journal / source
International Journal for Research in Applied Science and Engineering Technology
Volume
14
Issue
1
Pages
444–446
Publication date
11 January 2026