Modular irregularity strength on some flower graphs

Article

Abstract: Let G = (V (G),E(G)) be a graph with the nonempty vertex set V (G) and the edge set E(G). Let Zn be

Palabras claves:

daisy graphs, modular irregular labeling, modular irregularity strength, rose graphs, sunflower graphs

Autores:

Anwar L.F., John P., Lawrence M.L., Martin Bača, Semaničova-Fenovciková A., Sugeng K.A.

Fuentes:

scopus