Abstract
A graph structure is a generalization of simple graphs. Graph structures are very useful tools for the study of different domains of computational intelligence and computer science. In this research paper, we introduce certain notions of intuitionistic neutrosophic graph structures. We illustrate these notions by several examples. We investigate some related properties of intuitionistic neutrosophic graph structures. We also present an application of intuitionistic neutrosophic graph structures.
MSC:
03E72; 05C72; 05C78; 05C99
1. Introduction
Fuzzy graph models are advantageous mathematical tools for dealing with combinatorial problems of various domains including operations research, optimization, social science, algebra, computer science, environmental science and topology. Fuzzy graphical models are obviously better than graphical models due to natural existence of vagueness and ambiguity. Initially, we needed fuzzy set theory to cope with many complex phenomenons having incomplete information. Fuzzy set theory [1] is a very strong mathematical tool for solving approximate reasoning related problems. These notions describe complex phenomenons very well, which are not properly described using classical mathematics. Atanassov [2] generalized the fuzzy set theory by introducing the notion of intuitionistic fuzzy sets. The intuitionistic fuzzy sets have more describing possibilities as compared to fuzzy sets. An intuitionistic fuzzy set is inventive and more useful due to the existence of non-membership degree. In many situations like information fusion, indeterminacy is explicitly quantified. Smarandache [3] introduced the concept of neutrosophic sets, and he combined the tricomponent logic, non-standard analysis, and philosophy. It is a branch of philosophy which studies the origin, nature and scope of neutralities as well as their interactions with different ideational spectra. Three independent components of neutrosophic set are: truth value, indeterminacy value and falsity value [3]. For convenient use of neutrosophic sets in real-life phenomena, Wang et al. [4] proposed single valued neutrosophic sets, which is a generalization of intuitionistic fuzzy sets [2] and has three independent components having values in a standard unit interval [0, 1]. Ye [5,6,7,8] proposed several multi criteria decision-making methods based on neutrosophic sets. Bhowmik and Pal [9,10] introduced the notion of intuitionistic neutrosophic sets.
Kauffman [11] introduced fuzzy graphs on the basis of Zadeh’s fuzzy relations [12]. Rosenfeld [13] discussed fuzzy analogue of many graph-theoretic notions. Later on, Bhattacharya [14] gave some remarks on fuzzy graphs. The complement of a fuzzy graph was defined by Sunitha and Vijayakumar [15]. Bhutani and Rosenfeld studied the notion of M-strong fuzzy graphs and their properties in [16]. Parvathi et al. defined operations on intuitionistic fuzzy graphs in [17]. Akram and Shahzadi [18] introduced neutrosophic soft graphs with applications. Dinesh and Ramakrishnan [19] introduced the notion of fuzzy graph structures and discussed some related properties. Akram and Akmal [20] introduced the concept of bipolar fuzzy graph structures. Recently, Akram and Sitara [21] introduced the concept of intuitionistic neutrosophic graph structures. Several notions’ graph structures have been studied by the same authors in [22,23,24,25,26,27]. In this research paper, we introduce certain notions of intuitionistic neutrosophic graph structures and illustrate these notions by examples. We also present an application of intuitionistic neutrosophic graph structures in decision-making. For other notations and applications, readers are referred to [28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45] .
2. Intuitionistic Neutrosophic Graph Structures
Sampathkumar [46] introduced the graph structure, which is a generalization of an undirected graph and is quite useful in studying some structures like graphs, signed graphs, labeled graphs and edge colored graphs.
Definition 1.
[46] A graph structure consists of a non-empty set V together with relations on V, which are mutually disjoint such that each , is symmetric and irreflexive.
One can represent a graph structure in the plane, just like a graph where each edge is labeled as , .
Definition 2.
[3] An ordered triple in in the universe of discourse V is called neutrosophic set, where , , : V→, and their sum is without any restriction.
Definition 3.
[4] An ordered triple in in a universe of discourse V is called single-valued neutrosophic set, where , , : V→, and their sum is restricted between 0 and 3.
Definition 4.
[47] Let V be a fixed set. A generalized intuitionistic fuzzy set I of V is an object having the form I=, where the functions and define the degree of membership and degree of nonmembership of an element , respectively, such that
Definition 5.
[9,10] An intuitionistic neutrosophic set can be stated as a set having the form , where
and .
Definition 6.
Let = be a graph structure(GS), and then = is called an intuitionistic neutrosophic graph structure (INGS), if O = and = are intuitionistic neutrosophic sets on P and , respectively, such that
- 1.
- , ,
- 2.
- 3.
- , , ,
where O is an underlying vertex set of and (h = 1, 2, …, r ) are underlying h-edge sets of .
Example 1.
Consider a GS = such that O, , are IN subsets of , respectively, where
Through direct calculations, it is easy to show that = is an INGS of as represented in Figure 1.
Figure 1.
An intuitionistic neutrosophic graph structure.
Definition 7.
Let = be an INGS of . If = is an INGS of such that
Then, is said to be an intuitionistic neutrosophic (IN) subgraph structure of INGS .
Example 2.
Consider an INGS = of GS = as represented in Figure 2. Through routine calculations, it can be easily shown that is an IN subgraph structure of INGS .
Figure 2.
IN subgraph structure.
Definition 8.
An INGS = is called an IN induced-subgraph structure of by Q ⊆ P if
Example 3.
Figure 3.
An IN induced-subgraph structure.
Definition 9.
An INGS = is said to be a IN spanning-subgraph structure of if and
Example 4.
Figure 4.
An IN spanning-subgraph structure.
Definition 10.
Let = be an INGS. Then, is named as a IN -edge or shortly -edge, if or or or all these conditions are satisfied. As a result, support of is:
.
Definition 11.
-path in an INGS = is a sequence of distinct vertices (except ) in P, such that is an IN -edge .
Definition 12.
An INGS = is -strong for any if
. If is -strong for all , then is a strong INGS.
Example 5.
Consider an INGS = as represented in Figure 5. Then, is strong INGS, as it is and .
Figure 5.
A strong INGS.
Definition 13.
An INGS = is a complete INGS, if
- 1.
- is strong INGS.
- 2.
- , for all h = 1, 2, …, r.
- 3.
- For all , is a for some h.
Example 6.
Let = be an INGS of GS = , such that
By means of direct calculations, it is easy to show that is strong INGS.
Moreover, , , , and every pair of vertices of P, is -edge or -edge or an -edge. Hence, is a complete INGS, that is, -complete INGS.
Definition 14.
Let = be an INGS. The truth strength , falsity strength , and indeterminacy strength of an -path, = is defined as:
Example 7.
Consider an INGS = as in Figure 6. We found an -path = . So, = 0.2, = 0.1 and = 0.5.
Figure 6.
A complete INGS.
Definition 15.
Let = be an INGS. Then,
- -strength of connectedness of truth between k and l is defined as: = , such that = for and = = .
- -strength of connectedness of indeterminacy between k and l is defined as: = , such that = for and = = .
- -strength of connectedness of falsity between k and l is defined as: = , such that = for and = = .
Definition 16.
An INGS = is called an -cycle if , is an .
Definition 17.
An INGS = is an IN fuzzy -cycle (for any h) if
- 1.
- is an -cycle.
- 2.
- There exists no unique -edge in such thator or
Example 8.
Consider an INGS = as in Figure 6. Then, is an -cycle and IN fuzzy , since is an -cycle and no unique -edge satisfies the condition: or or
Definition 18.
Let = be an INGS and k a vertex in . Let be an IN subgraph structure of induced by such that
, = 0 = edges ; , , , ; = , = , = .
Then, k is IN fuzzy cut-vertex, for some h, if
and
Note that k is an IN fuzzy cut-vertex, if , IN fuzzy cut-vertex, if and IN fuzzy cut-vertex, if .
Example 9.
Consider an INGS = as represented in Figure 7 and = is an IN subgraph structure of an INGS , and we found it by deleting the vertex . The vertex is an IN fuzzy -I cut-vertex, since , and .
Figure 7.
An INGS .
Definition 19.
Let = be an INGS and an .
Let be an IN fuzzy spanning-subgraph structure of , such that
= 0 = = , = , = , = , ∀ edges .
Then, is an IN fuzzy -bridge if
, and , for some .
Note that is an IN fuzzy bridge if , IN fuzzy bridge if and IN fuzzy bridge if .
Example 10.
Consider an INGS = as shown in Figure 7 and = is IN spanning-subgraph structure of an INGS found by the deletion of -edge . Edge is an IN fuzzy -bridge. As = = , = = , = =
Definition 20.
An INGS = is an -tree, if is an . Alternatively, is an -tree, if there is a subgraph of induced by , which forms a tree.
Definition 21.
An INGS = is an IN fuzzy -tree if has an IN fuzzy spanning-subgraph structure = such that, for all -edges not in ,
is an -tree, and , , .
In particular, is an IN fuzzy -T tree if , an IN fuzzy -I tree if
, and an IN fuzzy -F tree if .
Example 11.
Consider an INGS = as shown in Figure 8. It is an -tree, not an -tree but it is IN fuzzy -tree because it has an IN fuzzy-spanning subgraph as an -tree, which is found by the deletion of -edge from . Moreover, , and
Figure 8.
An IN fuzzy O1-tree.
Definition 22.
An INGS = of graph structure = is said to be isomorphic to an INGS = of the graph structure = , if there is a pair , where is a bijective mapping and ψ is any permutation on this set such that;
, h = 1,2,…,r.
Example 12.
Let = and = be two INGSs as shown in the Figure 9.
Figure 9.
Two isomorphic INGSs.
and are isomorphic under , where is a bijective mapping and ψ is the permutation on , which is defined as , , and the following conditions hold:
and
,
Definition 23.
An INGS = of the graph structure = is identical with an INGS = of the graph structure = if is a bijective mapping such that
,
Example 13.
Let = and = be two INGSs of the GSs = , = , respectively, as they are shown in Figure 10 and Figure 11.
Figure 10.
An INGS .
Figure 11.
An INGS .
SVINGSs and are identical under is defined as :
, , , , , , , .
Moreover, = , = , = , and = , = , = , , .
Definition 24.
Let = be an INGS and ψ is any permutation on and on set , that is, if and only if . If , for any h and
= , = ,
= , , then, , where t is chosen such that
, , . In addition, INGS is called a ψ-complement of an INGS , and it is symbolized as .
Example 14.
Let , , , be IN subsets of P, , , , respectively.
Thus, = is an INGS of GS = . Let = , = , = , where ψ is permutation on . Now, for , respectively:
, , , , , , , , . So ,
, , , , , , , , . So ,
, , , , , , , , . This shows .
Hence, = is a ψ-complement of an INGS as presented in Figure 12.
Figure 12.
INGSs , .
Proposition 1.
A ψ-complement of an INGS = is a strong INGS. Moreover, if , where ; then, all -edges in an INGS become -edges in .
Proof.
As , and .
.
Hence, .
Furthermore, gets a maximum value, when is zero. Clearly, when and is an -edge, then attains zero value. Hence,
Similarly, for I, the results are:
Since , and .
.
Therefore, ∀ i.
Value of the is maximum when gets zero value. Clearly, when and is an -edge, then is zero. Thus,
On a similar basis for F in -complement, the results are:
Since , and .
.
Hence, .
Furthermore, is maximum, when is zero. Definitely, when and is an -edge, then is zero. Hence,
Definition 25.
Let be an INGS and ψ be any permutation on . Then,
- (i)
- is a self-complementary INGS if is isomorphic to ;
- (ii)
- is a strong self-complementary INGS if is identical to .
Definition 26.
Let = be an INGS. Then,
- (i)
- is a totally self-complementary INGS if is isomorphic to , ∀ permutations ψ on ;
- (ii)
- is a totally-strong self-complementary INGS if is identical to , ∀ permutations ψ on .
Example 15.
INGS = in Figure 13 is totally-strong self-complementary INGS.
Figure 13.
Totally-strong self-complementary INGS.
Theorem 1.
A strong INGS is a totally self-complementary INGS and vice versa.
Proof.
Consider any strong INGS and Permutation on {1,2, …, r}. By proposition 1, -complement of an INGS = is a strong INGS. Moreover, if , where , then all -edges in an INGS become -edges in , this leads
Therefore, under (identity mapping), and are isomorphic, such that
and
, for ; h,t = .
For each permutation on , this holds. Hence, is a totally self-complementary INGS.
Conversely, let is isomorphic to for each permutation on . Then, by definitions of -complement of INGS and isomorphism of INGS, we have
, t = 1,2,...,r. Hence, is strong INGS.
◻
Remark 1.
Each self-complementary INGS is a totally self-complementary INGS.
Theorem 2.
If = is a totally strong self-complementary GS and is an IN subset of P, where are the constant functions, then any strong INGS of with IN vertex set O is necessarily totally-strong self-complementary INGS.
Proof.
Let u, v and w be three constants, and
Since is a totally strong self-complementary GS, so, for each permutation on there exists a bijective mapping , such that, for each -edge , (g(k)g(l)) [a -edge in ] is a -edge in . Thus, for every -edge , (g(k)g(l)) [an -edge in ] is an -edge in .
Moreover, is a strong INGS, so
and
, .
This shows that is a strong self-complementary INGS. This exists for each permutation and on set , thus is a totally strong self-complementary INGS. Hence, required proof is obtained.
◻
Remark 2.
Converse of the Theorem 2 may or may not true, as an INGS shown in Figure 2 is totally strong self-complementary INGS, and it is also a strong INGS with a totally strong self-complementary underlying GS but , , are not the constant-valued functions.
3. Application
First, we explain the general procedure of this application by the following algorithm.
Algorithm: Crucial interdependence relations
- Step 1.
- Input vertex set P = and IN set O defined on P.
- Step 2.
- Input IN set of interdependence relations of any vertex with all other vertices and calculate T, F, and I of every pair of vertices by using, , , .
- Step 3.
- Repeat the Step 2 for every vertex in P.
- Step 4.
- Define relations on set P such that is a GS.
- Step 5.
- Consider an element of that relation, for which its value of T is comparatively high, and its values of F and I are lower than other relations.
- Step 6.
- Write down all elements in relations with T, F and I values, corresponding relations are IN sets on , respectively, and is an INGS.
Human beings, the main creatures in the world, depend on many things for their survival. Interdependence is a very important relationship in the world. It is a natural phenomenon that nobody can be 100% independent, and the whole world is relying on interdependent relationships. Provinces or states of any country, especially of a progressive country, can not be totally independent, more or less they have to depend on each other. They depend on each other for many things, that is, there are many interdependent relationships among provinces or states of a progressive country—for example, education, natural energy resources, agricultural items, industrial products, and water resources, etc. However, all of these interdependent relationships are not of equal importance. Some are very important to run the system of a progressive country. Between any two provinces, all interdependent relationships do not have the same strength. Some interdependent relationships are like the backbone for the country. We can make an INGS of provinces or states of a progressive country, and can highlight those interdependent relationships, due to which the system of the country is running properly. This INGS can guide the government as to which interdependent relationships are very crucial, and they must try to make them strong and overcome the factors destroying or weakening them.
We consider a set P of provinces and states of Pakistan:
P = {Punjab, Sindh, Khyber Pakhtunkhawa(KPK), Balochistan, Gilgit-Baltistan, Azad Jammu and Kashmir(AJK) }. Let O be the IN set on P, as defined in Table 1.
Table 1.
IN set O of provinces of Pakistan.
In Table 1, symbol T demonstrates the positive role of that province or state for the strength of the Federal Government, and symbol F indicates its negative role, whereas I denotes the percentage of ambiguity of its role for the strength of the Federal Government. Let us use the following alphabets for the provinces’ names:
PU = Punjab, SI = Sindh, KPK = Khyber Pakhtunkhwa, BA = Balochistan, GB = Gilgit-Baltistan, AJK = Azad Jammu and Kashmir. For every pair of provinces of Pakistan in set P, different interdependent relationships with their T, I and F values are demonstrated in Table 2, Table 3, Table 4, Table 5 and Table 6.
Table 2.
IN set of interdependent relations between Punjab and other provinces.
Table 3.
IN set of interdependent relationships between Sindh and other provinces.
Table 4.
IN set of interdependent relationships between KPK and other provinces.
Table 5.
IN set of interdependent relationships between AJK and other provinces.
Table 6.
IN set of interdependent relationships of Gilgit-Baltistan with other provinces.
Many relations can be defined on the set P, we define following relations on set P as:
= Education, = Natural energy resources, = Agricultural items, = Industrial products, = Water resources, such that is a GS. Any element of a relation demonstrates a particular interdependent relationship between these two provinces. As is GS; this is why any element can appear in only one relation. Therefore, any element will be considered in that relationship, whose value of T is high, and values of I, F are comparatively low, using the data of above tables.
Write down T, I and F values of the elements in relations according to the above data, such that , , , , are IN sets on relations , , , , , respectively.
Let = ;
= {(Sindh, Balochistan), (Khyber Pakhtunkhawa, Balochistan), (Balochistan, Gilgit-Baltistan), (Khyber Pakhtunkhawa, Gilgit-Baltistan)};
= {(Sindh, Khyber Pakhtunkhwa), (Gilgit-Baltistan, Sindh)};
= ;
= .
Let = ,
= ,
= ,
= ,
.
Obviously, (O, , , , , ) is an INGS as shown in Figure 14.
Figure 14.
INGS identifying crucial interdependence relation between any two provinces.
Every edge of this INGS demonstrates the most dominating interdependent relationship between those two provinces—for example, the most dominating interdependent relationship between Punjab and Gilgit-Baltistan is education, and its T, F and I values are 0.3, 0.2 and 0.1, respectively. It shows that education is the strongest connection bond between Punjab and Gilgit-Baltistan; it is stable, unstable, and unpredictable or uncertain. Using INGS, we can also elaborate the strength of any province, e.g., Punjab has the highest vertex degree for interdependent relationship education, and Balochistan has the highest vertex degree for the interdependent relationship natural energy resources. This shows that the strength of Punjab is education, and the strength of Balochistan is the natural energy resources. This INGS can be very helpful for Provincial Governments, and they can easily estimate which kind of interdependent relationships they have with other provinces, and what is the percentage of its stability and instability. It can also guide the Federal Government in regards to, between any two provinces, which relationships are crucial and what is their status. The Federal Government should be conscious of making decisions such that the most crucial interdependent relationships of its provinces are not disturbed and need to overcome the counter forces that are trying to destroy them.
4. Conclusions
Graph theory is a useful tool for solving combinatorial problems of different fields, including optimization, algebra, computer science, topology and operations research. An intuitionistic neutrosophic set constitutes a generalization of an intuitionistic fuzzy set. In this research paper, we have introduced the notion of intuitionistic neutrosophic graph structure. We have discussed a real-life application of intuitionistic neutrosophic graph structure in decision-making. Our aim is to extend our research work to (1) fuzzy rough graph structures; (2) rough fuzzy graph structures; (3) soft rough graph structures; and (4) roughness in graph structures.
Acknowledgments
The authors are thankful to the referees for their invaluable suggestions.
Author Contributions
Muhammad Akram and Muzzamal Sitara conceived and designed the experiments; Muhammad Akram performed the experiments; Muzzamal Sitara analyzed the data and wrote the paper.
Conflicts of Interest
The authors declare that they have no conflict of interest.
References
- Zadeh, L.A. Fuzzy sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef] [Scilit]
- Atanassov, K. Intuitionistic fuzzy sets. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef] [Scilit]
- Smarandache, F. Neutrosophy Neutrosophic Probability, Set, and Logic; Amer Res Press: Rehoboth, DE, USA, 1998. [Google Scholar]
- Wang, H.; Smarandache, F.; Zhang, Y.Q.; Sunderraman, R. Single-valued neutrosophic sets. Multispace Multistruct. 2010, 4, 410–413. [Google Scholar]
- Ye, J. Multicriteria decision-making method using the correlation coefficient under single-valued neutrosophic environment. Int. J. Gen. Syst. 2013, 42, 386–394. [Google Scholar] [CrossRef] [Scilit]
- Ye, J. Single-valued neutrosophic minimum spanning tree and its clustering method. J. Intell. Syst. 2014, 23, 311–324. [Google Scholar] [CrossRef] [Scilit]
- Ye, J. Improved correlation coefficients of single-valued neutrosophic sets and interval neutrosophic sets for multiple attribute decision making. J. Intell. Fuzzy Syst. 2014, 27, 2453–2462. [Google Scholar]
- Ye, J. A multicriteria decision-making method using aggregation operators for simplified neutrosophic sets. J. Intell. Fuzzy Syst. 2014, 26, 2459–2466. [Google Scholar]
- Bhowmik, M.; Pal, M. Intuitionistic neutrosophic set. J. Inf. Comput. Sci. 2009, 4, 142–152. [Google Scholar]
- Bhowmik, M.; Pal, M. Intuitionistic neutrosophic set relations and some of its properties. J. Inf. Comput. Sci. 2010, 5, 183–192. [Google Scholar]
- Kauffman, A. Introduction a la Theorie des Sous-Emsembles Flous; Masson et Cie: Renens, Switzerland, 1973; Volume 1. [Google Scholar]
- Zadeh, L.A. Similarity relations and fuzzy orderings. Inf. Sci. 1971, 3, 177–200. [Google Scholar] [CrossRef] [Scilit]
- Rosenfeld, A. Fuzzy Graphs, Fuzzy Sets and Their Applications; Zadeh, L.A., Fu, K.S., Shimura, M., Eds.; Academic Press: New York, NY, USA, 1975; pp. 77–95. [Google Scholar]
- Bhattacharya, P. Some remarks on fuzzy graphs. Pattern Recognit. Lett. 1987, 6, 297–302. [Google Scholar] [CrossRef] [Scilit]
- Sunitha, M.S.; Vijayakumar, A. Complement of a fuzzy graph. Indian J. Pure Appl. Math. 2002, 33, 1451–1464. [Google Scholar]
- Bhutani, K.R.; Rosenfeld, A. Strong arcs in fuzzy graphs. Inf. Sci. 2003, 152, 319–326. [Google Scholar] [CrossRef] [Scilit]
- Parvathi, R.; Karunambigai, M.G.; Atanassov, K.T. Operations on intuitionistic fuzzy graphs. In Proceedings of the 2009 IEEE International Conference on Fuzzy Systems, Jeju Island, Korea, 20–24 August 2009; pp. 1396–1401. [Google Scholar]
- Akram, M.; Shahzadi, S. Neutrosophic soft graphs with application. J. Intell. Fuzzy Syst. 2016, 32, 841–858. [Google Scholar] [CrossRef] [Scilit]
- Dinesh, T.; Ramakrishnan, T.V. On generalised fuzzy graph structures. Appl. Math. Sci. 2011, 5, 173–180. [Google Scholar]
- Akram, M.; Akmal, R. Application of bipolar fuzzy sets in graph structures. Appl. Comput. Intell. Soft Comput. 2016. [Google Scholar] [CrossRef] [Scilit]
- Akram, M.; Sitara, M. Application of intuitionistic neutrosophic graph structures in decision-making. Ann. Fuzzy Math. Inform. 2017, 14, 1–27. [Google Scholar]
- Akram, M.; Sitara, M. Interval-valued neutrosophic graph structures. Punjab Univ. J. Math. 2018, 50, 113–136. [Google Scholar]
- Akram, M.; Sitara, M.; Smarandache, F. Graph structures in bipolar neutrosophic environment. Mathematics 2017, 5, 60. [Google Scholar] [CrossRef] [Scilit]
- Akram, M.; Sitara, M. Single-Valued Neutrosophic Graph Structures. Available online: http://fs.gallup.unm.edu/SingleValuedNeutrosophic.pdf (accessed on 20 November 2017).
- Akram, M.; Sitara, M. Novel applications of single-valued neutrosophic graph structures in decision-making. J. Appl. Math. Comput. 2017. [Google Scholar] [CrossRef] [Scilit]
- Akram, M.; Sitara, M. Representation of graph Structure based on I-V neutrosophic sets. Int. J. Algebra Stat. 2017, 6, 56–80. [Google Scholar] [CrossRef] [Scilit]
- Akram, M.; Sitara, M. Bipolar neutrosophic graph structures. J. Indones. Math. Soc. 2017, 23, 55–76. [Google Scholar] [CrossRef] [Scilit]
- Akram, M.; Al-Shehrie, N.O. Intuitionistic fuzzy cycles and intuitionistic fuzzy trees. Sci. World J. 2014. [Google Scholar] [CrossRef] [Scilit] [PubMed]
- Akram, M.; Davvaz, B. Strong intuitionistic fuzzy graphs. Filomat 2012, 26, 177–196. [Google Scholar] [CrossRef] [Scilit]
- Akram, M.; Shahzadi, G. Operations on single-valued neutrosophic graphs. J. Uncertain Syst. 2017, 11, 176–196. [Google Scholar]
- Dhavaseelan, R.; Vikramaprasad, R.; Krishnaraj, V. Certain types of neutrosophic graphs. Int. J. Math. Sci. Appl. 2015, 5, 333–339. [Google Scholar]
- Dinesh, T. A Study on Graph Structures, Incidence Algebras and Their Fuzzy Analogues. Ph.D. Thesis, Kannur University, Kannur, India, 2011. [Google Scholar]
- Mordeson, J.N.; Nair, P.S. Fuzzy Graphs and Fuzzy Hypergraphs, 2nd ed.; Physica Verlag: Berlin/Heidelberg, Germany, 2001. [Google Scholar]
- Smarandache, F. A Unifying Field in Logics. Neutrosophy: Neutrosophic Probability, Set and Logic; American Research Press: Rehoboth, DE, USA, 1999. [Google Scholar]
- Tian, Z.-P.; Zhang, H.-Y.; Wang, J.; Wang, J.-Q.; Chen, X.-H. Multi-criteria decision-making method based on a cross-entropy with interval neutrosophic sets. Int. J. Syst. Sci. 2016, 47, 3598–3608. [Google Scholar] [CrossRef] [Scilit]
- Zavadskas, E.K.; Bausys, R.; Kaklauskas, A.; Ubarte, I.; Kuzminske, A.; Gudiene, N. Sustainable market valuation of buildings by the singlevalued neutrosophic MAMVA method. Appl. Soft Comput. 2017, 57, 74–87. [Google Scholar] [CrossRef] [Scilit]
- Zavadskas, E.K.; Bausys, R.; Juodagalviene, B.; Garnyte-Sapranaviciene, I. Model for residential house element and material selection by neutrosophic multimoora method. Eng. Appl. Artif. Intell. 2017, 64, 315–324. [Google Scholar] [CrossRef] [Scilit]
- Bausys, R.; Juodagalviene, B. Garage location selection for residential house by WASPAS-SVNS method. J. Civil Eng. Manag. 2017, 23, 421–429. [Google Scholar] [CrossRef] [Scilit]
- Xindong, P.; Chong, L. Algorithms for neutrosophic soft decision making based on EDAS, new similarity measure and level soft set. J. Intell. Fuzzy Syst. 2017, 32, 955–968. [Google Scholar] [CrossRef] [Scilit]
- Pouresmaeil, H.; Shivanian, E.; Khorram, E.; Fathabadi, H.S. An extended method using topsis and vikor for multiple attribute decision making with multiple decision makers and single valued neutrosophic numbers. Adv. Appl. Stat. 2017, 50, 261–292. [Google Scholar] [CrossRef] [Scilit]
- Tian, Z.-P.; Wang, J.-Q.; Zhang, H.-Y. Hybrid single-valued neutrosophic MCGDM with QFD for market segment evaluation and selection. J. Intell. Fuzzy Syst. 2017. [Google Scholar] [CrossRef] [Scilit]
- Wang, J.; Zhang, X.; Zhang, H. Hotel recommendation approach based on the online consumer reviews using interval neutrosophic linguistic numbers. J. Intell. Fuzzy Syst. 2017. [Google Scholar] [CrossRef] [Scilit]
- Liang, R.; Wang, J.; Zhang, H. Evaluation of e-commerce websites: An integrated approach under a single-valued trapezoidal neutrosophic environment. Knowl.-Based Syst. 2017, 135, 44–59. [Google Scholar] [CrossRef] [Scilit]
- Nie, R.-X.; Wang, J.-Q.; Zhang, H.-Y. Solving solar-wind power station location problem using an extended WASPAS technique with Interval neutrosophic sets. Symmetry 2017, 9, 106. [Google Scholar] [CrossRef] [Scilit]
- Luo, S.-Z.; Cheng, P.-F.; Wang, J.-Q.; Huang, Y.-J. Selecting Project Delivery Systems Based on Simplified Neutrosophic Linguistic Preference Relations. Symmetry 2017, 9, 151. [Google Scholar] [CrossRef] [Scilit]
- Sampathkumar, E. Generalized graph structures. Bull. Kerala Math. Assoc. 2006, 3, 65–123. [Google Scholar]
- Mondal, T.K.; Samanta, S.K. Generalized intuitionistic fuzzy sets. J. Fuzzy Math. 2002, 10, 839–862. [Google Scholar]
© 2017 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).













