• A.MUTHUKAMATCHI

Let G be a connected graph. An acyclic graphoidal cover of G is a collection ψ if non-trivial in G such that every edge of G is in exactly one path in ψ and every vertex of G is an internal vertex of at most path in ψ. Let ψ be a acyclic graphoidal cover of G. Let u,v ∈ V(G). The vertices u and v are said to be ψ adjacent if there exists a u-v path P in ψ. A subset D of V is called a ψ-dominating set of G if for every vertex v ∈ V-D, there exists a vertex u in D such that u and v are ψ - adjacent. The minimum cardinality of a minimal ψ-dominating set is called the ψ-domination number of G and is denoted by γψ(G). In this paper we obtain several results on this parameter.

Acyclic graphoidal cover, domination number, ψ-domination number, upper ψ-domination number

"Ψ- DOMINATION NUMBER OF A GRAPH", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 5, page no.124-126, May-2019, Available :http://www.jetir.org/papers/JETIR1905P20.pdf

"Ψ- DOMINATION NUMBER OF A GRAPH", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 5, page no. pp124-126, May-2019, Available at : http://www.jetir.org/papers/JETIR1905P20.pdf