Volume : IV, Issue : IV, April - 2014

Domination of Complement of A Splitted Graphs

A. Nellai Murugan, A. Esakkimuthu

Abstract :

 Let G be ( p,q)  graph. A set D of vertices in a complement of any splitted graph =(V,E) is called a dominating set if every vertex in V–D is adjacent to some vertex in D. The domination number γ[  ] of is minimum cardinality of a domination set of

  [SG]C

Keywords :

Article: Download PDF   DOI : 10.36106/ijar  

Cite This Article:

A.NELLAI MURUGAN, A.ESAKKIMUTHU Domination of Complement of A Splitted Graphs Indian Journal of Applied Research, Vol.IV, Issue. IV

Number of Downloads : 1270

References :