On H-irregularity strength of cycles and diamond graphs
Abstract
A simple graph G=(V(G),E(G)) admits an H-covering if every edge in E(G) belongs to at least one subgraph of G isomorphic to a given graph H. The graph G admits an H-irregular totalk-labelingf:V(G)∪E(G)→{1,2,…,k} if G admits an H-covering and for every two different subgraphs H′ and H″ isomorphic to H, there is wtf(H′)≠wtf(H″), where wtf(H)=∑v∈V(H)f(v)+∑e∈E(H)f(e) is the associated H-weight. The totalH-irregularity strength of G is ths(G,H)=min{k:G has an H-irregular total k-labeling}.
In this paper, we give the exact values of ths(Cn,Pm), where m∈{3,n2,n2+1,n}. For the versions edge and vertex H-irregularity strength ehs and vhs, respectively, we determine the exact values of ehs(Brn,C3), ehs(Brn,Brm) and vhs(Brn,Brm), where Brn is the diamond graph.
Communicated by Xiaofeng Gao