Mostrando 2 resultados de: 2
On 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