Irregularity Strength of Circulant Graphs Using Algorithmic Approach

Irregularity Strength of Circulant Graphs Using Algorithmic Approach

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&lt; n-1...

Full description

Bibliographic Details
Main Authors: Muhammad Ahsan Asim, Roslan Hasni, Ali Ahmad, Basem Assiri, Andrea Semanicova-Fenovcikova
Format: Article
Language:English
Published: IEEE 2021-01-01
Series:IEEE Access
Subjects:
Edge irregular labeling
circulant graph
graph algorithm
computational complexity
Sidon sequence
Online Access:https://ieeexplore.ieee.org/document/9352734/

Internet

https://ieeexplore.ieee.org/document/9352734/

Similar Items