On edge H-irregularity strengths of some graphs
Faraha Ashraf, Martin Bača, Muhammad Naeem, Andrea Semaničová–Feňovčíková, Muhammad Kamran Siddiqui · Discussiones Mathematicae Graph Theory · 2019
For a graph G an edge-covering of G is a family of subgraphs H 1 , H 2 , . . . , H t such that each edge of E(G) belongs to at least one of the subgraphs H i , i = 1, 2, . . . , t. In this case we say that G admits an (H 1 , H 2 , . . . , H t )-(edge) covering. An H-covering of graph G is an (H 1 , H 2 , . . . , H t )-(edge) covering in which every subgraph H i is isomorphic to a given graph H.