Constructions of H-antimagic graphs using smaller edge-antimagic graphs

Article

Abstract: A simple graph G - (V, E) admits an H-covering if every edge in E belongs at least to one subgraph o

Palabras claves:

(Super) (a,d)-H-antimagic labeling, H-covering

Autores:

Dafik D., Martin Bača, Semaničova-Fenovciková A., Slamin, Tanna D.

Fuentes:

scopus