Local inclusive distance vertex irregular graphs

Article

Abstract: Let G = (V, E) be a simple graph. A vertex labeling f: V(G) → {1, 2, …, k} is defined to be a local

Palabras claves:

(inclusive) distance vertex irregular labeling, Local (inclusive) distance vertex irregular labeling

Autores:

Martin Bača, Semaničova-Fenovciková A., Silaban D.R., Sugeng K.A.

Fuentes:

scopus