Ladders and fan graphs are cycle-antimagic

Article

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

Palabras claves:

(Super) (a,d)-H-antimagic total labeling, Cycle-antimagic labeling, fan graph, H-covering, Ladder

Autores:

Jeyanthi P., Martin Bača, Muthuraja N.T., Selvagopal P.N., Semaničova-Fenovciková A.

Fuentes:

scopus