Research Article

On Total Vertex Irregularity Strength of Hexagonal Cluster Graphs

Algorithm 2

Algorithm for labeling all other edges in HC(n).
  K2t−1=(S2t−1+2−K2t−2)/3, Step A. Label all of edges of the outer cycle in for by where
Step B. Label all of the remaining edges from for by
Step C. Label all of the remaining edges in by