1. Introduction
Fuzzy sets (FSs) were originally defined by Zadeh [
1] as a novel approach to represent uncertainty arising in various fields that was questioned by many researchers at that time. A FS is characterized by a truth membership function
which ranges over
. To generalize the notion of FSs, intuitionistic fuzzy sets (IFSs) were proposed by Atanassov [
2] because it is not always true that the falsity degree of an element in a FS is
as there may be some hesitation part. Therefore, the truth (t) and falsity (f) membership functions are used independently to characterize an IFS such that the sum of truth and falsity degrees should not be greater than one. Fuzzy sets give the degree of membership of an element in a given set (the non-membership of degree equals one minus the degree of membership), while IFSs give both a degree of membership and a degree of non-membership, which are more-or-less independent from each other. Liu et al. [
3] introduced different types of centroid transformations of IF values. Furthermore, Feng et al. [
4] defined various new operations for generalized IF soft sets. As an extension of IFSs, Smarandache [
5] introduced the concept of neutrosophy to study the nature, origin, and neutralities, and the neutrosophic set (NS). A NS is characterized by truth (t), indeterminacy (i), and falsity (f) membership functions. A NS is used as a powerful mathematical tool to deal the inconsistent data that exists in our daily life. For the practical use of NSs in science and engineering, Smarandache [
5] and Wang et al. [
6] introduced single-valued neutrosophic sets (SVNSs). A SVNS propose an additional choice to handle indeterminate information. Ye [
7] proposed a decision-making method by using the weighted correlation coefficient or the weighted cosine similarity measure of SVNSs to rank the alternatives and proposed an illustrative example to demonstrate the application of the proposed decision-making method. The same author defined SVN minimum spanning tree and its clustering method [
8]. Ye [
9] also proposed a multicriteria decision-making method using aggregation operators for simplified NSs.
The existing models such as FSs, IFSs, SVNSs cannot handle imprecise, inconsistent, and incomplete information of periodic nature. These theories are applicable to different areas of science, but there is one major deficiency in these sets, i.e., a lack of capability to model two-dimensional phenomena. To overcome this difficulty, the concept of complex fuzzy sets (CFSs) was introduced by Ramot et al. [
10]. A CFS is characterized by a membership function
whose range is not limited to [0, 1] but extends to the unit circle in the complex plane. Hence,
is a complex-valued function that assigns a grade of membership of the form
,
to any element
x in the universe of discourse. Thus, the membership function
of CFS consists of two terms, i.e., amplitude term
which lies in the unit interval [0, 1] and phase term (periodic term)
which lies in the interval
. This phase term distinguishes a CFS model from all other models available in the literature. Opposing to a fuzzy characteristic function, the range of CFS’s membership degrees is not restricted to
, but extends to the complex plane with unit circle. Ramot et al. [
11] discussed the union, intersection, and compliment of CFSs with the help of illustrative examples. A systematic review of CFSs was proposed by Yazdanbakhsh and Dick [
12]. To generalize the concept of CFSs, complex intuitionistic fuzzy sets (CIFSs) were introduced by Alkouri and Salleh [
13] by adding non-membership degree
to the CFSs subjected to the constraint
. The CIFSs are used to handle the information of uncertainty and periodicity simultaneously. The complex-valued truth and falsity membership degrees can be used to represent uncertainty in many physical quantities such as impedance in electrical engineering, wave function, and decision-making problems. The CFS has only one extra phase term, while CIFS has two additional phase terms which are used in several concepts such as distance measure, projections, and cylindric extensions. To handle imprecise information with a periodic nature, complex neutrosophic sets (CNSs) were proposed by Ali and Smarandache [
14]. As we see that uncertainty, inconsistency, and falsity in data are periodic in nature, to handle these types of problems, the CNS plays an important role. A CNS is characterized by a complex-valued truth
, complex-valued indeterminate
, and complex-valued falsity
membership functions, whose range is extended from [0, 1] to the unit disk in the complex plane. They proposed set theoretic operations such as complement, union, intersection, complex neutrosophic product, Cartesian product, distance measure, and
-equalities of CNSs and presented an application of CNSs in signal processing.
The vagueness in the representation of various objects and the uncertain interactions between them originated the necessity of fuzzy graphs (FGs) that were first defined by Rosenfeld [
15]. He studied several basic graph-theoretic concepts (e.g., bridges and trees), and established some of their properties. Some remarks on FGs were given by Bhattacharya [
16] and he proved that results from (crisp) graph theory do not always hold for FGs. To handle the vague and uncertain relations with periodic nature, FGs were extended to complex fuzzy graphs (CFGs) by Thirunavukarasu et al. [
17]. They studied the lower and upper bounds of energy of CFGs and illustrated these concepts through numeric examples. Since FGs and CFGs just provide the truth degrees and uncertainties occurring repeatedly, respectively, of pairwise relations. To consider the truth as well as falsity degrees between pairwise relationships simultaneously, intuitionistic fuzzy graphs (IFGs) were defined by Parvathi and Karunambigai [
18]. To handle periodic nature of falsity degrees in IFGs, Yaqoob et al. [
19] defined complex intuitionistic fuzzy graphs (CIFGs). They studied the homomorphisms of CIFGs and provided an application of CIFGs in cellular network provider companies for the testing of their proposed approach. To extend the concept of IFGs, Broumi et al. [
20] defined single-valued neutrosophic graphs (SVNGs) and investigated some of their properties such as strong SVNGs, constant SVNGs, and complete SVNGs. Certain operations on SVNGs were studied by Akram and Shahzadi [
21]. Single-valued neutrosophic planar graphs were defined by Akram [
22]. Applications of neutrosophic soft graphs were studied by Akram and Shahzadi [
23]. To generalize the concept of neutrosophic graphs and CIFGs, complex neutrosophic graphs (CNGs) were defined by Yaqoob and Akram [
24]. They discussed some basic operations on CNGs and described these operations with the help of concrete examples. They also presented energy of CNGs.
A hypergraph, as an extension of crisp graph, is considered to be the most developing and powerful tool to model different practical problems in various fields, including biological sciences, computer sciences, and social networks [
25]. To deal uncertainty in crisp hypergraphs, fuzzy hypergraphs (FHGs), as an extension of FGs, were defined by Kaufmann [
26]. Lee-Kwang and Lee [
27] discussed the fuzzy partition using FHGs. A valuable contribution on FGs and FHGs has been proposed by Mordeson and Nair [
28]. Fuzzy transversals of FHGs were studied by Goetschel et al. [
29]. To discuss the falsity degrees of hypernetworks, intuitionistic fuzzy hypergraphs (IFHGs) were defined by Parvathi et al. [
30]. Akram and Dudek [
31] proposed some applications of IFHGs. A method for finding the shortest hyperpath in an IFHG (weighted) was proposed by Parvathi et al. [
32]. They converted an IFN into intuitionistic fuzzy scores and find the IF shortest hyperpath in the network using the scores and accuracy values. Akram and Shahzadi [
33] introduced SVN hypergraphs. Akram and Luqman [
34] defined intuitionistic single-valued neutrosophic hypergraphs. The same authors [
35] introduced bipolar neutrosophic hypergraphs and discussed the applications of these hypergraphs in marketing and biology. Transversals and minimal transversals of
m-polar FHGs were studied by Akram and Sarwar [
36]. For further studies on FHGs and related extensions, readers are referred to [
37,
38,
39,
40].
The motivation behind this research work is the existence of indeterminate information of periodic nature in hypernetwork models. A complex neutrosophic hypergraph model plays an important role in handling complicated behavior of indeterminacy and inconsistency with periodic nature. The proposed model generalizes the complex fuzzy model as well as complex intuitionistic fuzzy model. To prove the applicability of our proposed model, we consider two voting procedures. Suppose that voters say “yes”, say “no”, and are “undecided” in the first voting procedure and voters say “yes”, say “no”, and are “undecided” in the second voting procedure. We assume that these two procedures held at different days. It is clear that a CFS cannot handle this situation as it only depicts the truth membership of voters but fails to represent the falsity and indeterminate degrees. Similarly, a CIFS represents the truth and falsity degrees of voters but it does not illustrate the undecided voters. Now, if we set the amplitude terms as the membership degrees of first voting procedure and phase terms as the membership degrees of second voting procedure, then we can illustrate this information using a complex neutrosophic model as, . The aim of the proposed work is to apply the most generalized concept of complex neutrosophic sets to hypergraphs to deal periodic nature of inconsistent information existing in hypernetworks. The proposed research generalizes the concepts of CNGs, CFHGs, CIFHGs, and overcomes the drawbacks occurring in previous research. The proposed model is more generalized framework as it does not only deal the reductant nature of imprecise information but also includes the benefits of hypergraphs. Thus, the main objective of this research work is to combine the fruitful effects of CNSs and hypergraph theory.
The contents of this paper are as follows: In
Section 2, we define complex neutrosophic hypergraphs, level hypergraphs, lower truncation, upper truncation, and transition levels of these hypergraphs. In
Section 3, we define
T-related complex neutrosophic hypergraphs and discuss certain properties of minimal transversals of complex neutrosophic hypergraphs. We justify the proposed concepts through some concrete examples.
Section 4 illustrates the modeling of some social networks with overlapping communities by means of complex neutrosophic hypergraphs. In
Section 5, we present a brief comparison of our proposed model with other existing models. In
Section 6, we discuss the results of our proposed research.
Section 7 deals with conclusions and future directions.
2. Complex Neutrosophic Hypergraphs
Definition 1. [5] Let be a non-empty set. A neutrosophic set (NS) on is defined as,where denote the truth, indeterminacy, and falsity degrees of N such that . Definition 2. [6] A single-valued neutrosophic set (SVNS) on is defined as,where denote the truth, indeterminacy, and falsity degrees of S such that . Definition 3. [13] A complex intuitionistic fuzzy set (CIFS) I on the universal set is defined as,where , are known as amplitude terms, are called phase terms, and for every . Complex neutrosophic sets are defined using SVNSs.
Definition 4. [14] A complex neutrosophic set (CNS) on the universal set is defined as,where , are known as amplitude terms, are called phase terms, and for every . Definition 5. [24] A complex neutrosophic relation (CNR) is a CNS on given as,where , , , characterize the truth, indeterminacy, and falsity degrees of R, and such that for all . Definition 6. [24] A complex neutrosophic graph (CNG) on is an ordered pair , where A is a CNS on and B is CNR on such that , for all .
Example 1. Consider a CNG on , where , , , , , , , and , , , , , , , , , are CNS and CNR on , respectively. The corresponding graph is shown in Figure 1. Definition 7. [14] Let and be two CNSs in , then - (i)
, , , and , , for amplitudes and phase terms, respectively, for all .
- (ii)
, , , and , , for amplitudes and phase terms, respectively, for all .
- (iii)
.
- (iv)
.
Definition 8. The support of a CNS is defined as The height of a CNS is defined as Definition 9. A complex neutrosophic hypergraph (CNHG) on is defined as an ordered pair , where is a finite family of CNSs on and λ is a CNR on CNSs ’s such that
- (i)
, for all
- (ii)
for all
Please note that is the crisp hyperedge of .
Definition 10. Let be a CNHG. The height of , denoted by , is defined as , where , , , , , . Here, , , denote the truth, indeterminacy, and falsity degrees of vertex to hyperedge , respectively.
Definition 11. Let be a CNHG. Suppose that and such that . The -level hypergraph of is defined as an ordered pair , where
- (i)
and ,
- (ii)
.
Please note that -level hypergraph of is a crisp hypergraph.
Definition 12. Let be a CNHG and for , , , , , and , let be the level hypergraph of . The sequence of complex numbers such that , , , , , and satisfying the conditions,
- (i)
if , , , , , , then , and
- (ii)
,
is called the fundamental sequence of , denoted by . The set of -level hypergraphs is called the set of core hypergraphs or the core set of , denoted by .
Example 2. Consider a CNHG on . The CNR λ is given as, , , , and , , The corresponding CNHG is shown in Figure 2. Please note that the sequence , , , satisfies all the conditions of Definition 12. Thus, it is a fundamental sequence of . The corresponding -level hypergraphs are shown in Figure 3, Figure 4 and Figure 5. Definition 13. A CNHG is ordered if is ordered, i.e., if , then .
A CNHG is simply ordered if is simply ordered, i.e., if , then .
Example 3. Consider a CNHG as shown in Figure 2. The set of core hypergraphs is given as,where
Hence, is an ordered CNHG. Also, is simply ordered.
Definition 14. A CNHG with is called sectionally elementary if for every and for , , for all , , , , , and .
Definition 15. Let N be a CNS on . The lower truncation of N at level , , , is the CNSS defined by, Definition 16. Let N be a CNS on . The upper truncation of N at level , , , is the CNSS defined by, Definition 17. Let be a CNHG. The lower truncation of at level is defined as, , where .
The upper truncation of at level is defined as, , where .
Definition 18. Let N be a CNS on . Then, each , such that , , , , , and , for which , is called a transition level of N.
Example 4. Consider a CNHG as shown in Figure 2. The , , -level hypergraph of is shown in Figure 4. Then, the lower truncation of is a CNHG on as given in Figure 6. Not that . The upper truncation of is a CNHG on as given in Figure 7. Definition 19. Let be a CNHG. A complex neutrosophic transversal (CNT) τ is a CNS of satisfying the condition for all , where is the height of ξ.
A minimal complex neutrosophic transversal is the CNT of with the property that if , then τ is not a CNT of .
Let us denote the family of minimal CNTs of by .
Definition 20. A CNT τ with the property that , for all , and is called the locally minimal CNT of . The collection of all locally minimal CNTs of is represented by .
Please note that , but the converse is not generally true.
Definition 21. Let N be a CNS on . Then, the basic sequence of N determined by N, denoted by , is defined as , where
- (i)
, , , , , ,
- (ii)
,
- (iii)
are the transition levels of N.
Definition 22. Let be the basic sequence of N. Then, the set of basic cuts is defined as, .
Lemma 1. Let be a CNHG with . Then,
- (i)
If is a transition level of , then there exists an such that for all , , , , , , is a minimal transversal extension of , i.e., if , then C is not a transversal of .
- (ii)
, i.e., the collection of minimal transversals of is sectionally elementary.
- (iii)
is properly contained in .
- (iv)
, for all and for every , , , , , .
Definition 23. Let be a CNHG. The complex neutrosophic line graph of is defined as an ordered pair , where and there exists an edge between two vertices in if , for all . The membership degrees of are given as,
- (i)
,
- (ii)
.
3. -Related Complex Neutrosophic Hypergraphs
Definition 24. A CNHG is N-tempered CNHG of if there exists , a crisp hypergraph, and a CNS N such that , where An N-tempered CNHG determined by H and CNS N is denoted by .
Definition 25. A pair of crisp hypergraphs is T-related if whenever g is a minimal transversal of G, k is any transversal of J, and , then there exists a minimal transversal t of J such that .
Definition 26. Let be a CNHG with . Then, is T-related if from the core setof , every successive ordered pair is T-related. If contains only one element, is considered to be trivially T-related.
Theorem 1. Let be a T-related CNHG, then .
Proof. Let be a T-related CNHG with . Then, there arises two cases:
- Case (i)
First we consider that . Then, Lemma 1 implies that for each , , for all , , , , , and . Thus, .
- Case (ii)
We now suppose that . Since, , we just have to prove that . Let , and . AS , , and the ordered pair is T-related. If , then there exists a minimal transversal of such that . Hence, we obtain a CNT of such that . Let and , where is an elementary CNS with support and height , This contradiction shows that . Then, Lemma 1 implies that , for , , , , , . Continuing the same recursive procedure, we show that , for each , , , , , .
□
Example 5. Let be a CNHG represented by the incidence matrix as given in Table 1. Clearly, Also, , where Since, and , i.e., no minimal transversal of contains . Thus, is not T-related, therefore is not T-related.
Theorem 2. Let be an ordered CNHG, then is T-related.
Proof. In view of Theorem 1, this is enough to prove that
implies
is
T-related. Suppose that
and
is not
T-related. Here, we obtain
such that
. Assume that the ordered pair
is not
T-related and
. Then, there exists a CNT
such that
and
, where
satisfying the condition that
N is not a minimal transversal of
, for every
N,
. Since,
is an ordered CNHG, then
, therefore
is not a transversal of
, for otherwise
, which is a contradiction to our assumption. Let
be an arbitrary CNT of
such that
. Now, if
, then
Q is not a crisp transversal of
. As we know that
and
. Thus, we can obtain a minimal CNT
of
such that
. First, we compute a minimal CNT
of
, where
is the top level cut of
at level
and satisfies
. Then, Lemma 1 implies that the
-cut,
of
should equal to some
that satisfies
and
, then
Q is not a crisp transversal of
. Thus, we obtain
.
We now assume that . Since, is ordered, then there exists an ordered sequence of crisp minimal transversals of , , ⋯, , respectively. Let be an elementary CNSS with support and height . Then, such that and . □
Corollary 1. Let be an ordered CNHG with and .
If an ordered pair is not T-related, then
- (i)
.
- (ii)
is a transition level for
Example 6. Let be a CNS on such that and , for all . Let be a crisp hypergraph on , where , , , , and . Then, N-tempered CNHG is given by the incidence matrix as shown in Table 2. Here, , = , , , and , , . Please note that and , where
Please note thati.e., is a transversal of but not a minimal transversal. Therefore, the ordered pair as well as is not T-related. Remark 1. Example 6 shows that there exists some ordered CNHGs that are not T-related.
Every simply ordered CNHG satisfies , for all , , , , , .
Lemma 2. Let be a crisp hypergraph and j be an arbitrary vertex of H. Then such that for any hyperedge of H, .
Proposition 1. Let be a crisp partial hypergraph of that is obtained by removing those hyperedges of that contain any other edges properly. Then,
- (i)
- (ii)
.
Definition 27. Let be a CNHG. The join of , denoted by , is defined as, , where λ is the CN hyperedge set of .
For every , , , , , , the -level cut of , i.e., is the set of vertices of -level hypergraph of , i.e., .
Lemma 3. Let be a CNHG and . If , then there exists a CN hyperedge ρ of such that
- (i)
- (ii)
Proof. Let such that and . Since every that is a transversal of contains a transversal such that . This implies that . Therefore, there exists at least one hyperedge of such that . Let be the set of hyperedges of and . We now prove that there exists at least one such that . For otherwise, we have , for all , This implies that for every , there exists an element such that , for . Since, , then and imply that , . If these hold, it could be shown that by computing a CNT of that satisfies . This argument follows form the fact that and are finite, there exist intervals , , , , , and such that on , , , , , and .
Clearly and is a transversal of . Also, contains Therefore, is a transversal of . The same argument holds for every , where , , , , , . Since, , for all , , , , , . This establishes the existence of for which .
We now suppose that every hyperedge from the set with height contain two or more than two elements of . BY repeating the above procedure, we can establish that , which is a contradiction. □
Example 7. Consider a CNHG on as represented by incidence matrix given in Table 3. Here, , , . Then, we see that , , and have no transitions levels and is the transition level of and . The basic sequences are given as, Also, we have and , where We now determine and . If , then , , , , and . Please note that , where Now and and , for all , , , , , . Hence, .
We now illustrate Lemma 3 through the above example. Hence, .
Theorem 3. Let be a CNHG and . If with , then there exists an hyperedge such that
- (i)
- (ii)
For such that ,
- (iii)
, where is an arbitrary hyperedge of
- (iv)
Corollary 2. Let be a CNHG. If satisfies , then .