Mostrando 4 resultados de: 4
Filtros aplicados
Subtipo de publicación
Article(4)
Área temáticas
Ciencias de la computación(1)
Principios generales de matemáticas(1)
Programación informática, programas, datos, seguridad(1)
Origen
scopus(4)
On (a,1)-vertex-antimagic edge labeling of regular graphs
ArticleAbstract: An (a,s)-vertex-antimagic edge labeling (or an (a,s)-VAE labeling, for short) of G is a bijective maPalabras claves:Autores:Martin Bača, Semaničova-Fenovciková A., Wang T.M., Zhang G.Fuentes:scopusOn 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