Mostrando 5 resultados de: 5
Antimagic labelings of grids
ArticleAbstract: In this paper we deal with the problem of labeling the vertices, edges and faces of a grid graph byPalabras claves:Antimagic labeling, Face weight, Graph labeling, Grid, Labeling of type (1,1,1)Autores:Lin Y., Martin Bača, Miller M.Fuentes:scopusFace antimagic labelings of prisms
ArticleAbstract: This paper deals with the problem of labeling the vertices, edges and faces of a plane graph in suchPalabras claves:Autores:Lin Y., Martin Bača, Miller M., Sugeng K.A.Fuentes:scopusStrong labelings of linear forests
ArticleAbstract: A (p, q)-graph G is called super edge-magic if there exists a bijective function f: V (G) → E(G) → {Palabras claves:Linear forest, Path-like tree, Strong super edge magic labelingAutores:Lin Y., Martin Bača, Muntaner-Batle F., Rius-Font M.Fuentes:scopusSuper edge-antimagic labelings of the path-like trees
ArticleAbstract: A graph G = (V, E) is (a, d)-edge-antimagic total if there exists a bijective function f : V(G) ∪ E(Palabras claves:Autores:Lin Y., Martin Bača, Muntaner-Batle F.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