IEEE Access • Vol 9
Irregularity Strength of Circulant Graphs Using Algorithmic Approach
January 2021 • Muhammad Ahsan Asim, Roslan Hasni, Ali Ahmad, Basem Assiri, Andrea Semaničová–Feňovčíková
This paper deals with decomposition of complete graphs on <inline-formula> <tex-math notation="LaTeX">$n$ </tex-math></inline-formula> vertices into circulant graphs with reduced degree <inline-formula> <tex-math notation="LaTeX">$r< n-1$ </tex-math></inline-formula>. They are denoted as <inline-formula> <tex-math notation="LaTeX">$C_{n}(a_{1}, a_{2}, {\dots }, a_{m})$ </tex-math></inline-formula>, where <inline-formula> <tex-math notation="LaTeX">$a_{1}$ </tex-math></inline-formula> to <inline-formula> <tex-ma…