Total Face Irregularity Strength of Certain Graphs
Algorithm 2
Total face irregularity strength of -necklace graph.
Input:-necklace graph, ,.
Algorithm:
Step 1: Assign labels to the vertices and the edges of the inner cycle with label such that is the weight of the inner face.
Step 2: Begin labeling the unlabeled vertices and edges of ,, as follows:(i) Since one vertex of is identified with the vertex of , it is already labeled with label .(ii) The remaining unlabeled vertices and edges in each outer cycles , receive labels in such a way that the hamming distance . Thus the weight of each of the outer faces varies from to as shown in Figure 2.
