Mostrando 2 resultados de: 2
Antimagic labeling of disjoint union of s-crowns
ArticleAbstract: A graph G is called (a, d)-edge-antimagic total if it admits a labeling of the vertices and edges byPalabras claves:(a,d)-edge-antimagic total labeling, S-crowns, Super (a,d)-edge-antimagic total labelingAutores:Dafik D., Martin Bača, Miller M., Ryan J.Fuentes:scopusSuper edge-antimagic total labelings of mK<inf>n,n,n</inf>
ArticleAbstract: An (a, d)-edge-antimagic total labeling on (p, q)-graph G is a one-to-one map f from V(G) ∪ E(G)Palabras claves:MK and K ∪ 2sK n,n,n 1,m 1,n, Super (a,d)-edge-antimagic total labelingAutores:Dafik D., Martin Bača, Miller M., Ryan J.Fuentes:scopus