Computation of domination sets in Von Koch curve using C program

The aim of this paper is to calculate the Dominating set in the Famous Fractal Graph Von Koch Curve which is created by Hedge Von Koch. Domination is the most development area in Graph Theory. Its application plays a vital role in our natural lives. Here this paper analyzes the characteristics, construction, properties, nature, implementation, Iteration and uses of the famous Fractal Graph like Von Koch Curve. Here to explain how the Fractal Graph can be constructed and
implemented. It shows that each Iteration of Koch Curve has some constant ratio for implementation of Vertices and Edges in all Iteration. By using Proof of Iterative methods, it evaluates the Dominating Set Cardinality of Von Koch Curve. The calculation of dominating sets shows the common ratio for all the Iteration of Von Koch Curve. Application of this calculation also discussed in our life. Also the algorithm of the calculation of Dominating Set has written using C Programme.