On Edge H-Irregularity Strengths of Some Graphs

Article

Abstract: For a graph G an edge-covering of G is a family of subgraphs H1, H2, Ht such that each edge of E(G)

Palabras claves:

antiprism, diagonal ladder, Edge H-irregularity strength, gear graph, H-irregular edge labeling, prism, triangular ladder, Wheel

Autores:

Ashraf F., Martin Bača, Naeem M., Semaničova-Fenovciková A., Siddiqui M.K.

Fuentes:

scopus