Mostrando 3 resultados de: 3
Subtipo de publicación
Article(3)
Publisher
Australasian Journal of Combinatorics(1)
Mathematical Problems in Engineering(1)
Turkish Journal of Mathematics(1)
Origen
scopus(3)
Fans are cycle-antimagic
ArticleAbstract: A simple graph G = (V, E) admits an H-covering if every edge in E belongs at least to one subgraph oPalabras claves:Autores:Martin Bača, Ovais A., Semaničova-Fenovciková A., Umar M.A.Fuentes:scopusOn H-antimagicness of Cartesian product of graphs
ArticleAbstract: A graph G = (V (G), E(G)) admits an H-covering if every edge in E belongs to a subgraph of G isomorpPalabras claves:Cartesian product, H-covering, Partition of set, Super (a, d) -H-antimagic graphAutores:Martin Bača, Semaničova-Fenovciková A., Umar M.A., Welyyanti D.Fuentes:scopusTree-antimagicness of disconnected graphs
ArticleAbstract: A simple graph G admits an H -covering if every edge in E (G) belongs to a subgraph of G isomorphicPalabras claves:Autores:Kimáková Z., Martin Bača, Semaničova-Fenovciková A., Umar M.A.Fuentes:scopus