On inclusive distance vertex irregular labelings

Article

Abstract: For a simple graph G, a vertex labeling f: V (G) → (1; 2....,k) is called a k-labeling. The weight o

Palabras claves:

Inclusive distance vertex irregular labeling, Inclusive distance vertex irregularity strength

Autores:

Martin Bača, Semaničova-Fenovciková A., Slamin, Sugeng K.A.

Fuentes:

scopus