Cloning of a vertex and an edge of flower graphs with Super unisum labeling

Abstract

In this paper, a new method of labeling of graphs named as Super Unisum labeling is introduced to number the vertices and edges of graphs. Flower graphs F_n, with n ≥ 4 are being applied with the technique of Cloning of single vertex are constructed and these graphs are labeled with Super Unisum labeling. Also, Super Unisum labeling is implemented to Flower graph F_n,with n ≥ 4 where Cloning of an edge is done holding the condition that n must be always even.