On total h-irregularity strength of the disjoint union of graphs

Article

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

Palabras claves:

copies of graphs, H-covering, H-irregular labeling, total H-irregularity strength, union of graphs

Autores:

Ashraf F., López S., Martin Bača, Muntaner-Batle F., Oshima A., Semaničova-Fenovciková A.

Fuentes:

scopus