Dominating Sets and Domination Polynomials of Square Of Cycles

A. Vijayan A. Vijayan
2012 IOSR Journal of Mathematics  
Let G = (V, E) be a simple graph. A set S  V is a dominating set of G, if every vertex in V-S is adjacent to atleast one vertex in S. Let 2 n C be the square of the Cycle n C and let 2 2 n C and obtain some properties of this polynomial.
doi:10.9790/5728-0340414 fatcat:4db3zvw5izd3dactj77x6wpcem