On H-irregularity strengths of G-amalgamation of graphs

Article

Abstract: A simple graph G = (V (G),E(G)) admits an H-covering if every edge in E(G) belongs at least to one s

Palabras claves:

Amalgamation of graphs, Edge) H-irregular labeling, Edge) H-irregularity strength, Total (vertex

Autores:

Ashraf F., Martin Bača, Semaničova-Fenovciková A., Shabbir A.

Fuentes:

scopus