On total H-irregularity strength of the disjoint union of graphs
Faraha Ashraf, Martin Bača, Susana-Clara López, Francisco Antonio Muntaner-Batle, Akito Oshima, Andrea Semaničová–Feňovčíková · Discussiones Mathematicae Graph Theory · 2018
A simple graph G admits an H-covering if every edge in E(G) belongs to at least to one subgraph of G isomorphic to a given graph H. For the subgraph H G under a total k-labeling we define the associated H-weight as the sum of labels of all vertices and edges belonging to H. The total k-labeling is called the H-irregular total k-labeling of a graph G admitting