The sun flower graph Sfn is the resultant graph obtained from the flower graph of wheels W1, n by adding n pendant edges to the central vertex. The vertex set of sun flower graph is defined as follows: wheel graph is the graph on n+1 vertices constructed by connecting a single vertex to every vertex in an n cycle. By attaching a pendant edge at each vertex of the n – cycle in wheel graph, we get a helm graph with (2n+1) vertices and 3n edges. By joining each pendant vertex to the central vertex of the helm graph, we get a flower graph with (2n+1) vertices and 4n edges. By adding n pendant edges to the central vertex of the flower graph, we get a sunflower graph with p = (3n+1) vertices and q = 5n edges. It is also defined as, V(n, p, q).