On the reflexive edge irregularity strength in barycentric subdivision of circulant networks
Abstract
Among the various ideas in graph theory, labelling of graphs has diverse applications in cryptography, coding theory, data security, telecommunication networks, etc. Labeling of a graph is any mapping that, under specific circumstances, converts a given collection of graph components to a given set of numbers. In this paper, we determine the exact value of reflexive edge irregularity strength of the barycentric subdivision of circulant graphs \r\n.
Author
Nashwan Adnan OTHMAN
ISSN
Publish Date: 4-May-2026