Mostrando 2 resultados de: 2
Filtros aplicados
Subtipo de publicación
Article(2)
Área temáticas
Programación informática, programas, datos, seguridad(1)
A method to generate large classes of edge-antimagic trees
ArticleAbstract: A (p, q)-graph G is said to be graceful if the vertices can be assigned the labels {1,2,...,q+ 1} suPalabras claves:Edge-antimagic total labeling, Graceful labeling, Tree, α-labelingAutores:Martin Bača, Semaničova-Fenovciková A., Shafiq M.K.Fuentes:scopusOn super (a, 1)-edge-antimagic total labelings of regular graphs
ArticleAbstract: A labeling of a graph is a mapping that carries some set of graph elements into numbers (usually posPalabras claves:Regular graph, Super edge-antimagic total labelingAutores:Kovář P., Martin Bača, Semaničova-Fenovciková A., Shafiq M.K.Fuentes:scopus