IJPAM: Volume 86, No. 6 (2013)

CHROMATIC COMPLEMENTARY ACYCLIC
DOMINATION IN GRAPHS

M. Valliammal$^1$, S.P. Subbiah$^2$, V. Swaminathan$^3$
$^1$Department of Mathematics
N.M.S. Sermathai Vasan College for Women
Madurai, 12, INDIA
$^2$Department of Mathematics
M.T.N. College
Madurai, 04, INDIA
$^3$Ramanujan Research Centre
Saraswathi Narayanan College
Madurai, 22, INDIA


Abstract. Let G =$(V,E)$ 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 $< V-D>$ 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 $\chi( <D>)= \chi(G)$.The minimum cardinality of a chromatic c-a dominating set of G is denoted by $\gamma_{c-a}^\chi (G)$ 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.

Received: May 9, 2013

AMS Subject Classification: 05C35

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

Download paper from here.


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