Irregularity Strength of Circulant Graphs Using Algorithmic Approach Article Swipe

MAKE IMPACT

Muhammad Ahsan Asim , Roslan Hasni , Ali Ahmad , Basem Assiri , Andrea Semaničová–Feňovčíková · YOU? · · 2021 · Open Access · · DOI: https://doi.org/10.1109/access.2021.3058786

This paper deals with decomposition of complete graphs on vertices into circulant graphs with reduced degree . They are denoted as , where to 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 -labeling for these subgraphs is computed with the help of algorithmic approach. Results of are computed by implementing this iterative algorithm in computer. Using the values of , an upper bound for edge irregularity strength is suggested for that is .

Type

article

Language

en

Landing Page

https://doi.org/10.1109/access.2021.3058786

PDF

https://ieeexplore.ieee.org/ielx7/6287639/9312710/09352734.pdf

OA Status

gold

Cited By

3

References

22

Related Works

10

OpenAlex ID

https://openalex.org/W3133142976

Raw OpenAlex JSON