Tree-antimagicness of disconnected graphs

Article

Abstract: A simple graph G admits an H -covering if every edge in E (G) belongs to a subgraph of G isomorphic

Palabras claves:

Autores:

Kimáková Z., Martin Bača, Semaničova-Fenovciková A., Umar M.A.

Fuentes:

scopus