Total Face Irregularity Strength of Certain Graphs
Algorithm 3
Total face irregularity strength of -necklace graph.
Input:-necklace graph, ,.
Algorithm:
Step 1: Label the vertices and edges of the cycles ,, beginning with the minimum label such that is the minimum weight of the and the weights of each of these faces varies from to .
Step 2: Label the unlabeled edges of the path with as shown in Figure 3.
