Mostrando 5 resultados de: 5
Antimagic labeling of the union of two stars
ArticleAbstract: Let G be a graph of order p and size q. An (a, d)-edge-antimagic total labeling of G is a one-to-onePalabras claves:Autores:Dafik D., Martin Bača, Miller M., Ryan J.Fuentes:scopusAntimagic valuations of generalized Petersen graphs
ArticleAbstract: A connected graph G is said to be (a, d)-antimagic, for some positive integers a and d, if its edgesPalabras claves:Autores:Martin Bača, Miller M.Fuentes:scopusConstruction of new larger (a, d)-edge antimagic vertex graphs by using adjacency matrices
ArticleAbstract: Let G = G(V,E) be a finite simple undirected graph with vertex set V and edge set E, where {pipe}E{pPalabras claves:Autores:Martin Bača, Miller M., Rahmawati S., Silaban D.R., Sugeng K.A.Fuentes:scopusOn magicness and antimagicness of the union of 4-regular circulant graphs
ArticleAbstract: Let G = (V,E) be a graph of order n and size e. An (a, d)-vertexantimagic total labeling is a bijectPalabras claves:Autores:Herawati B., Martin Bača, Miller M., Sugeng K.A.Fuentes:scopusTotally antimagic total graphs
ArticleAbstract: For a graph G a bijection from the vertex set and the edge set of G to the set {1, 2, . . ., |V(G)|Palabras claves:Autores:Martin Bača, Miller M., Phanalasy O., Ryan J., Semaničova-Fenovciková A., Sillasen A.A.Fuentes:scopus