Mostrando 2 resultados de: 2
Edge-antimagic graphs
ArticleAbstract: For a graph G = (V, E), a bijection g from V (G) ∪ E (G) into { 1, 2, ...,| V (G) | + | E (G) | } isPalabras claves:Edge-antimagic labeling, Edge-weightAutores:Lin Y., Martin Bača, Miller M., Youssef M.Z.Fuentes:scopusSuper-vertex-antimagic total labelings of disconnected graphs
ArticleAbstract: Let G = (V, E) be a finite, simple and non-empty (p, q)-graph of order p and size q. An (a, d)-vertePalabras claves:(a, d)-vertex-antimagic total labeling, Disconnected graphs, Super-(a, d)-vertex-antimagic total labelingAutores:Ali G., Lin Y., Martin Bača, Semaničova-Fenovciková A.Fuentes:scopus