Some Root Level Modifications in Interval Valued Fuzzy Graphs and Their Generalizations Including Neutrosophic Graphs

Abstract

Fuzzy graphs (FGs) and their generalizations have played an essential role in dealing with real-life problems involving uncertainties. The goal of this article is to show some serious flaws in the existing definitions of several root-level generalized FG structures with the help of some counterexamples. To achieve this, first, we aim to improve the existing definition for interval-valued FG, interval-valued intuitionistic FG and their complements, as these existing definitions are not well-defined; i.e., one can obtain some senseless intervals using the existing definitions. The limitations of the existing definitions and the validity of the new definitions are supported with some examples. It is also observed that the notion of a single-valued neutrosophic graph (SVNG) is not well-defined either. The consequences of the existing definition of SVNG are discussed with the help of examples. A new definition of SVNG is developed, and its improvement is demonstrated with some examples. The definition of an interval-valued neutrosophic graph is also modified due to the shortcomings in the current definition, and the validity of the new definition is proved. An application of proposed work is illustrated through a decision-making problem under the framework of SVNG, and its performance is compared with existing work.

1. Introduction

The framework of the fuzzy set (FS) was introduced by Zadeh [1] in 1965 as a generalization of crisp sets, which describe the membership of an object to a set by assigning a membership grade from [0,1]. The concept of FS was further generalized to the interval-valued fuzzy set (IVFS) in [2] where the membership grade is defined by closed sub-intervals $\left[S^L, S^U\right]\subseteq \left[0,1\right]$. The idea of FS was further generalized to an enhanced framework of the intuitionistic fuzzy set (IFS) in [3] by considering the degree of non-membership of an object as well as its membership grade, such that the sum of the degrees is less than one. Later on, Atanassov and Gargov [4] extended the theory of IFS to an interval-valued IFS (IVIFS). To consider the neutral opinion or abstinence information in the analysis, Smarandache introduced a framework of neutrosophic logic and consequently a neutrosophic set [5]. A neutrosophic set is characterized by three kinds of functions describing the degree of membership, abstinence and non-membership of an object. The concept of the single-valued neutrosophic set (SVNS) was developed by Wang et al. [6], characterized by three characteristic functions, named as truth, falsity and indeterminate, with a restriction that their sum is not greater than 3. The concept of SVNS was further generalized to an interval-valued neutrosophic set (IVNS) in Wang et al. [7] where the membership, abstinence and non-membership grades are defined in terms of closed sub-intervals of the unit interval. Under the above-mentioned sets, various researchers have addressed different kinds of algorithms to solve decision-making problems [8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25].

Further, apart from this, the concept of the fuzzy graph (FG), initially introduced by Kauffman [26], was thoroughly developed by Rosenfeld [27] in 1975. A generalization of FG known as the interval-valued FG (IVFG) was introduced by Akram and Dudek [28] where the nodes and edges are in the form of interval-valued fuzzy numbers (IVFNs). To deal with the study of FGs and IVFG, we refer the readers to the articles in [29,30,31,32,33,34,35,36,37,38]. After successful applications, Parvathi and Karunambigai [39] introduced the concept of intuitionistic fuzzy graphs (IFG), which is a generalization of the FG. The concept of interval-valued IFG (IVIFG) is proposed in [40] and some other terms and notions related to IVIFG can be found in [41,42]. Further, by following the notion of SVNS, the concept of the single-valued neutrosophic graph (SVNG) was introduced by Broumi et al. [43] and has been extensively used in several problems such as the shortest path problem [44,45], communication problem [46], and decision-making [47]. The concept of SVNG was further generalized to the interval-valued neutrosophic graph (IVNG) in [48], where the membership, abstinence and non-membership grades are described by closed subintervals of the unit interval. The framework of IVNG is the most sophisticated among all existing graph structures. For some other work on IVNG, one may refer to [49,50,51].

In the theory of fuzzy algebraic structures and from the above literature survey, we found some serious shortcomings which motivate us to develop some new definitions for the existing concepts. The problems in the existing literature and steps toward their solution are discussed item by item below.

(1)

It is observed that the concept of IVFG [28] has some limitations which lead us to some undefined results. The lower and upper values of the edge interval in IVFG are defined as ${\mathrm{Ŝ}}^L\left(v_i, v_j\right)\le \min \left(S^L\left(v_i\right), S^L\left(v_j\right)\right)$ and ${\mathrm{Ŝ}}^U\left(v_i, v_j\right)\le \min \left(S^U\left(v_i\right), S^U\left(v_j\right)\right)$. According to this definition for two adjacent vertices $\left(0.2, 0.4\right)$ and $\left(0.2, 0.3\right)$, we obtained an undefined edge value of $\left(0.2, 0.0\right)$ by the above approach. The same type of problem occurs in the framework of IVIFG [40] in membership as well as non-membership intervals. Further, the existing definition of IVIFG is not a generalization of IFG; therefore, one must develop a definition for IVIFG which clearly generalizes IFG. These types of flaws in the existing literature lead us to develop some new definitions for IVFG and IVIFG;

(2)

The lower and upper values of edges in the complement of an IVFG are defined as ${\left({\mathrm{Ŝ}}^L\right)}^c\left(v_i, v_j\right)=\min \left(S^L\left(v_i\right), S^L\left(v_j\right)\right)-{\mathrm{Ŝ}}^L\left(\left(v_i, v_j\right)\right)$ and ${\left({\mathrm{Ŝ}}^U\right)}^c\left(v_i, v_j\right)=\min \left(S^U\left(v_i\right), S^U\left(v_j\right)\right)-{\mathrm{Ŝ}}^U\left(v_i, v_j\right)$. Let $\left(0.2, 0.5\right)$ and $\left(0.2, 0.3\right)$ be two vertices and $\left(0.1, 0.3\right)$ their edge. Then, upon calculating the complement, we get the corresponding edge value $\left(0.1, 0.0\right)$ which is an undefined interval. Similar types of flaws exist in the existing definitions of complements of IVIFGs, therefore leading us to develop some new definitions for the complement of IVFG as well as of IVIFG.;

(3)

It is observed that the existing definition of SVNG [43] is not a generalization of IFG as claimed in the existing literature. Also, the existing notion of the SVNG and of its complement as defined in [43] is not well posed, as after taking the complement of a SVNG, the resulting graph obtained is not a SVNG. Further, the existing definition of a complement does not satisfy the property ${\left(G^c\right)}^c=G$. These facts are described briefly in Section 5, and based on these defects, a new definition for SVNG and its complement have been developed and their validity is proved;

(4)

Finally, we improve the definition of the IVNG as the existing definition contradicts the fact that IVNG is a generalization of IVIFG and IVFG. Further, the existing definition of the complement of IVNG is not well defined, which is described with the help of examples, and a new definition for complements is proposed and validated with examples.

The rest of the article is organized as follows: Section 1 provides a historical background of FGs and their generalized algebraic structures. The motivation and aim of our proposed work is also discussed in this section. In Section 2, some basic concepts of FGs and IFGs are discussed and supported with examples. Section 3 is based on a description of the limitations of IVFGs and IVIFGs and some improvements in their basic definitions. In Section 4, we discuss the drawbacks of the complements of IVFG and IVIFG and propose new definitions of complements along with some examples in their support. In Section 5, the drawbacks of the existing concepts of SVNGs, IVNGs and their complements are described. Further, some new improved definitions are proposed for SVNG, IVNGs and the complement of IVNG, supported by some examples. Section 6 is based on an application of SVNGs in decision-making, while Section 7 provides a summary of the article along with some future work.

2. Basic Concepts

In this section, some definitions of FG and its complement are defined and demonstrated with the help of an example. The primary definition of IFG is also discussed in this section, followed by an example for illustration.

Definition 1.

[27] An FG is a pair $G=\left(V, E\right)$ where $V$ is the set of nodes and $E$ is the collection of edges between these nodes such that

(1) 

Every$v\in V$is characterized by a function$S:V\to \left[0,1\right]$denoting the degree of membership of$v\in V$;

(2) 

Every$e\in E$is characterized by a function$\mathrm{Ŝ}:V\times V\to \left[0,1\right]$denoting the degree of membership$e\in V\times V$satisfying the condition$\mathrm{Ŝ}\left(v_i, v_j\right)\le \min \left(S\left(v_i\right), S\left(v_j\right)\right)$.

Definition 2.

[29] The complement of FG$G=\left(V, E\right)$is defined by$G^c=\left(V^c, E^c\right)$where$V^c=V$and the membership grade of$e\in E$is defined by${\left(\mathrm{Ŝ}\right)}^c\left(v_i, v_j\right)=\min \left(S\left(v_i\right), S\left(v_j\right)\right)-\mathrm{Ŝ}\left(\left(v_i, v_j\right)\right)$.

Example 1.

The following Figure 1 is an example of an FG while Figure 2 represents its complement.

Figure 1. Fuzzy graph (FG) compatible with Definition 1.

Figure 2. Complement of FG depicted in Figure 1.

Definition 3.

[39] An IFG is a duplet $G=\left(V, E\right)$ where the set of nodes is denoted by $V$ and $E$ is the collection of edges between these nodes such that

(1) 

Every$v\in V$is characterized by two functions$S:V\to \left[0,1\right]$and$D:V\to \left[0, 1\right]$denoting the membership and non-membership degree of$v\in V$which satisfies the condition that$0\le S+D\le 1$. Moreover, the term$R$defined by$R=1-S-D,$denotes the hesitancy level of$\in E$;

(2) 

Every$e\in E$is characterized by two functions$\mathrm{Ŝ}:V\times V\to \left[0, 1\right]$and$\mathrm{Ð}:V\times V\to \left[0, 1\right]$denoting the membership and non-membership degree of$e\in V\times V$satisfying the conditions:

$$\mathrm{Ŝ}\left(v_i, v_j\right)\le \min \left(S\left(v_i\right), S\left(v_j\right)\right)$$

$$\mathrm{Ð}\left(v_i, v_j\right)\le \max \left(D\left(v_i\right), D\left(v_j\right)\right)$$

with a condition that$0\le \mathrm{Ŝ}+\mathrm{Ð}\le 1$. Moreover, the term$\mathrm{Ř}$denotes the hesitancy level of$e\in E$such that$\mathrm{Ř}=1-\mathrm{Ŝ}-\mathrm{Ð}$.

Example 2.

The following Figure 3 is an example of an IFG.

Figure 3. Intuitionistic fuzzy graph (IFG) compatible with Definition 2.

The rest of the basic notions are discussed in Section 3, Section 4 and Section 5, in which we present a comparative analysis with our proposed work.

3. Improvements in Interval-Valued Fuzzy Graphs and Interval-Valued Intuitionistic Fuzzy Graphs

In this section, first, the existing definitions of IVFG and IVIFG are reviewed and the shortcomings of these algebraic structures are pointed out with the help of examples. New definitions for IVFG and IVIFG are developed and their fitness is verified with the help of some examples.

First, we review the definition of IVFG defined in [28] and provide an example to show the limitation of the definitions.

Definition 4.

[28] An IVFG is a duplet $G=\left(V, E\right)$ where $V$ denotes a collection of nodes and $E$ denotes the collection of edges between these vertices such that

(1) 

Every$v\in V$is characterized by a function$S$representing the membership degree of$v\in V$. Basically,$S=\left[S^L, S^U\right]$is a closed subinterval [0, 1];

(2) 

Every$e\in E$is characterized by a function$\mathrm{Ŝ}$denoting the degree of membership$e\in V\times V$. Basically,$\mathrm{Ŝ}=\left[{\mathrm{Ŝ}}^L, {\mathrm{Ŝ}}^U\right]$satisfying the conditions:

$$\begin{gathered} {\mathrm{Ŝ}}^L\left(v_i, v_j\right)\le \min \left(S^L\left(v_i\right), S^L\left(v_j\right)\right) \\ {\mathrm{Ŝ}}^U\left(v_i, v_j\right)\le \min \left(S^U\left(v_i\right), S^U\left(v_j\right)\right) \end{gathered}$$

Example 3.

Consider the following Figure 4, where we observed that, while determining the edge values, we get undefined intervals as highlighted. This shows that the current notion of an IVFG is not satisfactory, which leads us to develop a new definition.

Figure 4. Interval-valued fuzzy graph containing undefined intervals.

Definition 5.

An IVFG is a duplet $G=\left(V, E\right)$ where $V$ denotes a collection of nodes and $E$ denotes the collection of edges between these vertices such that

(1) 

Every$v\in V$is characterized by a function$S$representing the membership grade of$v\in V$. Basically,$S=\left[S^L, S^U\right]$is a closed subinterval of the unit interval [0, 1];

(2) 

Every$e\in E$is characterized by a function$\mathrm{Ŝ}$denoting the membership grade of$e\in V\times V$. The closed subinterval$\mathrm{Ŝ}=\left[{\mathrm{Ŝ}}^L, {\mathrm{Ŝ}}^U\right]$satisfying the conditions:

$$\begin{gathered} {\mathrm{Ŝ}}^L\left(v_i, v_j\right)\le \min \left(S^L\left(v_i\right), S^L\left(v_j\right)\right)\mathrm{and} \\ {\mathrm{Ŝ}}^U\left(v_i, v_j\right)\le \min \left(S^U\left(v_i\right), S^U\left(v_j\right)\right)\mathrm{such}\mathrm{that}{\mathrm{Ŝ}}^U\left(v_i, v_j\right)\ge \min \left(S^L\left(v_i\right), S^L\left(v_j\right)\right). \end{gathered}$$

This definition is supported with the help of following example in which we show that none of the intervals is undefined and that Definition 5 works perfectly.

Example 4.

The following IVFG depicted in Figure 5 is in accordance with Definition 5.

Figure 5. Interval-valued fuzzy graph compatible with Definition 5.

Next, we provide a critical study of IVIFGs with a definition which is based on IVIFG which yields undefined closed sub-intervals. First, we review the existing definition and the existing shortcomings with the help of examples. Then, the new definition is developed and supported by an example.

Definition 6.

[40] An IVIFG is a duplet $G=\left(V, E\right)$ where the set of nodes is denoted by $V$ and $E$ is the collection of edges between these nodes such that

(1) 

Every$v\in V$is characterized by two functions$S$and$D$denoting the membership and non-membership grades of$v\in V$. Basically,$S=\left[S^L, S^U\right]$and$D=\left[D^L, D^U\right]$are closed subintervals of the unit interval [0, 1] with a condition that$0\le S^U+D^U\le 1$. Moreover, the term$R=\left[R^L, R^U\right]$denote the hesitancy level of$v\in V$such that$R^U=1-S^L-D^L$and$R^L=1-S^U-D^U$.

(2) 

Every$e\in E$is characterized by two functions$\mathrm{Ŝ}$and$\mathrm{Ð}$denoting the membership and non-membership grades of$e\in V\times V$. Basically,$\mathrm{Ŝ}=\left[{\mathrm{Ŝ}}^L, {\mathrm{Ŝ}}^U\right]$and$\mathrm{Ð}=\left[{\mathrm{Ð}}^L, {\mathrm{Ð}}^U\right]$satisfying the conditions:

$$\begin{array}{ll}{\mathrm{Ŝ}}^L\left(v_i, v_j\right)\le \min \left(S^L\left(v_i\right), S^L\left(v_j\right)\right)& {\mathrm{Ŝ}}^U\left(v_i, v_j\right)\le \min \left(S^U\left(v_i\right), S^U\left(v_j\right)\right)\\ {\mathrm{Ð}}^L\left(v_i, v_j\right)\ge \max \left(D^L\left(v_i\right), D^L\left(v_j\right)\right)& {\mathrm{Ð}}^U\left(v_i, v_j\right)\ge \max \left(D^U\left(v_i\right), D^U\left(v_j\right)\right)\end{array}$$

provided that$0\le {\mathrm{Ŝ}}^U+{\mathrm{Ð}}^U\le 1$. Moreover, the term$\mathrm{Ř}=\left[{\mathrm{Ř}}^L, {\mathrm{Ř}}^U\right]$denote the hesitancy level of$e\in E$such that${\mathrm{Ř}}^U=1-{\mathrm{Ŝ}}^L-{\mathrm{Ð}}^L$and${\mathrm{Ř}}^L=1-{\mathrm{Ŝ}}^U-{\mathrm{Ð}}^U$.

Definition 6 seems to be weak in two ways. The first reason is that IVIFG is a generalization of IFG where the non-membership grade of edge is defined as $\mathrm{Ð}\left(v_i,v_j\right)\le \max \left(D\left(v_i\right),D\left(v_j\right)\right)$, which is not followed in defining IVIFG, raising a question regarding its perfection. Another shortcoming in Definition 6 is that we may sometimes have obtained undefined closed intervals, which should be avoided. For further illustration, consider the example as follows.

Example 5.

Consider the following IVIFG in Figure 6, where it is observed that we get some undefined intervals by applying Definition 6. The undefined closed intervals are highlighted.

Figure 6. Interval-valued intuitionistic fuzzy graph (IVIFG) obtained using Definition 6 with undefined intervals.

Keeping in mind the weakness of Definition 6 as demonstrated by Example 5, we propose a new definition of IVIFG which is well defined and truly a generalization of IFG.

Definition 7.

An IVIFG is a pair $G=\left(V, E\right)$ where the set of nodes is denoted by $V$ and $E$ is the collection of edges between these nodes such that

(1) 

Every$v\in V$is characterized by two functions$S$and$D$denoting the membership and non-membership grades of$v\in V$. Basically,$S=\left[S^L, S^U\right]$and$D=\left[D^L, D^U\right]$are closed subintervals of the unit interval [0, 1] with a condition that$0\le S^U+D^U\le 1$. Moreover, the term$R=\left[R^L, R^U\right]$denote the hesitancy level of$v\in V$such that$R^U=1-S^L-D^L$and$R^L=1-S^U-D^U$;

(2) 

Every$e\in E$is characterized by two functions$\mathrm{Ŝ}$and$\mathrm{Ð}$denoting the membership and non-membership grades of$e\in V\times V$. Basically,$\mathrm{Ŝ}=\left[{\mathrm{Ŝ}}^L, {\mathrm{Ŝ}}^U\right]$and$\mathrm{Ð}=\left[{\mathrm{Ð}}^L, {\mathrm{Ð}}^U\right]$are such that

$$\begin{array}{l}{\mathrm{Ŝ}}^L\left(v_i, v_j\right)\le \min \left(S^L\left(v_i\right), S^L\left(v_j\right)\right).\\ {\mathrm{Ŝ}}^U\left(v_i, v_j\right)\le \min \left(S^U\left(v_i\right), S^U\left(v_j\right)\right)\mathrm{such}\mathrm{that}{\mathrm{Ŝ}}^U\left(v_i, v_j\right)\ge \min \left(S^L\left(v_i\right), S^L\left(v_j\right)\right).\\ {\mathrm{Ð}}^L\left(v_i, v_j\right)\le \max \left(D^L\left(v_i\right), D^L\left(v_j\right)\right).\\ {\mathrm{Ð}}^U\left(v_i, v_j\right)\le \max \left(D^U\left(v_i\right), D^U\left(v_j\right)\right)\mathrm{such}\mathrm{that}{\mathrm{Ð}}^U\left(v_i, v_j\right)\ge \max \left(D^L\left(v_i\right), D^L\left(v_j\right)\right).\end{array}$$

provided that$0\le {\mathrm{Ŝ}}^U+{\mathrm{Ð}}^U\le 1$. Moreover, the term$\mathrm{Ř}=\left[{\mathrm{Ř}}^L, {\mathrm{Ř}}^U\right]$denote the hesitancy level of$e\in E$such that${\mathrm{Ř}}^U=1-{\mathrm{Ŝ}}^L-{\mathrm{Ð}}^L$and${\mathrm{Ř}}^L=1-{\mathrm{Ŝ}}^U-{\mathrm{Ð}}^U$.

The following example shows that Definition 7 improves the concept of IVIFG and that there is no chance of getting undefined intervals.

Example 6.

Consider the graph depicted in Figure 7 demonstrating the new definition of IVIFG.

Figure 7. Interval-valued intuitionistic fuzzy graph.

The next section is based on the shortcomings of existing definitions of the complement of an IVFG and of an IVIFG together with the development of new definitions. The existing and new definitions are demonstrated with examples.

4. New Definitions for the Complement of the Interval-Valued Fuzzy Graph and Interval-Valued Intuitionistic Fuzzy Graph

It is observed that the definition of the complement of IVFG did not provide justifiable results on some occasions. The results obtained using the current definition of IVFG leads us to obtain some undefined intervals, and therefore in this section we propose a new definition for the complement of IVFG.

For the first time, the complement of IVFG was defined in [38]. First, we review the existing definition and, with the help of an example, we point out its shortcomings.

Definition 8.

[38] The complement of an IVFG $G=\left(V, E\right)$ is defined by $G^c=\left(V^c, E^c\right)$ where $V^c=V$ and the membership and non-membership grades of $E$ satisfying the conditions:

$$\begin{gathered} {\left({\mathrm{Ŝ}}^L\right)}^c\left(v_i, v_j\right)=\min \left(S^L\left(v_i\right), S^L\left(v_j\right)\right)-{\mathrm{Ŝ}}^L\left(\left(v_i, v_j\right)\right) \\ {\left({\mathrm{Ŝ}}^U\right)}^c\left(v_i, v_j\right)=\min \left(S^U\left(v_i\right), S^U\left(v_j\right)\right)-{\mathrm{Ŝ}}^U\left(v_i, v_j\right) \end{gathered}$$

Example 7.

In the following, consider an IVFG depicted in Figure 8, then based on the existing definition 8, we compute its complement and it is given in Figure 9. It is observed from the Figure 9 that there are undefined intervals which are highlighted in red color.

Figure 8. Interval-valued fuzzy graph.

Figure 9. Complement of graph depicted in Figure 8 based on Definition 8, giving us undefined intervals.

Another definition of the complement of IVFG is defined in [11] which is described as follows:

Definition 9.

[28] The complement of an IVFG $G=\left(V, E\right)$ is defined by $G^c=\left(V^c, E^c\right)$ where $V^c=V$ and the membership functions of $E^c$ satisfies the following:

$$\begin{gathered} {\left({\mathrm{Ŝ}}^L\right)}^c\left(v_i, v_j\right)=\left\{\begin{array}{lll}0& if& S^L\left(v_i, v_j\right)\ge 0\\ \min \left(S^L\left(v_i\right), S^L\left(v_j\right)\right)& if& S^L\left(v_i, v_j\right)=0\end{array}\right\} \\ {\left({\mathrm{Ŝ}}^U\right)}^c\left(v_i, v_j\right)=\left\{\begin{array}{lll}0& if& S^U\left(v_i, v_j\right)\ge 0\\ \min \left(S^U\left(v_i\right), S^U\left(v_j\right)\right)& if& S^U\left(v_i, v_j\right)=0\end{array}\right\} \end{gathered}$$

This definition is not well defined as it is not valid for all types of IVFGs. The problem in this definition of the complement is that it does not possesses the property ${\left(G^c\right)}^c=G$. This is demonstrated in the following example.

Example 8.

The complement of IVFG as exhibited in Figure 8 is depicted in Figure 10 below and it is observed that all the edges have disappeared surprisingly, which seems insignificant. Now, we determine the complement of Figure 10 again and put it on display in Figure 11, which clearly indicates that the basic result of the complement, i.e., ${\left(G^c\right)}^c=G$ , does not hold true for Definition 9.

Figure 10. Complement of Figure 8.

Figure 11. Complement of Figure 10 based on Definition 9.

Moreover, Definition 9 is used to find the complement of a complete IVFG in [28] by Akram and Dudek, where this definition possesses the property of a complement; i.e., ${\left(G^c\right)}^c=G.$ However, we need a definition of a complement which can be used for the entire range of IVFG and not only complete IVFGs; therefore, we develop a new well-defined definition for the complement of IVFGs as follows.

Definition 10.

The complement of IVFG $G=\left(V, E\right)$ is defined by $G^c=\left(V^c, E^c\right)$ where $V^c=V$ and the membership grades of $E$ satisfies the following properties:

$$\begin{array}{l}{\left({\mathrm{Ŝ}}^L\right)}^c\left(v_i, v_j\right)=\min \left(S^L\left(v_i\right), S^L\left(v_j\right)\right)-{\mathrm{Ŝ}}^L\left(\left(v_i, v_j\right)\right)\\ {\left({\mathrm{Ŝ}}^U\right)}^c\left(v_i, v_j\right)=\min \left(S^U\left(v_i\right), S^U\left(v_j\right)\right)-{\mathrm{Ŝ}}^U\left(v_i, v_j\right)+\min \left(S^L\left(v_i\right), S^L\left(v_j\right)\right).\end{array}$$

In the following examples, we not only demonstrate the new definition but also verify that the basic property of the notion of the complement as presented in Definition 10 is available; i.e., ${\left(G^c\right)}^c=G$.

Example 9.

In what follows, Figure 12 represents the complement ofFigure 8 and Figure 13 represents the complement of Figure 12. Hence, as we claimed, the equality ${\left(G^c\right)}^c=G$ holds true for our proposed new definition.

Figure 12. Complement of graph depicted in Figure 8.

Figure 13. The complement of graph depicted in Figure 12.

Now, we develop the definition of the complement for IVIFGs because the existing definition does not make any sense in some cases, as we described for IVFGs.

Definition 11.

The complement of IVIFG $G=\left(V, E\right)$ is defined by $G^c=\left(V^c, E^c\right)$ where $V^c=V$ and the membership and non-membership grades of $E$ satisfied the conditions:

$$\begin{gathered} {\left({\mathrm{Ŝ}}^L\right)}^c\left(v_i, v_j\right)=\min \left(S^L\left(v_i\right), S^L\left(v_j\right)\right)-{\mathrm{Ŝ}}^L\left(\left(v_i, v_j\right)\right). \\ {\left({\mathrm{Ŝ}}^U\right)}^c\left(v_i, v_j\right)=\min \left(S^U\left(v_i\right), S^U\left(v_j\right)\right)-{\mathrm{Ŝ}}^U\left(v_i, v_j\right)+\min \left(S^L\left(v_i\right), S^L\left(v_j\right)\right). \\ {\left({\mathrm{Ð}}^L\right)}^c\left(v_i, v_j\right)=\max \left(D^L\left(v_i\right), D^L\left(v_j\right)\right)-{\mathrm{Ð}}^L\left(\left(v_i, v_j\right)\right). \\ {\left({\mathrm{Ð}}^U\right)}^c\left(v_i, v_j\right)=\max \left(D^U\left(v_i\right), D^U\left(v_j\right)\right)-{\mathrm{Ð}}^U\left(v_i, v_j\right)+\max \left(D^L\left(v_i\right), D^L\left(v_j\right)\right). \end{gathered}$$

Example 10.

Consider the following IVIFGs whose graph is shown in Figure 14 while its complement graph is shown in Figure 15. Moreover, through some easy calculations, one can easily verify that${\left(G^c\right)}^c=G$.

Figure 14. Interval-valued intuitionistic fuzzy graph.

Figure 15. Complement of IVIFG depicted in Figure 14.

In the next section, we discuss the limitations of SVNGS, IVNGs, and their complements. In addition, we develop some new valid definitions.

5. Improvements in Single-Valued Neutrosophic Graphs and Interval-Valued Neutrosophic Graphs

In this section, we study the SVNGs proposed in [26] and IVNGs developed in [48] and we describe their shortcomings with some examples. Then, a new definition is proposed for both SVNGs and IVNGs, and their complement is discussed. In support of these new definitions, we present some examples.

Definition 12.

[43] An SVNG is a pair $G=\left(V, E\right)$ where $V$ is the set of nodes and $E$ is the collection of edges between these nodes such that

(1) 

Every$v\in V$is characterized by three functions$S:V\to \left[0, 1\left], I:V\to \right[0, 1\right]$and$D:V\to \left[0, 1\right]$denoting the membership, neutral and non-membership grades of$v\in V$which satisfy$0\le S+I+D\le 3$;

(2) 

Every$e\in E$is characterized by three functions$\mathrm{Ŝ}:V\times V\to \left[0, 1\left], \mathrm{Î}:V\times V\to \right[0, 1\right]$and$\mathrm{Ð}:V\times V\to \left[0, 1\right]$denoting the membership, neutral and non-membership grades of$e\in V\times V$satisfies

$$\begin{gathered} \mathrm{Ŝ}\left(v_i, v_j\right)\le \min \left(S\left(v_i\right), S\left(v_j\right)\right) \\ \mathrm{Î}\left(v_i, v_j\right)\ge \max \left(I\left(v_i\right), I\left(v_j\right)\right) \\ \mathrm{Ð}\left(v_i, v_j\right)\ge \max \left(D\left(v_i\right), D\left(v_j\right)\right) \end{gathered}$$

which satisfy the inequality$0\le \mathrm{Ŝ}+\mathrm{Î}+\mathrm{Ð}\le 3$.

It is observed that this definition is not suitable and needs to be modified for two reasons. The first reason lies in the fact that as SVNG is a generalization of IFG, by exempting the indeterminacy value, Definition 12 should reduce to Definition 3. However, this does not happen, as the non-membership degree of an edge in IFG and in SVNG are defined in a different way; i.e., the non-membership degree for IFG is defined as $\mathrm{Ð}\left(v_i, v_j\right)\le \max \left(D\left(v_i\right), D\left(v_j\right)\right)$ while in case of SVNGs it is defined as $\mathrm{Ð}\left(v_i, v_j\right)\ge \max \left(D\left(v_i\right), D\left(v_j\right)\right)$.

The second reason is based on the definition of complement of SVNGs, as the complement of an SVNG needs to be an SVNG, which did not happen on some occasions. We present the current definition of the complement of an SVNG and with the help of an example describe that the complement of an SVNG is not well defined.

Definition 13.

[43] The complement of an SVNG $G=\left(V, E\right)$ is defined by $G^c=\left(V^c, E^c\right)$ where $V^c=V$ and the membership, neutral value and non-membership grades of $E$ satisfy the conditions:

$$\begin{gathered} {\left(\mathrm{Ŝ}\right)}^c\left(v_i, v_j\right)=\min \left(S\left(v_i\right), S\left(v_j\right)\right)-\mathrm{Ŝ}\left(\left(v_i, v_j\right)\right). \\ {\left(\mathrm{Î}\right)}^c\left(v_i, v_j\right)=\max \left(I\left(v_i\right), I\left(v_j\right)\right)-\mathrm{Î}\left(\left(v_i, v_j\right)\right). \\ {\left(\mathrm{Ð}\right)}^c\left(v_i, v_j\right)=\max \left(D\left(v_i\right), D\left(v_j\right)\right)-\mathrm{Ð}\left(\left(v_i, v_j\right)\right). \end{gathered}$$

Keep in mind Definition 13 and consider the following example, where the complement of an SVNG does not remain an SVNG. All this leads to some modification in the basic definition of SVNG which not only generalizes an IFG but is also compatible to satisfy the basic properties of taking complements.

Example 11.

In the following figures, Figure 16 represents SVNGs and Figure 17 represents their complement. It is clear from Figure 17 that the complement of an SVNG is not an SVNG.

Figure 16. Single-valued neutrosophic graph.

Figure 17. Complement of the SVNG depicted in Figure 16.

Now, we present a new definition for SVNG as a generalization of IFG which is well-defined.

Definition 14.

An SVNG is a pair $G=\left(V, E\right)$ where $V$ is the set of nodes and $E$ is the collection of edges between these nodes such that

1. 

Every$v\in V$is characterized by three functions$S:V\to \left[0, 1\left], I:V\to \right[0, 1\right]$and$D:V\to \left[0, 1\right]$denoting the membership, neutral and non-membership grades of$v\in V$which satisfy the inequality$0\le S+I+D\le 3$.;

2. 

Every$e\in E$is characterized by three functions$\mathrm{Ŝ}:V\times V\to \left[0, 1\left], \mathrm{Î}:V\times V\to \right[0, 1\right]$and$\mathrm{Ð}:V\times V\to \left[0, 1\right]$denoting the membership, neutral and non-membership grades of$e\in V\times V$satisfying

$$\begin{gathered} \mathrm{Ŝ}\left(v_i, v_j\right)\le \min \left(S\left(v_i\right), S\left(v_j\right)\right) \\ \mathrm{Î}\left(v_i, v_j\right)\le \max \left(I\left(v_i\right), I\left(v_j\right)\right) \\ \mathrm{Ð}\left(v_i, v_j\right)\le \max \left(D\left(v_i\right), D\left(v_j\right)\right) \end{gathered}$$

provided that$0\le \mathrm{Ŝ}+\mathrm{Î}+\mathrm{Ð}\le 3$.

Example 12.

In the following figures, Figure 18 represents an SVNG compatible with the new definition and Figure 19 represents the complement of the SVNG depicted in Figure 18.

Figure 18. Single-valued neutrosophic graph.

Figure 19. Complement of the graph depicted in Figure 18.

Likewise, in SVNGs the same kinds of flaw exist in the definition of IVNGs. First, we present the existing definition of IVNG and point out its limitation with the help of an example. Then, we develop the new definition for IVNG and support it with an example. After developing the new definition for IVNGs, we discuss the concept of complements for IVNGs by considering the defects in forming complements of IVFG and IVIFG.

Definition 15.

[48] An IVNG is a pair $G=\left(V, E\right)$ where $V$ is the set of nodes and $E$ is the collection of edges between these nodes such that

1. 

Every$v\in V$is characterized by three functions$S, I$and$D$denoting the membership, neutral and non-membership grades of$v\in V$. Basically,$S=\left[S^L, S^U\right], I=\left[I^L, I^U\right]$and$D=\left[D^L, D^U\right]$are closed subintervals of the unit interval [0, 1] which satisfy the inequality$0\le S^U+I^U+D^U\le 3$.;

2. 

Every$e\in E$is characterized by three functions$\mathrm{Ŝ}, \mathrm{Î}$and$\mathrm{Ð}$denoting the membership, neutral and non-membership grades of$e\in V\times V$. Basically,$\mathrm{Ŝ}=\left[{\mathrm{Ŝ}}^L, {\mathrm{Ŝ}}^L\right], \mathrm{Î}=\left[{\mathrm{Î}}^L, {\mathrm{Î}}^U\right]$and$\mathrm{Ð}=\left[{\mathrm{Ð}}^L, {\mathrm{Ð}}^L\right]$are such that:

$$\begin{array}{cc}{\mathrm{Ŝ}}^L\left(v_i, v_j\right)\le \min \left(S^L\left(v_i\right), S^L\left(v_j\right)\right)& {\mathrm{Ŝ}}^U\left(v_i, v_j\right)\le \min \left(S^U\left(v_i\right), S^U\left(v_j\right)\right)\\ {\mathrm{Î}}^L\left(v_i, v_j\right)\ge \max \left(I^L\left(v_i\right), I^L\left(v_j\right)\right)& {\mathrm{Î}}^U\left(v_i, v_j\right)\ge \max \left(I^U\left(v_i\right), I^U\left(v_j\right)\right)\\ {\mathrm{Ð}}^L\left(v_i, v_j\right)\ge \max \left(D^L\left(v_i\right), D^L\left(v_j\right)\right)& {\mathrm{Ð}}^U\left(v_i, v_j\right)\ge \max \left(D^U\left(v_i\right), D^U\left(v_j\right)\right)\end{array}$$

which satisfy the inequality$0\le {\mathrm{Ŝ}}^U+{\mathrm{Î}}^U+{\mathrm{Ð}}^U\le 3$.

Likewise, IVFG and IVIFG are defined, and Definition 15 sometime leads to undefined closed sub-intervals as shown in the following example.

Example 13.

Consider the following example of an IVNG as exhibited in Figure 20 based on Definition 15, leading us to some undefined intervals.

Figure 20. Interval-valued neutrosophic graph with undefined intervals.

Now, we present a new definition of IVNG as follows.

Definition 16.

An IVNG is a pair $G=\left(V, E\right)$ where $V$ is the set of nodes and $E$ is the collection of edges between these nodes such that

(1) 

Every$v\in V$is characterized by three functions$S, I$and$D$denoting the membership, neutral and non-membership grades of$v\in V$. Basically,$S=\left[S^L, S^U\right], I=\left[I^L, I^U\right]$and$D=\left[D^L, D^U\right]$are closed subintervals of the unit interval [0, 1] with a condition that$0\le S^U+I^U+D^U\le 3$.;

(2) 

Every$e\in E$is characterized by three functions$\mathrm{Ŝ}, \mathrm{Î}$and$\mathrm{Ð}$denoting the membership, neutral and non-membership grades of$e\in V\times V$. Basically$\mathrm{Ŝ}=\left[{\mathrm{Ŝ}}^L, {\mathrm{Ŝ}}^L\right], \mathrm{Î}=\left[{\mathrm{Î}}^L, {\mathrm{Î}}^U\right]$and$\mathrm{Ð}=\left[{\mathrm{Ð}}^L, {\mathrm{Ð}}^L\right]$are such that

$$\begin{array}{cc}{\mathrm{Ŝ}}^L\left(v_i, v_j\right)\le \min \left(S^L\left(v_i\right), S^L\left(v_j\right)\right)& {\mathrm{Ŝ}}^U\left(v_i, v_j\right)\le \min \left(S^U\left(v_i\right), S^U\left(v_j\right)\right)\\ {\mathrm{Î}}^L\left(v_i, v_j\right)\le \max \left(I^L\left(v_i\right), I^L\left(v_j\right)\right)& {\mathrm{Î}}^U\left(v_i, v_j\right)\le \max \left(I^U\left(v_i\right), I^U\left(v_j\right)\right)\\ {\mathrm{Ð}}^L\left(v_i, v_j\right)\le \max \left(D^L\left(v_i\right), D^L\left(v_j\right)\right)& {\mathrm{Ð}}^U\left(v_i, v_j\right)\le \max \left(D^U\left(v_i\right), D^U\left(v_j\right)\right)\end{array}$$

provided that${\mathrm{Ŝ}}^U\left(v_i, v_j\right)\le {\mathrm{Ŝ}}^L\left(v_i, v_j\right)$,${\mathrm{Î}}^L\left(v_i, v_j\right)\le {\mathrm{Î}}^U\left(v_i, v_j\right)$,${\mathrm{Ð}}^L\left(v_i, v_j\right)\le {\mathrm{Ð}}^U\left(v_i, v_j\right)$and$0\le {\mathrm{Ŝ}}^U+{\mathrm{Î}}^U+{\mathrm{Ð}}^U\le 3$.

Example 14.

Consider the graph depicted in Figure 21 demonstrating the new definition of IVNGs.

Figure 21. Interval-valued neutrosophic graph with undefined intervals.

Next, we discuss the existing definition for taking the complement of IVNG and show its limitations with the help of examples. Then, we propose a new definition for the complement of IVNG as the existing definition leads us to some undefined intervals.

Definition 17.

[48] The complement of IVNG $G=\left(V, E\right)$ is defined by $G^c=\left(V^c, E^c\right)$ where $V^c=V$ and the membership, abstinence and non-membership grades of $E$ satisfy

$$\begin{array}{c}{\left({\mathrm{Ŝ}}^L\right)}^c\left(v_i, v_j\right)=\min \left(S^L\left(v_i\right), S^L\left(v_j\right)\right)-{\mathrm{Ŝ}}^L\left(\left(v_i, v_j\right)\right).\\ {\left({\mathrm{Ŝ}}^U\right)}^c\left(v_i, v_j\right)=\min \left(S^U\left(v_i\right), S^U\left(v_j\right)\right)-{\mathrm{Ŝ}}^U\left(v_i, v_j\right).\\ {\left({\mathrm{Î}}^L\right)}^c\left(v_i, v_j\right)=\max \left(I^L\left(v_i\right), I^L\left(v_j\right)\right)-{\mathrm{Î}}^L\left(\left(v_i, v_j\right)\right).\\ {\left({\mathrm{Î}}^U\right)}^c\left(v_i, v_j\right)=\max \left(I^U\left(v_i\right), I^U\left(v_j\right)\right)-{\mathrm{Î}}^U\left(v_i, v_j\right).\\ {\left({\mathrm{Ð}}^L\right)}^c\left(v_i, v_j\right)=\max \left(D^L\left(v_i\right), D^L\left(v_j\right)\right)-{\mathrm{Ð}}^L\left(\left(v_i, v_j\right)\right).\\ {\left({\mathrm{Ð}}^U\right)}^c\left(v_i, v_j\right)=\max \left(D^U\left(v_i\right), D^U\left(v_j\right)\right)-{\mathrm{Ð}}^U\left(v_i, v_j\right).\end{array}$$

Example 15.

The following IVNG depicted in Figure 22 shows that the Definition 17 for the complement of IVNG leads us to some undefined intervals.

Figure 22. Complement of the Interval-valued neutrosophic graph by Definition 15.

As the IVNG is a generalization of IVFG and IVIFG, its complement defined in [31] is not well-defined; therefore, we propose a new definition for the complement of IVNG as follows.

Definition 18.

The complement of IVNG $G=\left(V, E\right)$ is defined by $G^c=\left(V^c, E^c\right)$ where $V^c=V$ and the membership, abstinence and non-membership grades of $E$ are satisfying the conditions:

$$\begin{gathered} {\left({\mathrm{Ŝ}}^L\right)}^c\left(v_i, v_j\right)=\min \left(S^L\left(v_i\right), S^L\left(v_j\right)\right)-{\mathrm{Ŝ}}^L\left(\left(v_i, v_j\right)\right). \\ {\left({\mathrm{Ŝ}}^U\right)}^c\left(v_i, v_j\right)=\min \left(S^U\left(v_i\right), S^U\left(v_j\right)\right)-{\mathrm{Ŝ}}^U\left(v_i, v_j\right)+\min \left(S^L\left(v_i\right), S^L\left(v_j\right)\right). \\ {\left({\mathrm{Î}}^L\right)}^c\left(v_i, v_j\right)=\max \left(I^L\left(v_i\right), I^L\left(v_j\right)\right)-{\mathrm{Î}}^L\left(\left(v_i, v_j\right)\right). \\ {\left({\mathrm{Î}}^U\right)}^c\left(v_i, v_j\right)=\max \left(I^U\left(v_i\right), I^U\left(v_j\right)\right)-{\mathrm{Î}}^U\left(v_i, v_j\right)+\max \left(I^L\left(v_i\right), I^L\left(v_j\right)\right). \\ {\left({\mathrm{Ð}}^L\right)}^c\left(v_i, v_j\right)=\max \left(D^L\left(v_i\right), D^L\left(v_j\right)\right)-{\mathrm{Ð}}^L\left(\left(v_i, v_j\right)\right). \\ {\left({\mathrm{Ð}}^U\right)}^c\left(v_i, v_j\right)=\max \left(D^U\left(v_i\right), D^U\left(v_j\right)\right)-{\mathrm{Ð}}^U\left(v_i, v_j\right)+\max \left(D^L\left(v_i\right), D^L\left(v_j\right)\right). \end{gathered}$$

Example 16.

Consider the following IVNGs shown in Figure 23 and its complement graph is depicted in Figure 24. Through some easy calculation, one can easily verify that${\left(G^c\right)}^c=G$.

Figure 23. Interval-valued neutrosophic graph.

Figure 24. Complement of the graph depicted in Figure 23.

So far in our study, we have developed the theory of IVFGs and its generalizations, providing examples that explained the limitations in the existing definitions and the fitness of the new definitions.

Remark 1.

The work proposed is applicable whether the graphs are directed or undirected.

Now, a real-life application is presented to show the feasibility of the proposed work. The process of ranking universities is explained based on SVNGs.

6. Illustrative Example

The higher education commission (HEC) of Pakistan needed to evaluate the Pakistani universities from research perspectives. HEC Pakistan planned to give away some financial support to those universities whose research was comparatively better. A university with a good research score will earn greater financial support. Here, we shall discuss the case of the federal capital Islamabad. Four universities, $z_1, z_2, z_3$ and $z_4$, from Islamabad are chosen, representing Quaid e Azam university, National University of Science and Technology, Comsats university and International Islamic University Islamabad. The criterion for the ranking of universities is ‘’research productivity’’. The members of the quality assurance cell (QEC) of HEC provide their information in the form of single-valued neutrosophic preference relations (SVNPRs) as given in Figure 25. The weight vector corresponding to the them is given by $w={\left(0.3,0.2,0.3,0.2\right)}^T$. The detailed steps of algorithm for this process are explained followed by stepwise calculations of this problem.

Figure 25. Directed network with single-valued neutrosophic information.

Steps of the algorithm:

Step 1: 

Establishing SVNPRs: This step involves the evaluation of objects by decision-makers in the form of SVNGs;

Step 2: 

The SVNPRs form a relational matrix known as the single-valued neutrosophic relational matrix (SVNRM) denoted by $\mathrm{Ṙ}M={\left(m{\mathrm{ṙ}}_{ij}\right)}_{n\times n}$ where $\mathrm{Ṙ}{m}_{ij}=\left(S_{ij}, I_{ij}, D_{ij}\right)$ such that $\mathrm{Ṙ}0\le S_{ij}, I_{ij}, D_{ij}\le 1$ and $\mathrm{Ṙ}{S}_{ij}+I_{ij}+ D_{ij}\le 3$;

Step 3: 

Aggregating the different preferences by using the weighted averaging aggregation operator named as single-valued neutrosophic weighted averaging (SVNWA) operators [8] as follows:

$$m{\mathrm{ṙ}}_i=SVNWA\left(m{\mathrm{ṙ}}_{i1},m{\mathrm{ṙ}}_{i2},\dots ,m{\mathrm{ṙ}}_{in}\right)=\left(1-{\displaystyle \prod }_{j=1}^n{\left(1-S_{ij}\right)}^{w_j},{\left({\displaystyle \prod }_{j=1}^n{I}_{ij}\right)}^{w_j},{\left({\displaystyle \prod }_{j=1}^n{D}_{ij}\right)}^{w_j}\right)$$

where $w_j$ is the weight vector for each preference such that $w_j>0$ and ${\displaystyle \sum }_{j=1}^n{w}_j=1$;

Step 4: 

Computing the score value of the aggregated number $m_i=\left(S_i, I_i, D_i\right) \left(i=1,2,\dots , n\right)$ by using the score function

$$S\left(m_i\right)=\frac{S_i+ 1-I_i+ 1-D_i}{3};$$

Step 5: 

Ranking all the alternatives based on the descending order of the score values.

Now, by applying the above-mentioned steps to the considered data, we summarized their computational steps as below:

Step 1: 

The information from QEC of HEC Pakistan related to each university is taken in the form of SVNGs and summarized in Figure 25.

Here, the importance of a new definition of an SVNG is clear. In decision-making problems, we usually have two types of attributes, known as attributes of cost type and of benefit types. In the case that the attributes are of cost types, the data is normalized using the definition of complement of SVNGs. Therefore, if we utilize the existing definition of SVNGs and their complement as we have done in Example 11, we obtain some undefined results. The case is similar with other structures. All this shows the importance of the new proposed definitions of several fuzzy graphs and their complements.

Step 2: 

From the SVNPRs provided in Figure 25, we have the following relational matrix.

$$M\mathrm{Ṙ}={\left(m{\mathrm{ṙ}}_{ij}\right)}_{4\times 4}=\left(\begin{array}{ccc}\left(0.5,0.5,0.5\right)& \left(0.3,0.4,0.5\right)& \left(0.4,0.2,0.3\right)\\ \left(0.3,0.4,0.5\right)& \left(0.5,0.5,0.5\right)& \left(0.2,0.4,0.4\right)\\ \begin{array}{c}\left(0.2,0.4,0.1\right)\\ \left(0.3,0.3,0.1\right)\end{array}& \begin{array}{c}\left(0.3,0.3,0.4\right)\\ \left(0.3,0.2,0.3\right)\end{array}& \begin{array}{c}\left(0.5,0.5,0.5\right)\\ \left(0.3,0.1,0.3\right)\end{array}\end{array}\begin{array}{c}\left(0.4,0.2,0.2\right)\\ \left(0.1,0.4,0.5\right)\\ \begin{array}{c}\left(0.1,0.5,0.3\right)\\ \left(0.5,0.5,0.5\right)\end{array}\end{array}\right)$$

Step 3: 

Using single-valued neutrosophic weighted averaging operators on the relational matrix to aggregate the data,

$$m{\mathrm{ṙ}}_i=SVNWA\left(m{\mathrm{ṙ}}_{i1},m{\mathrm{ṙ}}_{i2},\dots ,m{\mathrm{ṙ}}_{in}\right)=\left(1-{\displaystyle \prod }_{j=1}^n{\left(1-S_{ij}\right)}^{w_j},{\left({\displaystyle \prod }_{j=1}^n{I}_{ij}\right)}^{w_j},{\left({\displaystyle \prod }_{j=1}^n{D}_{ij}\right)}^{w_j}\right)$$

and the aggregated values are obtained as

$$\begin{gathered} m{\mathrm{ṙ}}_1=\left(0.414150269, 0.3024252, 0.3571309\right); \\ \mathrm{ṙ}{m}_2=\left(0.283693469, 0.4182558, 0.4676242\right); \\ \mathrm{ṙ}{m}_3=\left(0.307394227, 0.4222088, 0.2663957\right); \\ \mathrm{ṙ}{m}_4=\left(0.345556087, 0.2203618, 0.2389762\right). \end{gathered}$$

Step 4: 

The score values of the aggregated data are obtained as

$$S\left(m_1\right)=0.584864723,\mathrm{ṣ}S\left(m{\mathrm{ṙ}}_2\right)=0.465937823,S\mathrm{ṣ}\left(m{\mathrm{ṙ}}_3\right)=0.539596576,\mathrm{ṣ}S\left(m{\mathrm{ṙ}}_4\right)=0.62873936$$

Step 5: 

Since $S\left(m_4\right)>S\left(m_1\right)>S\left(m_3\right)>S\left(m_2\right)$, we obtained the ranking order of the given universities as $z_4\succ z_1\succ z_3\succ z_2$, where $\succ$ refers to “preferred to’’. Thus, the ranking results indicate that International Islamic University Islamabad performs best in research productivity among the four universities of federal capital of Islamabad in the evaluation of the quality assurance cell of HEC.

7. Conclusions

In this manuscript, we successfully pointed out the shortcomings in the current definitions of IVFG, IVIFG with the help of examples and developed a new improved definition for these concepts. It is also discussed that the current definitions of complements for IVFG and IVIFG lead us to some undefined results; therefore, some new definitions for complements of IVFG and IVIFG are proposed and supported by examples. Further, it is observed that the definition of SVNG has some serious flaws, described by examples. Thus, a new modified definition for SVNG has been developed and supported by some examples. The concept of IVNG is also modified, and the validity of the modified definition is tested with examples. Throughout this article, we defined all those terms which were not previously defined well. In the near future, we shall investigate some other results of IVFGs, IVIFG, IVNG, SVNGs and extend them to solve decision-making problems under fuzzy or uncertain environments [52,53,54,55,56,57,58].