Local antimagic vertex coloring of a Myceilski of graphs

This paper presents an investigation into the fundamental properties associated with the chromatic mean and variance within specific standard graphs, alongside the application of the Mycielski transformation to select graph structures. Furthermore, our study delves into the practical implications of local antimagic vertex coloring, emphasizing its significance in the fields of network security and anomaly detection