Computing the Edge Irregularity Strength of Bipartite Graphs and Wheel Related Graphs
Ali Hasan Ahmad, Muhammad Ahsan Asim, Basem Assiri, Andrea Semaničová–Feňovčíková · Fundamenta Informaticae · 2020
A vertex labeling φ : V(G) → {1, 2, . . . , k} is called an edge irregular k-labeling of a graph G if all edges in G have unique weights. The weight of an edge is defined as the sum of the labels of its incident vertices. The minimum k for which the graph G has an edge irregular k-labeling is calle d the edge irregularity strength of G, denoted by es(G). In this paper we perform a computer based experiment dealing with the edge irregularity strength of complete bipartite graphs. We also present some bounds on this parameter for wheel related graphs.