On Total Vertex Irregularity Strength of Hexagonal Cluster Graphs

Algorithm 4

Algorithm for labeling all other edges in HC(4).

	Step A. Label all edges of the outer cycle in by using Algorithm 2, i.e., where i.e., (see Figure 9) and all edges of the outer cycle in by (see Figure 10)
	Step B. Label all of the remaining edges from by using Algorithm 2, i.e., (see Figure 11)
	Step C. Label all of the remaining edges in by (see Figure 12)