Mostrando 2 resultados de: 2
Edge-antimagic total labeling of disjoint union of caterpillars
Conference ObjectAbstract: Let G = (V, E) be a finite graph, where V(G) and E(G) are the (non-empty) sets of vertices and edgesPalabras claves:Autores:Dafik D., Martin Bača, Miller M., Ryan J.Fuentes:scopusOn antimagic labelings of disjoint union of complete s-partite graphs
Conference ObjectAbstract: By an (a, d)-edge-antimagic total labeling of a graph G(V, E) we mean a bijective function f from V(Palabras claves:(a,d)-edge-antimagic total labeling, Complete s-partite graph, Super (a, d) -edge-antimagic total labelingAutores:Dafik D., Martin Bača, Miller M., Ryan J.Fuentes:scopus