A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Dominating Sets and Domination Polynomials of Square Of Cycles
2012
IOSR Journal of Mathematics
Preserved Fulltext
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