Mathematica Eterna
Open Access

Abstract

Complementary Acyclic Chromatic Preserving Sets in Graphs

M.Valliammal, S.P.Subbiah and V.Swaminathan

Let G =(V, E) be a simple graph. A subset S of V(G) is called a complementary acyclic chromatic preserving set of G (c-acp set of G) if < V −S > is acyclic and χ(< S >) = χ(G). The minimum cardinality of a c-acp set in G is called the complementary acyclic chromatic preserving number of G and is denoted by c-acpn(G). A c-acp set of G of cardinality c-acpn(G) is called a c-acpn- set of G. A study of chromatic preserving sets has been made in detail in [5]. In this paper, a study of complementary acyclic chromatic preserving sets is initiated.Further chromatic complementary acyclic dominating sets are defined and studied.