Mostrando 2 resultados de: 2
On inclusive distance vertex irregular labelings
ArticleAbstract: For a simple graph G, a vertex labeling f: V (G) → (1; 2....,k) is called a k-labeling. The weight oPalabras claves:Inclusive distance vertex irregular labeling, Inclusive distance vertex irregularity strengthAutores:Martin Bača, Semaničova-Fenovciková A., Slamin, Sugeng K.A.Fuentes:scopusModular irregularity strength on some flower graphs
ArticleAbstract: Let G = (V (G),E(G)) be a graph with the nonempty vertex set V (G) and the edge set E(G). Let Zn bePalabras claves:daisy graphs, modular irregular labeling, modular irregularity strength, rose graphs, sunflower graphsAutores:Anwar L.F., John P., Lawrence M.L., Martin Bača, Semaničova-Fenovciková A., Sugeng K.A.Fuentes:scopus