Irregularity Strength of Circulant Graphs Using Algorithmic Approach

This paper deals with decomposition of complete graphs on $n$ vertices into circulant graphs with reduced degree $r . They are denoted as $C_{n}(a_{1}, a_{2}, {\dots }, a_{m})$ , where $a_{1}$ to $a_{m}$ are generators. Mathematical labeling for such bigger (higher order and huge size) and complex (strictly regular with so many triangles) graphs is very difficult. That is why after decomposition, an edge irregular $k$ -labeling for these subgraphs is computed with the help of algorithmic approach. Results of $k$ are computed by implementing this iterative algorithm in computer. Using the values of $k$ , an upper bound for edge irregularity strength is suggested for $C_{n}(a_{1}, a_{2}, {\dots }, a_{m})$ that is ${\vert E\vert }/{2}\log _{2} \vert V\vert $ .