On Total Vertex Irregularity Strength of Hexagonal Cluster Graphs

Algorithm 3

Algorithm for labeling all edges of the outer cycle of L1 of HC(4).

	Step 1. For where , label , , and with where and are edges incident to vertex (see Figure 6)
	Step 2. For where , label edges between and by except for the labeling edges in Step 1
	Step 3. Label all edges between and by except for the labeling edges in Step 1 (see Figure 7)
	Step 4. Label the remaining edges of by 13 (see Figure 8)