On Edge H-Irregularity Strengths of Some Graphs

Abstract

For a graph G an edge-covering of G is a family of subgraphs H1, H2, . . . , Ht such that each edge of E(G) belongs to at least one of the subgraphs Hi, i = 1, 2, . . . , t. In this case we say that G admits an (H1, H2, . . . , Ht)-(edge) covering. An H-covering of graph G is an (H1, H2, . . . , Ht)-(edge) covering in which every subgraph Hi is isomorphic to a given graph H.

Keywords

• h-irregular edge labeling
• edge h-irregularity strength
• prism
• antiprism
• triangular ladder
• diagonal ladder
• wheel
• gear graph
• 05c78
• 05c70