Abstract
A simple undirected graph = (V Γ, EΓ) admits an H-covering if every edge in E belongs to at least one subgraph of that is isomorphic to a graph H. For any graph admitting H-covering, a total labelling β : VΓ ∪EΓ→{1, 2, …, p} is called an H-irregular total p-labelling of Γ if every two different subgraphs H1 and H2 of isomorphic to H have distinct weights where the weight wβ(K) of subgraph K of Γ is defined as