Modular edge irregularity strength of graphs

Article

Abstract: For a simple graph G = (V, E) with the vertex set V(G) and the edge set E(G), a vertex labeling ϕ: V

Palabras claves:

(modular) edge irregularity strength, (modular) irregular labeling, (modular) irregularity strength, caterpillar, Cycle, friendship graph, n-sun

Autores:

Ahmad A., Koam A.N.A., Martin Bača, Semaničova-Fenovciková A.

Fuentes:

scopus