Mostrando 3 resultados de: 3
On Local Antimagic Vertex Coloring for Complete Full t-ary Trees
ArticleAbstract: Let G = (V, E) be a finite simple undirected graph without K2 components. A bijection f : E → {1, 2,Palabras claves:Antimagic labeling, complete full t-ary tree, Local antimagic chromatic number, Local antimagic labelingAutores:Lai R.T., Martin Bača, Semaničova-Fenovciková A., Wang T.M.Fuentes:scopusLocal Face Antimagic Evaluations and Coloring of Plane Graphs
ArticleAbstract: We investigate a local face antimagic labeling of plane graphs, and we introduce a new graph charactPalabras claves:local face antimagic chromatic number of type (a; b; c), local face antimagic labeling, Plane graphAutores:Bong N., Martin Bača, Semaničova-Fenovciková A., Sugeng K.A., Wang T.M.Fuentes:scopusLocal antimagic chromatic number for copies of graphs
ArticleAbstract: An edge labeling of a graph G = (V, E) using every label from the set {1, 2, …, |E(G)|} exactly oncePalabras claves:copies of graphs, Local antimagic chromatic number, Local antimagic labelingAutores:Martin Bača, Semaničova-Fenovciková A., Wang T.M.Fuentes:scopus