Abstract
Neutrosophic set (NS) is an extensively used framework whenever the imprecision and uncertainty of an event is described based on three possible aspects. The association, neutral, and nonassociation degrees are the three unique aspects of an NS. More importantly, these degrees are independent which is a great plus point. On the contrary, neutrosophic graphs (NGs) and single-valued NGs (SVNGs) are applicable to deal with events that contain bulks of information. However, the concept of degrees in NGs is a handful tool for solving the problems of decision-making (DM), pattern recognition, social network, and communication network. This manuscript develops various forms of edge irregular SVNG (EISVNG), highly edge irregular SVNG (HEISVNG), strongly (EISVNG), strongly (ETISVNG), and edge irregularity on a cycle and a path in SVNGs. All these novel notions are supported by definitions, theorems, mathematical proofs, and illustrative examples. Moreover, two types of DM problems are modelled using the proposed framework. Furthermore, the computational processes are used to confirm the validity of the proposed graphs. Furthermore, the results approve that the decision-making problems can be addressed by the edge irregular neutrosophic graphical structures. In addition, the comparison between proposed and the existing methodologies is carried out.