Antimagic labeling of disjoint union of s-crowns

Article

Abstract: A graph G is called (a, d)-edge-antimagic total if it admits a labeling of the vertices and edges by

Palabras claves:

(a,d)-edge-antimagic total labeling, S-crowns, Super (a,d)-edge-antimagic total labeling

Autores:

Dafik D., Martin Bača, Miller M., Ryan J.

Fuentes:

scopus