On (F,H)-sim-magic labelings of graphs

Article

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

Palabras claves:

(F, Cartesian product, H)-sim-(super)magic, H-(super)magic, H-covering, join product

Autores:

Ashari Y.F., Martin Bača, Salman A.N.M., Semaničova-Fenovciková A., Simanjuntak R.

Fuentes:

scopus