Edge-antimagic total labeling of disjoint union of caterpillars

Conference Object

Abstract: Let G = (V, E) be a finite graph, where V(G) and E(G) are the (non-empty) sets of vertices and edges

Palabras claves:

Autores:

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

Fuentes:

scopus