On H-irregularity strength of cycles and diamond graphs

Abstract

A simple graph [Formula: see text] admits an [Formula: see text]-covering if every edge in [Formula: see text] belongs to at least one subgraph of [Formula: see text] isomorphic to a given graph [Formula: see text]. The graph [Formula: see text] admits an [Formula: see text]-irregular total [Formula: see text]-labeling [Formula: see text] if [Formula: see text] admits an [Formula: see text]-covering and for every two different subgraphs [Formula: see text] and [Formula: see text] isomorphic to [Formula: see text], there is [Formula: see text], where [Formula: see text] is the associated [Formula: see text]-weight. The total [Formula: see text]-irregularity strength of [Formula: see text] is [Formula: see text]. In this paper, we give the exact values of [Formula: see text], where [Formula: see text]. For the versions edge and vertex [Formula: see text]-irregularity strength [Formula: see text] and [Formula: see text], respectively, we determine the exact values of [Formula: see text], [Formula: see text] and [Formula: see text], where [Formula: see text] is the diamond graph.