Mostrando 2 resultados de: 2
Construction 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:scopusLocal inclusive distance vertex irregular graphs
ArticleAbstract: Let G = (V, E) be a simple graph. A vertex labeling f: V(G) → {1, 2, …, k} is defined to be a localPalabras claves:(inclusive) distance vertex irregular labeling, Local (inclusive) distance vertex irregular labelingAutores:Martin Bača, Semaničova-Fenovciková A., Silaban D.R., Sugeng K.A.Fuentes:scopus