Development of navigation systems in optimal utilization of transportation routes in topology helm graphs using graph labeling

Graph theory plays a vital role in many fields. The graph concept models many relationships and processes in physical, biological, social, transportation, and information systems. One of the essential fields in graph theory is graph labeling. Graph labeling is widely used in various applications such as coding theory, x-ray crystallography, radar, astronomy, circuit design, addressing of communication networks, database management, etc. In this research, we will examine a form of topology of transportation routes based on graph labeling. The topology of the transportation routes that will be studied is a modified of helm graph. This research aims to determine the total vertex irregularity strength of the modified helm graph denoted by Hn for n ≥ 3. The lower bound is obtained based on the properties of the graph Hn using the existing supporting theorem. The upper bound is obtained by labeling the vertices and edges of the graph Hn in some simple cases. From this labeling, total vertex irregular labeling will be constructed for any n. Based on the results of this research, the total vertex irregularity strength of the graph Hn is tvs(Hn) = 3+32 2 with n ≥ 3.