On connection between α-labelings and edge-antimagic labelings of disconnected graphs

Article

Abstract: A labeling of a graph is any map that carries some set of graph elements to numbers (usually to the

Palabras claves:

(a, d)-edge-antimagic vertex labeling, (a.d)-edge-nnlimagic total labeling, Super (a,d)-edgeantimngic total labeling, αLabeling

Autores:

Lascsáková M., Martin Bača, Semaničova-Fenovciková A.

Fuentes:

scopus