Let graph G admitting cover H. A total k-labeling\(\varphi: V (G)\cup E (G)\to\{1, 2,\ldots, k\}\)
can be define as total H-irregular k-labeling of the graph G if there is\(w {t} …

Let G be a graph which has V (G) as a vertex set and E (G) as an edge set. The G graph
contain subgraph H that isomorphic with H j, j= 1, 2,... s, if every e∈ E (G) include only in one …

Let G be a graph with vertex set V and edge set E. Total labeling f: V (G)∪ E (G)→{1, 2, 3,...,
l} called a total l-labeling of a graph G. The total l-labeling is a total H-irregular l-labeling of …