Construction of new larger (a, d)-edge antimagic vertex graphs by using adjacency matrices

Article

Abstract: Let G = G(V,E) be a finite simple undirected graph with vertex set V and edge set E, where {pipe}E{p

Palabras claves:

Autores:

Martin Bača, Miller M., Rahmawati S., Silaban D.R., Sugeng K.A.

Fuentes:

scopus