Advances and Applications in Discrete Mathematics
Volume 21, Issue 2, Pages 193 - 202
(July 2019) http://dx.doi.org/10.17654/ |
|
ON EDGE IRREGULARITY STRENGTH OF SOME GRAPHS
Bilal N. Al-Hasanat
|
Abstract: For a simple, connected and undirected graph G(V, E) the vertex k-labeling is a map This map assigns a weight for each edge in E. The weight of e = uv in G is The k-labeling map Ψ is called an irregular k-labeling of G if the assigned edge weights are distinct. The minimum k for which the graph G has an irregular k-labeling is called the edge irregularity strength of G, denoted by es(G). The value of es(G) has been found for some graphs, such as the complete bipartite graph Kn,2, the corona product of two paths and the corona product of path and cycle The main aim of this paper is to generalize some of the recent results. We do it by finding the exact value of the edge irregularity strength of and |
Keywords and phrases: k-labeling, irregularity strength, simple graph, complete bipartite graph, path graph, cycle graph, corona product.
|
|
Number of Downloads: 249 | Number of Views: 1634 |
|