Mostrando 2 resultados de: 2
Constructions of H-antimagic graphs using smaller edge-antimagic graphs
ArticleAbstract: A simple graph G - (V, E) admits an H-covering if every edge in E belongs at least to one subgraph oPalabras claves:(Super) (a,d)-H-antimagic labeling, H-coveringAutores:Dafik D., Martin Bača, Semaničova-Fenovciková A., Slamin, Tanna D.Fuentes:scopusVertex-magic total labelings of generalized petersen graphs
ArticleAbstract: A vertex-magic total labeling of a graph G = (V, E) with ν vertices and e edges is an assignment ofPalabras claves:Petersen graphsAutores:Martin Bača, Miller M., SlaminFuentes:scopus