# IJPAM: Volume 86, No. 6 (2013)

CHROMATIC COMPLEMENTARY ACYCLIC
DOMINATION IN GRAPHS

M. Valliammal, S.P. Subbiah, V. Swaminathan
Department of Mathematics
N.M.S. Sermathai Vasan College for Women
Department of Mathematics
M.T.N. College
Ramanujan Research Centre
Saraswathi Narayanan College

Abstract. Let G = be a simple graph. A subset D of V(G) is called a complementary acyclic dominating set (c-a dominating set) of G if D is a dominating set and is acyclic. D is called a chromatic complementary acyclic dominating set (chromatic c-a dominating set) of G if D is a c-a dominating set and .The minimum cardinality of a chromatic c-a dominating set of G is denoted by and is called chromatic c-a domination number of G.A study of chromatic c-a dominating sets has been made in detail in [5]. In this paper, a study of chromatic c-a dominating sets is initiated.

AMS Subject Classification: 05C35

Key Words and Phrases: complementary acyclic dominating set, chromatic c-a dominating set, chromatic c-a domination number

DOI: 10.12732/ijpam.v86i6.10 How to cite this paper?
Source:
International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395
Year: 2013
Volume: 86
Issue: 6