Skip to main content
Erschienen in: Complex & Intelligent Systems 1/2021

Open Access 04.11.2020 | Original Article

Extension of competition graphs under complex fuzzy environment

verfasst von: Muhammad Akram, Aqsa Sattar, Faruk Karaaslan, Sovan Samanta

Erschienen in: Complex & Intelligent Systems | Ausgabe 1/2021

Aktivieren Sie unsere intelligente Suche um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

A complex fuzzy set (CFS) is a remarkable generalization of the fuzzy set in which membership function is restricted to take the values from the unit circle in the complex plane. A CFS is an efficient model to deal with uncertainties of human judgement in more comprehensive and logical way due to the presence of phase term. In this research article, we introduce the concept of competition graphs under complex fuzzy environment. Further, we present complex fuzzy k-competition graphs and p-competition complex fuzzy graphs. Moreover, we consider m-step complex fuzzy competition graphs, complex fuzzy neighborhood graphs (CFNGs), complex fuzzy economic competition graphs (CFECGs) and m-step complex fuzzy economic competition graphs with interesting properties. In addition, we describe an application in ecosystem of our proposed model. We also provide comparison of proposed competition graphs with existing graphs.
Hinweise

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Introduction

In 1968, Cohen [6] introduced the conception of competition graphs (CGs) to determine the problems of ecosystem. CGs have many utilizations in distinct areas of life. The analogy of Cohen was based on the fact that there is a competition between two species if both species have a common prey. Many variations of CGs are present in the literature, namely competition common enemy graph of digraph [22], p-competition graphs of digraph [12, 13], competition hypergraphs [23] and tolerance competition graphs [4]. Another worthwhile generalization of competition graphs was given by Cho et al. [5] in 2000. All the introduced competition graphs are crisp graphs which cannot describe all the real-world competitions. In ecosystem, the species may be vegetarian, non-vegetarian, strong, weak, and similarly the prey may be harmful, digestive, energetic, etc.
In 1965, Zadeh [25] developed the conception of fuzzy set to represent the uncertainty of human judgment by initiating the membership function which is restricted to take the values form the unit interval [0,1]. For example, today is sunny, it might be 100\(\%\) true if there are no clouds, 80\(\%\) true if there are few clouds, 50\(\%\) true if it is hazy and 0\(\%\) true if it rains all day. A graph is an easy way to interpret the information which involve the relationship between objects. Fuzzy graphs are designed to represent the structures of relationships between objects such that the existence of a concrete object (vertex) and the relationship between two objects (edge) are matters of degree. In 1975, Rosenfeld [17] initiated the notion of fuzzy graph (FG). Certain notions of FGs have been discussed in [1, 8, 15, 27]. After the introduction of FG, many researchers turned their attention to find the competition among entities under fuzzy environment. Fuzzy k-competition and p-competition graphs were developed by Samanta and Pal [20]. Further, Samanta et al. [19] initiated m-step fuzzy competition graphs. Moreover, Habib et al. [9] initiated the concept of q-rung orthopair FCGs with their utilization in soil ecosystem. Sarwar et al. [21] introduced a new decision-making approach with fuzzy competition hypergraphs. Akram and Luqman [2] presented a remarkable contribution on fuzzy hypergraphs. Most of the real-world competitions can be represented through these FCGs but there exist some competitions in which the entities possess the periodic or two-dimensional information which cannot be represented through these FCGs. For example, in a food web, the species may be strong and vegetarian and the prey may be harmful and energetic at the same time interval. Similarly, the species may be strong or weak and the prey may be harmful or energetic under some specific time interval. This information about the species and preys is two dimensional which cannot be modeled through FCGs.
Fuzzy set (FS) theory is useful model to deal with uncertainties arising in various fields of life. But in some situations, this theory cannot model the incomplete and imprecise information of two-dimensional or periodic nature encountered in the real world. To cope with this problem, Ramot et al. [16] proposed complex fuzzy set (CFS), as a worthwhile generalization of FS in which the membership grade is restricted to take the values form the unit circle in the complex plane, and is of the form \(re^{i\theta }\), where r is the amplitude term and \(\theta \) is the phase term. The phase term \(\theta \) of CFS has a great importance because it can handle the recurring problems or periodic problems phenomena with more perfection. The presence of phase term in CFS ensures that there may exist some situations where the second dimension is required. This term differentiates CFS from all other available sets of the literature. Possible application which demonstrates the new concept involve a CF representation of solar activity, signal processing application and in time series forecasting applications. Later on, Thirunavukarasu [24] introduced the idea of complex fuzzy graph (CFG). Recently, Luqman et al. [14] investigated the novel concepts of CF hypergraphs. Akram et al. [3] considered imperfect competition models in economic market structure with q-rung picture fuzzy information. Further, Garg and Rani [10, 11] investigated many decision-making techniques. The motivation to this article can be described as follows.
1.
The CFS, a worthwhile generalization of FS, is a proficient model to handle all the periodic or two-dimensional information due to the presence of an additional term known as phase term. This set has an edge over the other existing models of the literature due to its additional features of handling the periodic and two-dimensional information in a single set. On the other hand, if we remove the phase term of CFS then the CFS is a conventional FS with real-valued membership.
 
2.
The competition graphs developed under CF environment are useful enough to tackle all the competitions of real world which possess the information of two-dimensional nature.
 
In this research article, we present the innovative concept of CFCGs. We then investigate the two generalizations of CFCGs, namely CF k-competition and p-competition CFGs. Further, we investigate CFNGs, m-step CFCGs, CFECGs and m-step CFECGs. Moreover, we discuss an application of CFCGs in ecosystem to emphasize the superiority of these graphs in real life. The main contribution to this article is summarized as follows.
1.
Competition graphs with its remarkable generalization are developed in CF environment to overcome the deficiencies of other existing competition graphs of the literature.
 
2.
An algorithm is initiated to find the competition among the real-world entities with an application in ecology.
 
3.
A comparative analysis is provided to check the superiority and authenticity of our proposed competition graphs.
 
We arrange this paper as follows: the next section includes some elemental definitions which are necessary for the evolution of CFCGs, followed by which we introduce the concept of CFCGs with its two remarkable extensions, namely CF k-competition graphs and p-competition CFGs. In the subsequent section, we develop the concept of CFNGs with some related theorems and then we discuss m-step CFCGs. After this, we initiate a new concept called CFECGs. The penultimate section includes an application of CFCG to reveal its importance in real life. Before the concluding section, we provide comparison of the proposed competition graphs with existing graphs. Finally, we give the conclusion.

Preliminaries

Definition 1
[20] The fuzzy competition graph (FCG) \(\mathfrak {C}(\overrightarrow{\Omega })\) of fuzzy digraph (FDG) \(\overrightarrow{\Omega }=(W,\mathbb {\widehat{P}},\overrightarrow{\mathbb {\widehat{Q}}})\) is an undirected graph \(\Omega =(W,\mathbb {\widehat{P}},\mathbb {\widehat{Q}})\) with same node set as in \(\overrightarrow{\Omega }\) and have an edge connecting two distinct vertices g and f in \(\mathfrak {C}(\overrightarrow{\Omega })\) if and only if \(\aleph ^{+}(g)\cap \aleph ^{+}(f)\ne \varnothing \) in \(\overrightarrow{\Omega },\) and for the edge (gf) the membership value (MV) in \(C(\overrightarrow{\Omega })\) is given as
$$\begin{aligned} \xi _{\mathbb {\widehat{Q}}}(g,f)=(\xi _{\mathbb {\widehat{P}}}(g)\wedge \xi _{\mathbb {\widehat{P}}}(f))\times {\hbar }(\aleph ^{+}(g)\cap \aleph ^{+}(f)). \end{aligned}$$
(1)
Definition 2
[16] Let Z be a universal set. Then complex fuzzy set (CFS) B on Z can be given as
$$\begin{aligned} B=\{(q,\xi _{B}(q)e^{i\varphi _{B}(q)})~|~q\in Z\}, \end{aligned}$$
(2)
where \(\xi _{B}(q)e^{i\varphi _{B}(q)}\) is the MV of the element q such that \(\xi _{B}(q)\in [0,1]\) and \(\varphi _{B}(q)\in [0,2\pi ],\) and \(i=\sqrt{-1}.\) For every \(q\in Z,\) \(\xi _{B}(q)\) and \(\varphi _{B}(q)\) are the amplitude term and phase term, respectively.
Definition 3
[7] A complex fuzzy relation (CFR) \(\mathbb {R}\) on a universal set \(W\times Z,\) can be given as
$$\begin{aligned} \mathbb {R}(g,f)=\{((g,f),\xi _{\mathbb {R}}(g,f)e^{i\varphi _{\mathbb {R}}(g,f)})~|~(g,f)\in W\times Z\}, \end{aligned}$$
(3)
where \(\xi _{\mathbb {R}}(g,f)e^{i\varphi _{\mathbb {R}}(g,f)}\) is the MV of the element (gf) in \(W\times Z\) such that \(\xi _{\mathbb {R}}(g,f)\in [0,1]\) and \(\varphi _{\mathbb {R}}(g,f)\in [0,2\pi ],\) and \(i=\sqrt{-1}.\)
For each \((g,f)\in W \times Z,\) \(\xi _{R}(g,f)\) and \(\varphi _{R}(g,f)\) are the amplitude term and the phase term, respectively.
Definition 4
[26] Let \(B_{1}\) and \(B_{2}\) be two CFSs on a universal set Z,  where
$$\begin{aligned} B_{1}= & {} \{q,\xi _{B_{1}}(q)e^{i\varphi _{B_{1}}(q)}~|~q\in Z\}, \end{aligned}$$
(4)
$$\begin{aligned} B_{2}= & {} \{q,\xi _{B_{2}}(q)e^{i\varphi _{B_{2}}(q)}~|~q\in Z\}. \end{aligned}$$
(5)
Then the CF intersection of \(B_{1}\) and \(B_{2},\) symbolized by \(B_{1}\cap B_{2},\) is given by the function
$$\begin{aligned} B_{1}\cap B_{2}= & {} \{\xi _{B_{1}\cap B_{2}}(q)e^{i\varphi _{B_{1}\cap B_{2}}(q)}~|~q\in Z\}, \end{aligned}$$
(6)
where
$$\begin{aligned} \xi _{B_{1}\cap B_{2}}(q)e^{i\varphi _{B_{1}\cap B_{2}}(q)}= & {} (\xi _{B_{1}}(q)\wedge \xi _{B_{2}}(q))e^{i\varphi _{B_{1}}(q)\wedge \varphi _{B_{2}}(q)}.\nonumber \\ \end{aligned}$$
(7)
Definition 5
[26] Let \(B_{1}\) and \(B_{2}\) be two CFSs defined on a universe Z,  where
$$\begin{aligned} B_{1}= & {} \{q,\xi _{B_{1}}(q)e^{i\varphi _{B_{1}}(q)}~|~q\in Z\}, \end{aligned}$$
(8)
$$\begin{aligned} B_{2}= & {} \{q,\xi _{B_{2}}(q)e^{i\varphi _{B_{2}}(q)}~|~q\in Z\}. \end{aligned}$$
(9)
Then the CF product of \(B_{1}\) and \(B_{2},\) symbolized by \(B_{1}\circ B_{2},\) is given by the function
$$\begin{aligned} B_{1}\circ B_{2}= & {} \{\xi _{B_{1}\circ B_{2}}(q)e^{i\varphi _{B_{1}\circ B_{2}}(q)}|q\in Z\}, \end{aligned}$$
(10)
where where
$$\begin{aligned} \xi _{B_{1}\circ B_{2}}(q)e^{i\varphi _{B_{1}\circ B_{2}}(q)}= & {} (\xi _{B_{1}}(q).\xi _{B_{2}}(q))e^{i2\pi \left( \frac{\varphi _{B_{1}}(q)}{2\pi }.\frac{\varphi _{B_{2}}(q)}{2\pi }\right) }. \end{aligned}$$
(11)
Definition 6
[24] A fuzzy graph (FG) \(\Omega =(W,\mathbb {\widehat{P}},\mathbb {\widehat{Q}}),\) on a non-empty set W is said to be a complex fuzzy graph (CFG), where \(\mathbb {\widehat{P}}\) and \(\mathbb {\widehat{Q}}\) are CFS and CFR on W such that
$$\begin{aligned} \xi _{\mathbb {\widehat{Q}}}(g,f)\le & {} (\xi _{\mathbb {\widehat{P}}}(g)\wedge \xi _{\mathbb {\widehat{P}}}(f)), ~~ \mathrm{( for ~amplitude ~term)} \end{aligned}$$
(12)
$$\begin{aligned} \varphi _{\mathbb {\widehat{Q}}}(g,f)\le & {} (\varphi _{\mathbb {\widehat{P}}}(g)\wedge \xi _{\mathbb {\widehat{P}}}(f)), ~~~\mathrm{(for ~phase~ term)} \end{aligned}$$
(13)
for all \(g,f\in W.\)
Definition 7
[24] A directed CFG (complex fuzzy digraph) (CFDG) on a non-empty set W is a triplet \(\overrightarrow{\Omega }=(W,\mathbb {\widehat{P}},\overrightarrow{\mathbb {\widehat{Q}}})\), where \(\mathbb {\widehat{P}}\) is CFS on W and \(\overrightarrow{\mathbb {\widehat{Q}}}\) is CFR on W such that
$$\begin{aligned} \xi _{\mathbb {\widehat{Q}}}\overrightarrow{(g,f)}\le & {} (\xi _{\mathbb {\widehat{P}}}(g)\wedge \xi _{\mathbb {\widehat{P}}}(f)), ~~ \mathrm{(for ~amplitude ~term)} \end{aligned}$$
(14)
$$\begin{aligned} \varphi _{\mathbb {\widehat{Q}}}\overrightarrow{(g,f)}\le & {} (\varphi _{\mathbb {\widehat{P}}}(g)\wedge \xi _{\mathbb {\widehat{P}}}(f)), ~~~\mathrm{(for ~phase ~term)} \end{aligned}$$
(15)
for all \(g,f\in W.\)
The list of acronyms in research paper is given in Table 1.
Table 1
List of acronyms
Acronyms
Description
FS
Fuzzy set
CFS
Complex fuzzy set
CFON
Complex fuzzy out-neighborhood
CFIN
Complex fuzzy in-neighborhood
CFCG
Complex fuzzy competition graph
\(CFO^{p}N\)
Complex fuzzy open neighborhood
\(CFC^{l}N\)
Complex fuzzy closed neighborhood
\(CFO^{p}NG\)
Complex fuzzy open neighborhood graph
\(CFC^{l}NG\)
Complex fuzzy closed neighborhood graph
CFECG
Complex fuzzy economic competition graph

Complex fuzzy set applied to competition graphs

This section presents some basic definitions which are necessary to define for the evolution CFCGs.
Definition 8
For a node g of a CFDG \(\overrightarrow{\Omega }=\left( W,\mathbb {\widehat{P}},\overrightarrow{\mathbb {\widehat{Q}}}\right) ,\) the CF out-neighborhood (CFON) is a CFS, given by
$$\begin{aligned} \aleph ^{p}(g)=\left( S^{p}_{g},m^{p}_{g}e^{i\eta ^{p}_{g}}\right) , \end{aligned}$$
where \(S^{p}_{g}=\{f| \xi _{\mathbb {\widehat{Q}}}\overrightarrow{(g,f)}>0\}\) such that \(m^{p}_{g}:S^{p}_{g}\rightarrow [0,1]\) given by \(m^{p}_{g}(f)=\xi _{\mathbb {\widehat{Q}}}\overrightarrow{(g,f)}\) and \(\eta ^{p}_{g}:S^{p}_{g}\rightarrow [0,2\pi ]\) given by \(\eta ^{p}_{g}(f)=\varphi _{\mathbb {\widehat{Q}}}\overrightarrow{(g,f)}.\)
Table 2
CFON and CFIN of the nodes
g
\(\aleph ^{p}(g)\)
\(\aleph ^{n}(g)\)
i
\(\varnothing \)
\(\{(j,0.3e^{i0.20\pi }),(n,0.35e^{i0.10\pi })\}\)
j
\(\{(l,0.50e^{i0.40\pi }),(i,0.30e^{i0.20\pi })\}\)
\(\varnothing \)
l
\(\varnothing \)
\(\{(n,0.40e^{i0.90\pi }),(j,0.5e^{i0.40\pi })\}\)
n
\(\{(l,0.40e^{i0.90\pi }),(i,0.35e^{i0.10\pi })\}\)
\(\varnothing \)
Definition 9
For a node g of a CFDG \(\overrightarrow{\Omega }=\left( W,\mathbb {\widehat{P}},\overrightarrow{\mathbb {\widehat{Q}}}\right) ,\) the CF in-neighborhood (CFIN) is a CFS, given by
$$\begin{aligned} \aleph ^{n}(g)=(S^{n}_{g},m^{n}_{g}e^{i\eta ^{n}_{g}}), \end{aligned}$$
where \(S^{n}_{g}=\{f| \xi _{\mathbb {\widehat{Q}}}\overrightarrow{(f,g)}>0\}\) such that \(m^{n}_{g}:S^{n}_{g}\rightarrow [0,1]\) given by \(m^{n}_{g}(f)=\xi _{\mathbb {\widehat{Q}}}\overrightarrow{(f,g)}\) and \(\eta ^{n}_{g}:S^{n}_{g}\rightarrow [0,2\pi ]\) given by \(\eta ^{n}_{g}(f)=\varphi _{\mathbb {\widehat{Q}}}\overrightarrow{(f,g)}.\)
Example 1
Let \(\overrightarrow{\Omega }=(W,\mathbb {\widehat{P}},\overrightarrow{\mathbb {\widehat{Q}}})\) be a CFDG, where
\(\mathbb {\widehat{P}}=\left\langle \dfrac{i}{0.40e^{i0.20\pi }},\dfrac{j}{0.50e^{i0.70\pi }},\dfrac{l}{0.60e^{i1.70\pi }},\dfrac{n}{0.55e^{i1.70\pi }}\right\rangle ,\)
\(\overrightarrow{\mathbb {\widehat{Q}}}=\left\langle \dfrac{\overrightarrow{(j,i)}}{0.30e^{i0.20\pi }},\dfrac{\overrightarrow{(n,i)}}{0.350e^{i0.10\pi }}, \dfrac{\overrightarrow{(j,l)}}{0.50e^{i0.40\pi }},\dfrac{\overrightarrow{(n,l)}}{0.40e^{i0.90\pi }}\right\rangle .\)
The CFDG is shown in Fig. 1.
CFON and CFIN of the nodes are given in Table 2.
Definition 10
Let \(B=\{(q,\xi _{B}(q)e^{i\varphi _{B}(q)}) ~| ~q\in Z\}\) be a CFS. The height of CFS B symbolized by \({\hbar }(B)=({\hbar }_{\xi }(B)e^{i{\hbar }_{\varphi }})\) is given as
$$\begin{aligned} {\hbar }(B)= & {} \{\left( \max \left( \xi _{B}(q)\right) e^{i\max \left( \varphi _{B}(q)\right) }\right) ~| ~q\in Z \}\\= & {} \left( {\hbar }_{\xi }(B)e^{i{\hbar }_{\varphi }(B)}\right) . \end{aligned}$$
Definition 11
The CFCG \(\mathfrak {C}\left( \overrightarrow{\Omega }\right) \) of a CFDG \(\overrightarrow{\Omega }=\left( W,\mathbb {\widehat{P}},\overrightarrow{\mathbb {\widehat{Q}}}\right) \) is an undirected CFG \(\Omega =(W,\mathbb {\widehat{P}},\mathbb {\widehat{Q}})\) with same CF node set as in \(\overrightarrow{\Omega }\) and possesses a CF edge in \(\mathfrak {C}\left( \overrightarrow{\Omega }\right) \) joining two distinct nodes g and f if and only if the CFS \(\aleph ^{p}(g)\cap \aleph ^{p}(f)\ne \varnothing \) in \(\overrightarrow{\Omega }\) and the MV of the edge (gf) in \(\mathfrak {C}(\overrightarrow{\Omega })\) is
$$\begin{aligned} \xi _{\mathbb {\widehat{Q}}}(g,f)= & {} (\xi _{\mathbb {\widehat{P}}}(g)\wedge \xi _{\mathbb {\widehat{P}}}(f))\times { \hbar }_{\xi }(\aleph ^{p}(g)\cap \aleph ^{p}(f)), \\ \varphi _{\mathbb {\widehat{Q}}}(g,f)= & {} 2\pi \left[ \left( \frac{\varphi _{\mathbb {\widehat{P}}}(g)}{2\pi }\wedge \frac{\varphi _{\mathbb {\widehat{P}}}(f)}{2\pi }\right) \right. \\&\left. \times \frac{{\hbar }_{\varphi }(\aleph ^{p}(g)\cap \aleph ^{p}(f))}{2\pi }\right] . \end{aligned}$$
Example 2
Let \(\overrightarrow{\Omega }=\left( W,\mathbb {\widehat{P}},\overrightarrow{\mathbb {\widehat{Q}}}\right) \) be a CFDG, as presented in Fig. 2a, given by
\(\mathbb {\widehat{P}}=\left\langle \dfrac{l}{0.3e^{i0.7\pi }},\dfrac{i}{0.6e^{i1.3\pi }},\dfrac{m}{0.4e^{0.4e^{i1.2\pi }}}, \dfrac{k}{0.5e^{i0.9\pi }},\dfrac{n}{0.4e^{i1.7\pi }}\right\rangle ,\)
\(\overrightarrow{\mathbb {\widehat{Q}}}=\left\langle \dfrac{\overrightarrow{(i,l)}}{0.2e^{i0.3\pi }},\dfrac{\overrightarrow{(m,i)}}{0.35e^{i1.1\pi }}, \dfrac{\overrightarrow{(k,m)}}{0.2e^{i0.7\pi }},\dfrac{\overrightarrow{(n,k)}}{0.2e^{i0.7\pi }},\dfrac{\overrightarrow{(n,l)}}{0.25e^{i0.2\pi }}, \dfrac{\overrightarrow{(k,l)}}{0.3e^{i0.2\pi }}\right\rangle .\)
The CFON of the nodes are shown in Table 3.
The CFSs \(\aleph ^{p}(g)\cap \aleph ^{p}(f)\) and \({\hbar }\left( \aleph ^{p}(g)\cap \aleph ^{p}(f)\right) \) are given in Table 4.
The corresponding CFCG is shown in Fig. 2b.
Definition 12
Let \(B=\{(q,\xi _{B}(q))e^{i\varphi _{B}(q)}~|~q\in Z\}\) be a CFS. Then the cardinality of CFS B is a positive complex number symbolized by \(|B|_{\xi }e^{i|B|_{\varphi }},\) is defined as
$$\begin{aligned} |B|= & {} \sum _{q_{i}\in Z}\xi _{B}(q_{i})e^{i\sum _{q_{i}\in Z}\varphi _{B}(q_{i})}\\= & {} |B|_{\xi }e^{i|B|_{\varphi }}, \end{aligned}$$
for all \(q\in Z.\)
Definition 13
Suppose \(k=re^{i\theta }\) be a complex number and \(|\aleph ^{p}(g)\cap \aleph ^{p}(f)|=r^{'}e^{i\theta ^{'}}(say).\) The CF k-competition graph \(\mathfrak {C}_{k}(\overrightarrow{\Omega })\) of a CFDG \(\overrightarrow{\Omega }=(W,\mathbb {\widehat{P}},\overrightarrow{\mathbb {\widehat{Q}}})\) is an undirected CFG \(\Omega =(W,\mathbb {\widehat{P}},\mathbb {\widehat{Q}})\) with same CF node set as in \(\overrightarrow{\Omega }\) and have a CF edge in \(\mathfrak {C}_{k}(\overrightarrow{\Omega })\) connecting two distinct vertices g and f if and only if \(r^{'}>r\) and \(\theta ^{'}>\theta \). The MV of the edge (gf) in \(\mathfrak {C}_{k}(\overrightarrow{\Omega })\) is calculated as
$$\begin{aligned} \xi _{\mathbb {\widehat{Q}}}(g,f)= & {} \left( \frac{r^{'}-r}{r^{'}}\right) (\xi _{\mathbb {\widehat{P}}}(g)\wedge \xi _{\mathbb {\widehat{P}}}(f)) \times {\hbar }_{\xi }(\aleph ^{p}(g)\cap \aleph ^{p}(f)),\\ \varphi _{\mathbb {\widehat{Q}}}(g,f)= & {} 2\pi \left[ \frac{\theta ^{'}-\theta }{\theta ^{'}}\left( \frac{\varphi _{\mathbb {\widehat{P}}}(g)}{2\pi }\wedge \frac{\varphi _{\mathbb {\widehat{P}}}(f)}{2\pi }\right) \times \frac{{\hbar }_{\varphi }(\aleph ^{p}(g)\cap \aleph ^{p}(f))}{2\pi }\right] . \end{aligned}$$
Example 3
Let \(\overrightarrow{\Omega }=(W,\mathbb {\widehat{P}},\overrightarrow{\mathbb {\widehat{Q}}})\) be a CFG as presented in Fig. 3, given by
\(\mathbb {\widehat{P}}=\left\langle \dfrac{l}{0.6e^{i^{i1.2\pi }}},\dfrac{j}{0.4e^{i1.2\pi }}, \dfrac{x}{0.6e^{i0.3\pi }},\dfrac{z}{0.7e^{i1.3\pi }},\dfrac{m}{0.8e^{i0.9\pi }},\dfrac{n}{0.65e^{i1\pi }}\right\rangle ,\)
\(\overrightarrow{\mathbb {\widehat{Q}}}=\left\langle \dfrac{\overrightarrow{(l,x)}}{0.6e^{i0.3\pi }}, \dfrac{\overrightarrow{(l,z)}}{0.5e^{i0.2\pi }},\dfrac{\overrightarrow{(l,m)}}{0.45e^{i0.3\pi }}, \dfrac{\overrightarrow{(l,n)}}{0.35e^{i0.2\pi }},\dfrac{\overrightarrow{(j,x)}}{0.3e^{i0.2\pi }}, \dfrac{\overrightarrow{(j,z)}}{0.35e^{i0.9\pi }},\dfrac{\overrightarrow{(j,m)}}{0.36e^{i0.2\pi }}, \dfrac{\overrightarrow{(j,n)}}{0.4e^{i1\pi }}\right\rangle .\)
Table 3
CFON of the nodes
g
\(\aleph ^{p}(g)\)
l
\(\left\{ \left( k,0.3e^{i0.2\pi }\right) \right\} \)
i
\(\left\{ \left( l,0.2e^{i0.3\pi }\right) \right\} \)
m
\(\left\{ \left( i,0.35e^{i1.1\pi }\right) \right\} \)
k
\(\left\{ \left( m,0.2e^{i0.7\pi }\right) \right\} \)
n
\(\left\{ \left( l,0.25e^{i0.2\pi }\right) ,\left( k,0.2e^{i0.7\pi }\right) \right\} \)
Table 4
The CFS \(\aleph ^{p}(g)\cap \aleph ^{p}(f)\) and \({\hbar }(\aleph ^{p}(g)\cap \aleph ^{p}(f))\)
g
f
\(\aleph ^{p}(g)\cap \aleph ^{p}(f)\)
\({\hbar }\left( \aleph ^{p}(g)\cap \aleph ^{p}(f)\right) \)
l
i
\(\varnothing \)
\(\varnothing \)
l
m
\(\varnothing \)
\(\varnothing \)
l
k
\(\varnothing \)
\(\varnothing \)
l
n
\(\left\{ \left( k,0.2e^{i0.2\pi }\right) \right\} \)
\(\left\{ \left( 0.2e^{i0.2\pi }\right) \right\} \)
i
m
\(\varnothing \)
\(\varnothing \)
i
k
\(\varnothing \)
\(\varnothing \)
i
n
\(\left\{ \left( l,0.2e^{i0.2\pi }\right) \right\} \)
\(\left\{ \left( 0.2e^{i0.2\pi }\right) \right\} \)
m
k
\(\varnothing \)
\(\varnothing \)
m
n
\(\varnothing \)
\(\varnothing \)
k
n
\(\varnothing \)
\(\varnothing \)
The CFON of the nodes are given in Table 5.
Table 5
The CFON of the nodes
g
\(\aleph ^{p}(g)\)
j
\(\left\{ \left( n,0.4e^{i1.0\pi }\right) ,\left( m,0.36e^{i0.2\pi }\right) ,\left( x,0.3e^{i0.2\pi }\right) ,\left( z,0.35e^{i0.9\pi }\right) \right\} \)
l
\(\left\{ \left( n,0.35e^{i0.2\pi }\right) ,\left( m,0.45e^{i0.3\pi }\right) ,\left( x,0.6e^{i0.3\pi }\right) ,\left( z,0.5e^{i0.2\pi }\right) \right\} \)
x
\(\varnothing \)
z
\(\varnothing \)
m
\(\varnothing \)
n
\(\varnothing \)
Next, we have
$$\begin{aligned}&\aleph ^{p}(j)\cap \aleph ^{p}(l)\\&\quad =\{(n,0.35e^{i0.2\pi }),(m,0.36e^{i0.2\pi }),(z,0.35e^{i0.2\pi }),(x,0.3e^{i0.2\pi })\}. \end{aligned}$$
The CFSs \({\hbar }(\aleph ^{p}(j)\cap \aleph ^{p}(l))\) and \(|(\aleph ^{p}(j)\cap \aleph ^{p}(l))|\) are
$$\begin{aligned}&{\hbar }(\aleph ^{p}(j)\cap \aleph ^{p}(l))\\&\quad =\{(0.36e^{i0.2\pi })\},~~~|(\aleph ^{p}(j)\cap \aleph ^{p}(l))|=(1.36e^{i0.8\pi }). \end{aligned}$$
Let \(k=0.2e^{i0.2\pi },\) then there is only one edge in CF \(0.2e^{i0.2\pi }\)-competition graph as
$$\begin{aligned} |(\aleph ^{p}(j)\cap \aleph ^{p}(l))|_{\xi }&=1.36>0.2,\\ |(\aleph ^{p}(j)\cap \aleph ^{p}(l))|_{\varphi }&=0.8\pi >0.2\pi . \end{aligned}$$
The corresponding \(\mathfrak {C}_{0.2e^{i0.2\pi }}(\overrightarrow{\Omega })\) is shown in Fig. 4.
Definition 14
Consider a CFG \(\Omega =\left( W,\mathbb {\widehat{P}},\mathbb {\widehat{Q}}\right) \). If \(\forall \) \(g,f \in W\)
$$\begin{aligned} \xi _{\mathbb {\widehat{Q}}}(g,f)> & {} \frac{1}{2}(\xi _{\mathbb {\widehat{P}}}(g)\wedge \xi _{\mathbb {\widehat{P}}}(f)),\\ \varphi _{\mathbb {\widehat{Q}}}(g,f)> & {} \frac{1}{2}\left[ 2\pi \left( \frac{\varphi _{\mathbb {\widehat{P}}}(g)}{2\pi }\wedge \frac{\varphi _{\mathbb {\widehat{P}}}(f)}{2\pi }\right) \right] , \end{aligned}$$
then the edge (gf) is said to be a strong edge.
Theorem 1
Let \(\overrightarrow{\Omega }=\left( W,\mathbb {\widehat{P}},\overrightarrow{\mathbb {\widehat{Q}}}\right) \) be a CFDG. If there exists only one element in CFS \((\aleph ^{p}(g)\cap \aleph ^{p}(f)),\) and \(|\aleph ^{p}(g)\cap \aleph ^{p}(f)|_{\xi }>\frac{1}{2}\) and \(|\aleph ^{p}(g)\cap \aleph ^{p}(f)|_{\theta }>1\pi ,\) then the edge (gf) of \(\mathfrak {C}(\overrightarrow{\Omega })\) is strong.
Proof
Let \(\overrightarrow{\Omega }=\left( W,\mathbb {\widehat{P}},\overrightarrow{\mathbb {\widehat{Q}}}\right) \) be a CFDG. Let \((\aleph ^{p}(g)\cap \aleph ^{p}(f)) =\{(x,ce^{i\theta })\},\) where \(ce^{i\theta }\) is the MV of the edge (gc) or (fc). Then clearly
$$\begin{aligned} {\hbar }(\aleph ^{p}(g)\cap \aleph ^{p}(f))= & {} ce^{i\theta }=|(\aleph ^{p}(g)\cap \aleph ^{p}(f))|, \end{aligned}$$
where
$$\begin{aligned} {\hbar }_{\xi }(\aleph ^{p}(g)\cap \aleph ^{p}(f))= & {} c=|(\aleph ^{p}(g)\cap \aleph ^{p}(f))|_{\xi },\\ {\hbar }_{\varphi }(\aleph ^{p}(g)\cap \aleph ^{p}(f))= & {} \theta =|(\aleph ^{p}(g)\cap \aleph ^{p}(f))|_{\varphi }. \end{aligned}$$
So, the MV of the edge (gf) in CFCG is
$$\begin{aligned} \xi _{\mathbb {\widehat{Q}}}(g,f)= & {} (\xi _{\mathbb {\widehat{P}}}(g)\wedge \xi _{\mathbb {\widehat{P}}}(f))\times {\hbar }_{\xi } (\aleph ^{p}(g)\cap \aleph ^{p}(f)),\\ \xi _{\mathbb {\widehat{Q}}}(g,f)= & {} (\xi _{\mathbb {\widehat{P}}}(g)\wedge \xi _{\mathbb {\widehat{P}}}(f))\times c,\\\\ \varphi _{\mathbb {\widehat{Q}}}(g,f)= & {} 2\pi \left[ \left( \frac{\varphi _{\mathbb {\widehat{P}}}(g)}{2\pi }\wedge \frac{\varphi _{\mathbb {\widehat{P}}}(f)}{2\pi }\right) \right. \\&\left. \times \frac{{\hbar }_{\varphi }(\aleph ^{p}(g)\cap \aleph ^{p}(f))}{2\pi }\right] ,\\ \varphi _{\mathbb {\widehat{Q}}}(g,f)= & {} 2\pi \left[ \left( \frac{\varphi _{\mathbb {\widehat{P}}}(g)}{2\pi }\wedge \frac{\varphi _{\mathbb {\widehat{P}}}(f)}{2\pi }\right) \times \frac{\theta }{2\pi }\right] . \end{aligned}$$
Thus, in \(\mathfrak {C}(\overrightarrow{\Omega }),\) the edge (gf) is strong as \(c>\frac{1}{2}\) and \(\theta >1\pi .\) \(\square \)
Definition 15
Let \(B=\{(q,\xi _{B}(q)e^{i\varphi _{B}(q)}|q\in Z)\},\) be a CFS. The the support of CFS is a subset \(B_{0}\) of Z,  defined as
$$\begin{aligned} B_{0}=\{q\in Z:\xi _{B}(q)\ne 0\}. \end{aligned}$$
Now, we discuss p-competition complex fuzzy graph.
Definition 16
Let \(\breve{p}\) be positive integer. The \(\breve{p}\)-competition CFG \(\mathfrak {C}^{\breve{p}}(\overrightarrow{\Omega })\) of a CFDG \(\overrightarrow{\Omega }=(W,\mathbb {\widehat{P}},\overrightarrow{\mathbb {\widehat{Q}}})\) is an undirected CFG \(\Omega =(W,\mathbb {\widehat{P}},\mathbb {\widehat{Q}})\) with same CF node set as \(\overrightarrow{\Omega }\) and possesses a CF edge joining two distinct nodes g and \(f\in W\) in \(\mathfrak {C}^{\breve{p}}(\overrightarrow{\Omega })\) if and only if \(|supp(\aleph ^{p}(g)\cap \aleph ^{p}(f))|\ge \breve{p}.\) The MV of edge (gf) \(\in \mathfrak {C}^{\breve{p}}(\overrightarrow{\Omega })\) is calculated as
$$\begin{aligned} \xi _{\mathbb {\widehat{Q}}}(g,f)= & {} \left( \frac{(t-\breve{p})+1}{t}\right) (\xi _{\mathbb {\widehat{P}}}(g)\wedge \xi _{\mathbb {\widehat{P}}}(f))\\&\times {\hbar }_{\xi }(\aleph ^{p}(g)\cap \aleph ^{p}(f)),\\ \varphi _{\mathbb {\widehat{Q}}}(g,f)= & {} 2\pi \left[ \left( \frac{(t-\breve{p})+1}{t}\right) \left( \frac{\varphi _{\mathbb {\breve{P}}}(g)}{2\pi }\wedge \frac{\varphi _{\mathbb {\widehat{P}}}(f)}{2\pi }\right) \right. \\&\left. \times \frac{ {\hbar }_{\varphi }(\aleph ^{p}(g)\cap \aleph ^{p}(f))}{2\pi }\right] , \end{aligned}$$
where \(t=|supp(\aleph ^{p}(g)\cap \aleph ^{p}(f))|.\)
Example 4
Let \(\overrightarrow{\Omega }=(W,\mathbb {\widehat{P}},\overrightarrow{\mathbb {\widehat{Q}}})\) be a CFDG as presented in Fig. 5a, given by
\(\mathbb {\widehat{P}}=\left\langle \dfrac{m}{0.7e^{i1.3\pi }},\dfrac{h}{0.8e^{i0.7\pi }},\dfrac{j}{0.9e^{i1.4\pi }} ,\dfrac{r}{0.75e^{i0.9\pi }},\dfrac{s}{0.85e^{i1.7\pi }},\dfrac{z}{0.95e^{i0.3\pi }}\right\rangle ,\)
\(\overrightarrow{\mathbb {\widehat{Q}}}=\left\langle \dfrac{\overrightarrow{(m,r)}}{0.7e^{i0.8\pi }}, \dfrac{\overrightarrow{(m,s)}}{0.7e^{i1.3\pi }},\dfrac{\overrightarrow{(h,r)}}{0.6e^{i0.3\pi }}, \dfrac{\overrightarrow{(h,s)}}{0.8e^{i0.7\pi }}, \dfrac{\overrightarrow{(h,z)}}{0.8e^{i0.3\pi }},\dfrac{\overrightarrow{(j,z)}}{0.9e^{i0.3\pi }}\right\rangle .\)
The CFON of the nodes are give in Table 6.
Table 6
CFON of the nodes
g
\(\aleph ^{p}(g)\)
m
\(\{\left( r,0.7e^{i0.8\pi }\right) ,(s,0.7e^{i1.3\pi })\}\)
h
\(\{(r,0.6e^{i0.3\pi }),(s,0.8e^{i0.7\pi }),(z,0.8e^{i0.3\pi })\}\)
j
\(\{(z,0.8e^{i0.3\pi })\}\)
r
\(\varnothing \)
s
\(\varnothing \)
z
\(\varnothing \)
The corresponding two-competition CFG has only one edge as
$$\begin{aligned} \aleph ^{p}(m)\cap \aleph ^{p}(h)=\{(r,0.6e^{i0.3\pi }),(s,0.7e^{i0.7\pi })\}\ne \varnothing . \end{aligned}$$
The corresponding \(\mathfrak {C}^{2}(\overrightarrow{\Omega })\) is shown in Fig. 5b.
Theorem 2
Let \(\overrightarrow{\Omega }=\left( W,\mathbb {\widehat{P}},\overrightarrow{\mathbb {\widehat{Q}}}\right) \) be a CFDG. Then the edge (gf) is strong, if \( {\hbar }_{\xi }(\aleph ^{p}(g)\cap \aleph ^{p}(f))=1\) and \( {\hbar }_{\varphi }(\aleph ^{p}(g)\cap \aleph ^{p}(f))=2\pi \) in \(\mathfrak {C}^{[\frac{t}{2}]}(\overrightarrow{\Omega }),\) where \(t=|supp(\aleph ^{p}(g)\cap \aleph ^{p}(f))|.\)
Proof
Consider \(\overrightarrow{\Omega }=\left( W,\mathbb {\widehat{P}},\overrightarrow{\mathbb {\widehat{Q}}}\right) \) is a CFDG. Let \(\Omega =(W,\mathbb {\widehat{P}},\mathbb {\widehat{Q}})\) be the corresponding \([\frac{t}{2}]-\)CFCG, where \(t=|supp(\aleph ^{p}(g)\cap \aleph ^{p}(f))|.\) According to the statement, we have \({\hbar }_{\xi }(\aleph ^{p}(g)\cap \aleph ^{p}(f))=1\) and \( {\hbar }_{\varphi }(\aleph ^{p}(g)\cap \aleph ^{p}(f))=2\pi .\) Then by Definition 16, we have
$$\begin{aligned} \xi _{\mathbb {\widehat{Q}}}(g,f)= & {} \frac{t-[\frac{t}{2}]+1}{t}(\xi _{\mathbb {\widehat{P}}}(g)\wedge \xi _{\mathbb {\widehat{P}}}(f))\\&\times {\hbar }_{\xi }(\aleph ^{p}(g)\cap \aleph ^{p}(f))\\= & {} \frac{t-[\frac{t}{2}]+1}{t}(\xi _{\mathbb {\widehat{P}}}(g)\wedge \xi _{\mathbb {\widehat{P}}}(f)),\\ \varphi _{\mathbb {\widehat{Q}}}(g,f)= & {} 2\pi \left[ \frac{t-[\frac{t}{2}]+1}{t}\left( \frac{\varphi _{\mathbb {\widehat{P}}}(g)}{2\pi }\wedge \frac{\varphi _{\mathbb {\widehat{P}}}(f)}{2\pi }\right) \right. \\&\left. \times \frac{{\hbar }_{\varphi }(\aleph ^{p}(g)\cap \aleph ^{p}(f))}{2\pi }\right] \\= & {} 2\pi \left[ \frac{t-[\frac{t}{2}]+1}{t}\left( \frac{\varphi _{\mathbb {\widehat{P}}}(g)}{2\pi }\wedge \frac{\varphi _{\mathbb {\widehat{P}}}(f)}{2\pi }\right) \times \frac{2\pi }{2\pi }\right] . \end{aligned}$$
Thus, \(\xi _{\mathbb {\widehat{Q}}}(g,f)>\frac{1}{2}(\xi _{\mathbb {\widehat{P}}}(g)\wedge \xi _{\mathbb {\widehat{P}}}(f))\) and \(\varphi _{\mathbb {\widehat{Q}}}(g,f)> \frac{1}{2}\left[ 2\pi \left( \frac{\varphi _{\mathbb {\widehat{P}}}(g)}{2\pi }\wedge \frac{\varphi _{\mathbb {\widehat{P}}}(f)}{2\pi }\right) \right] ,\) as \(\frac{t-[\frac{t}{2}]+1}{t}> \frac{1}{2}.\) Hence, the edge (gf) is strong. \(\square \)

Complex fuzzy set applied to neighborhood graphs

Now, we discuss complex fuzzy neighborhood graphs by the combination of CFS and neighborhood graphs. Before the introduction of CF neighborhood graphs (CFNGs), we first define complex fuzzy open and closed neighborhood of a node in CFGs below.
Definition 17
For a node g of a CFG \(\Omega =\left( W,\mathbb {\widehat{P}},\mathbb {\widehat{Q}}\right) \) the CF open neighborhood \((CFO^{p}N)\) is a CFS
$$\begin{aligned} \aleph (g)=\left( S_{g},m_{g}e^{i\eta _{g}}\right) , \end{aligned}$$
where
$$\begin{aligned} S_{g}=\{f|\xi _{\mathbb {\widehat{Q}}}(g,f)>0\} \end{aligned}$$
such that \(m_{g}:S_{g}\rightarrow [0,1]\) given by \(m_{g}(f)=\xi _{\mathbb {\widehat{Q}}}(g,f)\) and \(\eta _{g}:S_{g}\rightarrow [0,2\pi ]\) given by \(\eta _{g}(f)=\varphi _{\mathbb {\widehat{Q}}}(g,f)\).
For each node \(g\in W,\) CF singleton set is given as
$$\begin{aligned} \mathbb {\widehat{P}}_{g}=(\{g\},\xi ^{'}_{\mathbb {\widehat{P}}}e^{i\varphi ^{'}_{\mathbb {\widehat{P}}}}), \end{aligned}$$
where \(\xi ^{'}_{\mathbb {\widehat{P}}}:\{g\}\rightarrow [0,1]\) and \(\varphi ^{'}_{\mathbb {\widehat{P}}}:\{g\}\rightarrow [0,2\pi ]\) given by \(\xi ^{'}_{\mathbb {\widehat{P}}}(g)=\xi _{\mathbb {\widehat{P}}}(g)\) and \(\varphi ^{'}_{\mathbb {\widehat{P}}}(g)=\varphi _{\mathbb {\widehat{P}}}(g),\) respectively. Now, we define CF closed neighborhood \((CFC^{l}N)\) of a node g as
$$\aleph [g]=\aleph (g)\cup \mathbb {\widehat{P}}_{g}.$$
Next, we define CF open neighborhood graphs and CF closed neighborhood graphs. Then on the bases of these CFGs, we define complex fuzzy k-neighborhood graphs of both close and open types.
Definition 18
Let \(\Omega =\left( W,\mathbb {\widehat{P}},\mathbb {\widehat{Q}}\right) \) be a CFG. Complex fuzzy open neighborhood graph \((CFO^{p}NG)\) of \(\Omega \) is a CFG denoted by \(\mathfrak {N}(\Omega )=\left( W,\mathbb {\widehat{P}},\mathbb {\widehat{Q}}^{'}\right) \) with same CF node set as \(\Omega \) and possesses a CF edge joining two distinct nodes g and f in \(\mathfrak {N}(\Omega )\) if and only if the CFS \(\aleph (g)\cap \aleph (f)\ne \varnothing \) in \(\Omega \) and the MV of the edge (gf) in \(\mathfrak {N}(\Omega )\) is calculated as
$$\begin{aligned} \xi _{\mathbb {\widehat{Q}}^{'}}(g,f)= & {} \left( \xi _{\mathbb {\widehat{P}}}(g)\wedge \xi _{\mathbb {\widehat{P}}}(f)) \times {\hbar }_{\xi }(\aleph (g)\cap \aleph (f)\right) , \\ \varphi _{\mathbb {\widehat{Q}}^{'}}(g,f)= & {} 2\pi \left[ \left( \dfrac{\varphi _{\mathbb {\widehat{P}}}(g)}{2\pi }\wedge \frac{\varphi _{\mathbb {\widehat{P}}}(f)}{2\pi }\right) \times \frac{{\hbar }_{\varphi }(\aleph (g)\cap \aleph (f))}{2\pi }\right] . \end{aligned}$$
Definition 19
Let \(\Omega =\left( W,\mathbb {\widehat{P}},\mathbb {\widehat{Q}}\right) \) be a CFG. Complex fuzzy closed neighborhood graph \((CFC^{l}NG)\) of \(\Omega \) is a CFG denoted by \(\mathfrak {N}[\Omega ]=\left( W,\mathbb {\widehat{P}},\mathbb {\widehat{Q}}^{'}\right) \) with same CF node set as \(\Omega \) and possesses a CF edge joining two distinct nodes g and \(f\in W\) in \(\mathfrak {N}[\Omega ]\) if and only if the CFS \(\aleph [g]\cap \aleph [f]\ne \varnothing \) in \(\Omega \) and the MV of the edge (gf) in \(\mathfrak {N}[\Omega ]\) is calculated as
$$\begin{aligned} \xi _{\mathbb {\widehat{Q}}^{'}}(g,f)= & {} \left( \xi _{\mathbb {\widehat{P}}}(g)\wedge \xi _{\mathbb {\widehat{P}}}(f)\right) \times {\hbar }_{\xi }\left( \aleph [g]\cap \aleph [f]\right) ,\\ \varphi _{\mathbb {\widehat{Q}}^{'}}(g,f)= & {} 2\pi \left[ \left( \frac{\varphi _{\mathbb {\widehat{P}}}(g)}{2\pi }\wedge \frac{\varphi _{\mathbb {\widehat{P}}}(f)}{2\pi }\right) \times \frac{{\hbar }_{\varphi }\left( \aleph [g]\cap \aleph [f]\right) }{2\pi }\right] . \end{aligned}$$
Definition 20
Complex fuzzy (k)-neighborhood graph of a CFG \(\Omega =(W,\mathbb {\widehat{P}},\mathbb {\widehat{Q}})\) is a CFG \(\mathfrak {N}_{k}(\Omega )=(W,\mathbb {\widehat{P}},\mathbb {\widehat{Q}}^{'})\) with same node set as \(\Omega \) and possesses a CF edge joining two distinct nodes g and f in \(\mathfrak {N}_{k}(\Omega )\) if and only if \(x^{'}>r\) and \(\omega ^{'}>\theta \) and the MV of the edge (gf) in \(\mathfrak {N}_{k}(\Omega )\) is calculated as
$$\begin{aligned} \xi _{\mathbb {\widehat{Q}}^{'}}(g,f)= & {} \left( \frac{x^{'}-r}{x^{'}}\right) (\xi _{\mathbb {\widehat{P}}}(g)\wedge \xi _{\mathbb {\widehat{P}}}(f))\\&\times {\hbar }_{\xi }(\aleph (g)\cap \aleph (f)), \\ \varphi _{\mathbb {\widehat{Q}}^{'}}(g,f)= & {} 2\pi \left[ \frac{\omega ^{'}-\theta }{\omega ^{'}}\left( \frac{\varphi _{\mathbb {\widehat{P}}}(g)}{2\pi }\wedge \frac{\varphi _{\mathbb {\widehat{P}}}(f)}{2\pi }\right) \right. \\&\left. \times \frac{{\hbar }_{\varphi }(\aleph (g)\cap \aleph (f))}{2\pi }\right] . \end{aligned}$$
Here, k is a complex number given by \(k=re^{i\theta }\) and \(|\aleph (g)\cap \aleph (f)|=x^{'}e^{i\omega ^{'}}.\)
Definition 21
Let \(\Omega =\left( W,\mathbb {\widehat{P}},\mathbb {\widehat{Q}}\right) \) be a CFG. Complex fuzzy [k]-neighborhood graph of \(\Omega =\left( W,\mathbb {\widehat{P}},\mathbb {\widehat{Q}}\right) \) is a CFG \(\mathfrak {N}_{k}[\Omega ]=\left( W,\mathbb {\widehat{P}},\mathbb {\widehat{Q^{'}}}\right) \) with same node set as \(\Omega \) and possesses a CF edge joining two distinct nodes g and f in \(\mathfrak {N}_{k}[\Omega ]\) if and only if \(x^{''}>r\) and \(\omega ^{''}>\theta \) in \(\Omega \) and the MV of the edge (gf) in \(\mathfrak {N}_{k}[\Omega ]\) is calculated as
$$\begin{aligned} \xi _{\mathbb {\widehat{Q}}^{'}}(g,f)= & {} \left( \frac{x^{''}-r}{x^{''}}\right) (\xi _{\mathbb {\widehat{P}}}(g)\wedge \xi _{\mathbb {\widehat{P}}}(f))\\&\times {\hbar }_{\xi }\left( \aleph [g]\cap \aleph [f]\right) , \\ \varphi _{\mathbb {\widehat{Q}}^{'}}(g,f)= & {} 2\pi \left[ \frac{\omega ^{''}-\theta }{\omega ^{''}}\left( \frac{\varphi _{\mathbb {\widehat{P}}}(g)}{2\pi }\wedge \frac{\varphi _{\mathbb {\widehat{P}}}(f)}{2\pi }\right) \right. \\&\left. \times \frac{{\hbar }_{\varphi }\left( \aleph [g]\cap \aleph [f]\right) }{2\pi }\right] . \end{aligned}$$
Here, k is a complex number given by \(k=re^{i\theta }\) and \(|\aleph [g]\cap \aleph [f]|=x^{''}e^{i\omega ^{''}}.\)
Example 5
Let \(\Omega =(W,\mathbb {\widehat{P}},\mathbb {\widehat{Q}})\) be a CFG, where
\(\mathbb {\widehat{P}}=\left\langle \dfrac{p}{0.3e^{i1.9\pi }},\dfrac{q}{0.6e^{i1.8\pi }}, \dfrac{r}{0.4e^{i1.5\pi }},\dfrac{s}{0.5e^{i1.7\pi }},\dfrac{t}{0.4e^{i1.9\pi }}\right\rangle ,\)
\(\mathbb {\widehat{Q}}=\left\langle \dfrac{(p,q)}{0.3e^{i1.7\pi }},\dfrac{(q,r)}{0.4e^{i1.5\pi }},\dfrac{(r,s)}{0.4e^{i1.4\pi }}, \dfrac{(s,t)}{0.4e^{i1.7\pi }},\dfrac{(t,p)}{0.3e^{i1.8\pi }},\dfrac{(p,s)}{0.3e^{i1.7\pi }}\right\rangle .\)
The CFDG is displayed in Fig. 6a. The CF neighborhoods of the nodes are presented in Table 7.
The height and cardinality of CFSs \((\aleph (g)\cap \aleph (f))\) and \((\aleph [g]\cap \aleph [f])\) are displayed in Table 8.
The corresponding \((CFO^{p}NG)\) \(\mathfrak {N}(\Omega ),\) the \((CFC^{l}NG)\) \(\mathfrak {N}[\Omega ],\) the complex fuzzy \((0.2e^{i0.2\pi })\)-neighborhood graph \(\mathfrak {N}_{0.2e^{i0.2\pi }}(\Omega )\) and the complex fuzzy \([0.2e^{i0.2\pi }]-\)neighbourhood graph \(\mathfrak {N}_{0.2e^{i0.2\pi }}[\Omega ]\) of the CFG \(\Omega \) are shown in Fig. 6.
Theorem 3
For each edge of CFG G,  there exists one edge in \(\mathfrak {N}[\Omega ]\).
Table 7
\(CFO^{p}N\) and \(CFC^{l}N\) of the nodes
g
\(\aleph (g)\)
\(\aleph [g]\)
p
\(\{(q,0.3e^{i1.7\pi })(t,0.3e^{i1.8\pi }),(s,0.3e^{i1.7\pi })\}\)
\(\{(q,0.3e^{i1.7\pi })((t,0.3e^{i1.8\pi }),(s,0.3e^{i1.7\pi }))\}\)
  
\(\cup \{(p,0.3e^{i1.9\pi })\}\)
q
\(\{(p,0.3e^{i1.7\pi }),(r,0.4e^{i1.5\pi })\}\)
\(\{(p,0.3e^{i1.7\pi }),(r,0.4e^{i1.5\pi })\}\cup \{(q,0.6e^{i1.8\pi })\}\)
r
\(\{(q,0.4e^{i1.5\pi }),(s,0.4e^{i1.4\pi })\}\)
\(\{(q,0.4e^{i1.5\pi }),(s,0.4e^{i1.4\pi })\}\cup \{(r,0.4e^{i1.5\pi })\}\)
s
\(\{(r,0.4e^{i1.4\pi }),(t,0.4e^{i1.7\pi }),(p,0.3e^{i1.7\pi })\}\)
\(\{(r,0.4e^{i1.4\pi }),(t,0.4e^{i1.7\pi }),(p,0.3e^{i1.7\pi })\}\)
  
\(\cup \{(s,0.5e^{i1.7\pi })\}\)
t
\(\{(p,0.3e^{i1.8\pi }),(s,0.4e^{i1.7\pi })\}\)
\(\{(p,0.3e^{i1.8\pi }),(s,0.4e^{i1.7\pi })\}\cup \{(t,0.4e^{i1.9\pi })\}\)
Table 8
Height and cardinality of CFSs \((\aleph (g)\cap \aleph (f))\) and \((\aleph [g]\cap \aleph [f])\)
g
f
\(\aleph (g)\cap \aleph (f)\)
\(\aleph [g]\cap \aleph [f]\)
p
q
\(\varnothing \)
\(\{(p,0.3e^{i1.7\pi }),(q,0.3e^{i1.7\pi })\}\)
p
r
\(\{(q,0.3e^{i1.5\pi }),(s,0.3e^{i1.4\pi })\}\)
\(\{(q,0.3e^{i1.5\pi }),(s,0.3e^{i1.4\pi })\}\)
p
s
\(\{(t,0.3e^{i1.7\pi })\}\)
\(\{(p,0.3e^{i1.7\pi }),(s,0.3e^{i1.7\pi }),(t,0.3e^{i1.7\pi })\}\)
p
t
\(\{(s,0.3e^{i1.7\pi })\}\)
\(\{(p,0.3e^{i1.8\pi }),(s,0.3e^{i1.7\pi }),(t,0.3e^{i1.8\pi })\}\)
q
r
\(\varnothing \)
\(\{(q,0.4e^{i1.5\pi }),(r,0.4e^{i1.5\pi })\}\)
q
s
\(\{(r,0.4e^{i1.4\pi }),(p,0.3e^{i1.7\pi })\}\)
\(\{(p,0.3e^{i1.7\pi }),(r,0.4e^{i1.4\pi })\}\)
q
t
\(\{(p,0.3e^{i1.7\pi })\}\)
\(\{(p,0.3e^{i1.7\pi })\}\)
r
s
\(\varnothing \)
\(\{(s,0.4e^{i1.4\pi }),(r,0.4e^{i1.4\pi })\}\)
r
t
\(\{(s,0.4e^{i1.4\pi })\}\)
\(\{(s,0.4e^{i1.4\pi })\}\)
s
t
\(\{(p,0.3e^{i1.7\pi })\}\)
\(\{(p,0.3e^{i1.7\pi }),(s,0.4e^{i1.7\pi }),(t,0.4e^{i1.7\pi })\}\)
g
f
\({\hbar }\left( \aleph (g)\cap \aleph (f)\right) \)
\({\hbar }\left( \aleph [g]\cap \aleph [f]\right) \)
\(|\aleph (g)\cap \aleph (f)|\)
\(|\aleph [g]\cap \aleph [f]|\)
p
q
\(\varnothing \)
\(\{(0.3e^{i1.7\pi })\}\)
\(\varnothing \)
\((0.6e^{i3.4\pi })\)
p
r
\(\{(0.3e^{1.5\pi })\}\)
\(\{(0.3e^{i1.5\pi })\}\)
\((0.6e^{i2.9\pi })\)
\((0.6e^{i2.9\pi })\)
p
s
\(\{(0.3e^{i1.7\pi })\}\)
\(\{(0.3e^{i1.7\pi })\}\)
\((0.3e^{i1.7\pi })\)
\((0.9e^{i5.1\pi })\)
p
t
\(\{(0.3e^{i1.7\pi })\}\)
\(\{(0.3e^{i1.8\pi })\}\)
\((0.3e^{i1.7\pi })\)
\((0.9e^{i5.3\pi })\)
q
r
\(\varnothing \)
\(\{(0.4e^{i1.5\pi })\}\)
\(\varnothing \)
\((0.8e^{i3.0\pi })\)
q
s
\(\{(0.4e^{i1.7\pi })\}\)
\(\{(0.4e^{i1.7\pi })\}\)
\((0.7e^{i3.1\pi })\)
\((0.7e^{i3.1\pi })\)
q
t
\(\{(0.3e^{i1.7\pi })\}\)
\(\{(0.3e^{i1.7\pi })\}\)
\((0.3e^{i1.7\pi })\)
\((0.3e^{i1.7\pi })\)
r
s
\(\varnothing \)
\(\{(0.4e^{i1.4\pi })\}\)
\(\varnothing \)
\((0.8e^{i2.8\pi })\)
r
t
\(\{(0.4e^{i1.4\pi })\}\)
\(\{(0.4e^{i1.4\pi })\}\)
\((0.4e^{i1.4\pi })\)
\((0.4e^{i1.4\pi })\)
s
t
\(\{(0.3e^{i1.7\pi })\}\)
\(\{(0.4e^{i1.7\pi })\}\)
\((0.3e^{i1.7\pi })\)
\((1.1e^{i5.1\pi })\)
Proof
Let \(\Omega =\left( W,\mathbb {\widehat{P}},\mathbb {\widehat{Q}}\right) \) be a CFG and (gf) be an edge of CFG. Let the corresponding \((CFC^{l}NG)\) be \(\mathfrak {N}[\Omega ]=\left( W,\mathbb {\widehat{P}},\mathbb {\widehat{Q}}^{'}\right) .\) Then \(g,f\in \aleph [g]\) and \(g,f\in \aleph [f].\) Thus, \(g,f\in \aleph [g]\cap \aleph [f].\) So, \({\hbar }_{\xi }(\aleph [g]\cap \aleph [f])\ne 0,\) and \({\hbar }_{\varphi }(\aleph [g]\cap \aleph [f])\ne 0.\) Thus, the amplitude and phase terms of the MV are
$$\begin{aligned} \xi _{\mathbb {\widehat{Q}}^{'}}(g,f)= & {} (\xi _{\mathbb {\widehat{P}}}(g) \wedge \xi _{\mathbb {\widehat{P}}}(f))\times {\hbar }_{\xi }(\aleph [g]\cap \aleph [f]) \ne 0,\\ \varphi _{\mathbb {\widehat{Q}}^{'}}(g,f)= & {} 2\pi \left[ \left( \frac{\varphi _{\mathbb {\widehat{P}}}(g)}{2\pi }\wedge \frac{\varphi _{\mathbb {\widehat{P}}}(f)}{2\pi }\right) \times \frac{{\hbar }_{\varphi }(\aleph [g]\cap \aleph [f])}{2\pi }\right] \ne 0. \end{aligned}$$
Thus, for each edge (gf) in \(\Omega \) there exists an edge (gf) in \(\mathfrak {N}[\Omega ].\) \(\square \)
Definition 22
Let \(\overrightarrow{\Omega }=\left( W,\mathbb {\widehat{P}},\overrightarrow{\mathbb {\widehat{Q}}}\right) \) be a CFDG. The underlying CFG of \(\overrightarrow{\Omega }\) is the CFG symbolized by \(\mathfrak {U}(\Omega )\) and is defined as \(\mathfrak {U}(\Omega )=(W,\mathbb {\widehat{P}},\mathbb {\widehat{Q}}),\) where \(\mathbb {\widehat{P}}\) and \(\mathbb {\widehat{Q}}\) are CFS and CFR on W such that
$$\begin{aligned} \xi _{\mathbb {\widehat{Q}}}(g,f)= & {} \left( \xi _{\mathbb {\widehat{P}}}\overrightarrow{(g,f)}\wedge \xi _{\mathbb {\widehat{P}}}\overrightarrow{(f,g)}\right) ,\\ \varphi _{\mathbb {\widehat{Q}}}(g,f)= & {} \left( \varphi _{\mathbb {\widehat{P}}}\overrightarrow{(g,f)}\wedge \varphi _{\mathbb {\widehat{P}}}\overrightarrow{(f,g)}\right) , \end{aligned}$$
for all \(g,f\in W.\)
Now, we establish a relation between \(\mathfrak {N}_{k}(\Omega )\) and \(\mathfrak {C}_{k}(\Omega ).\)
Theorem 4
If a symmetric CFDG \(\overrightarrow{\Omega }\) is loopless, then \(\mathfrak {C}_{k}(\overrightarrow{\Omega })=\mathfrak {N}_{k}(\mathfrak {U}(\Omega )),\) where \(\mathfrak {U}(\Omega )\) is the underlying CFG of \(\overrightarrow{\Omega }.\) (Here, \(k=re^{i\theta }\))
Proof
Let \(\overrightarrow{\Omega }=\left( W,\mathbb {\widehat{P}},\overrightarrow{\mathbb {\widehat{Q}}}\right) \) be a CFDG and the corresponding underlying CFG of \(\overrightarrow{\Omega }\) be \(\mathfrak {U}(\Omega )=\left( W,\mathbb {\widehat{P}},\mathbb {\widehat{Q}}\right) .\) Also, let \(\mathfrak {C}_{k}(\overrightarrow{\Omega })=\left( W,\mathbb {\widehat{P}},\mathbb {\breve{C}}\right) \) and \(\mathfrak {N}_{k}(\mathfrak {U}(\Omega ))=\left( W,\mathbb {\widehat{P}},\mathbb {\breve{C}}^{'}\right) .\) The complex fuzzy node of \(\mathfrak {C}_{k}(\Omega )\) is same as \(\overrightarrow{\Omega }.\) Also the node set of an underlying CFG is same as the complex fuzzy node of CFDG. Hence, \(\mathfrak {N}_{k}(\mathfrak {U}(\Omega ))\) has the same complex fuzzy node set as \(\mathfrak {C}_{k}(\Omega )\). Now, we need to show that complex fuzzy edge set of \(\mathfrak {C}_{k}\left( \overrightarrow{\Omega }\right) \) is equal to the edge set of \(\mathfrak {N}_{k}\left( \mathfrak {U}(\Omega )\right) .\) For this, we need to show that \(\xi _{\mathbb {\breve{C}}}(g,f)=\xi _{\mathbb {\breve{C}}^{'}}(g,f)\) and \(\varphi _{\mathbb {\breve{C}}}(g,f)=\varphi _{\mathbb {\breve{C}}^{'}}(g,f),\) for all \(g,f\in W.\)
Case 1
If \(|\left( \aleph ^{p}(g)\cap \aleph ^{p}(f)\right) |_{\xi }=r^{'}\le r\) and \(|\left( \aleph ^{p}(g)\cap \aleph ^{p}(f)\right) |_{\varphi }=\theta ^{'}\le \theta \) in \(\overrightarrow{\Omega },\) then \(\xi _{\mathbb {\breve{C}}}(g,f)=0\) and \(\varphi _{\mathbb {\breve{C}}}(g,f)=0\) in \(\mathfrak {C}_{k}\left( \overrightarrow{\Omega }\right) .\) As \(\overrightarrow{\Omega }\) is symmetric CFG, \(|\left( \aleph (g)\cap \aleph (f)\right) |_{\xi }=x^{'}\le r\) and \(|\left( \aleph (g)\cap \aleph (f)\right) |_{\varphi }=\omega ^{'}\le \theta \) in \(\mathfrak {U}(\Omega )\). So, \(\xi _{\mathbb {\breve{C}}^{'}}(g,f)=0\) and \(\varphi _{\mathbb {\breve{C}}^{'}}(g,f)=0\) in \(\mathfrak {N}_{k}\left( \mathfrak {U}(\Omega )\right) .\)
Case 2
If \(r^{'}>r\) and \(\theta ^{'}>\theta \) in \(\overrightarrow{\Omega },\) then \(\xi _{\mathbb {\breve{C}}}(g,f)>0\) and \(\varphi _{\mathbb {\breve{C}}}(g,f)>0\) in \(\mathfrak {C}_{k}\left( \overrightarrow{\Omega }\right) .\) Then amplitude and phase term in \(\mathfrak {C}_{k}\left( \overrightarrow{\Omega }\right) \) are given by
$$\begin{aligned} \xi _{\mathbb {\breve{C}}}(g,f)= & {} \left( \frac{(r^{'}-r)}{r^{'}}\right) (\xi _{\mathbb {\widehat{P}}}(g)\wedge \xi _{\mathbb {\widehat{P}}}(f))\\&\times {\hbar }_{\xi }(\aleph ^{p}(g)\cap \aleph ^{p}(f)),\\ \varphi _{\mathbb {\breve{C}}}(g,f)= & {} 2\pi \left[ \frac{\theta ^{'}-\theta }{\theta ^{'}}\left( \frac{\varphi _{\mathbb {\widehat{P}}}(g)}{2\pi }\wedge \frac{\varphi _{\mathbb {\widehat{P}}}(f)}{2\pi }\right) \right. \\&\left. \times \frac{{\hbar }_{\varphi }\left( \aleph ^{p}(g)\cap \aleph ^{p}(f)\right) }{2\pi }\right] . \end{aligned}$$
As \(\overrightarrow{\Omega }\) is symmetric CFDG, \(x^{'}>r\) and \(\omega ^{'}>\theta \) in \(\mathfrak {U}(\Omega ).\) The amplitude and phase term of MV in \(\mathfrak {N}_{k}(\mathfrak {U}(\Omega ))\) are
$$\begin{aligned} \xi _{\mathbb {\breve{C}}^{'}}(g,f)= & {} \left( \frac{(x^{'}-r)}{x^{'}}\right) (\xi _{\mathbb {\widehat{P}}}(g)\wedge \xi _{\mathbb {\widehat{P}}}(f))\\&\times {\hbar }_{\xi }(\aleph (g)\cap \aleph (f)),\\ \varphi _{\mathbb {\breve{C}}^{'}}(g,f)= & {} 2\pi \left[ \frac{(\omega ^{'}-\theta )}{\omega ^{'}}\left( \frac{\varphi _{\mathbb {\widehat{P}}}(g)}{2\pi }\wedge \frac{\varphi _{\mathbb {\widehat{P}}}(f)}{2\pi }\right) \right. \\&\left. \times \frac{{\hbar }_{\varphi }\left( \aleph (g)\cap \aleph (f)\right) }{2\pi }\right] . \end{aligned}$$
As \(\overrightarrow{\Omega }\) is symmetric then it is clear that \({\hbar }\left( \aleph ^{p}(g)\cap \aleph ^{p}(f)\right) \) in \(\overrightarrow{\Omega }\) is equal to \({\hbar }\left( \aleph (g)\cap \aleph (f)\right) \) in \(\mathfrak {U}(\overrightarrow{\Omega }),\) i.e.,
$$\begin{aligned} {\hbar }_{\xi }\left( \aleph ^{p}(g)\cap \aleph ^{p}(f)\right)= & {} {\hbar }_{\xi }\left( \aleph (g)\cap \aleph (f)\right) ,\\ {\hbar }_{\varphi }(\aleph ^{p}(g)\cap \aleph ^{p}(f))= & {} {\hbar }_{\varphi }(\aleph (g)\cap \aleph (f)). \end{aligned}$$
Similarly, \(|\aleph ^{p}(g)\cap \aleph ^{p}(f)|\) in \(\overrightarrow{\Omega }\) is equal to \(|\left( \aleph (g)\cap \aleph (f)\right) |\) in \(\mathfrak {U}\left( \overrightarrow{\Omega }\right) ,\) i.e.,
$$\begin{aligned} |(\aleph ^{p}(g)\cap \aleph ^{p}(f))|_{\xi }= & {} r^{'}=x^{'}=|\left( \aleph (g)\cap \aleph (f)\right) |_{\xi } ,\\ |\left( \aleph ^{p}(g)\cap \aleph ^{p}(f)\right) |_{\varphi }= & {} \theta ^{'}=\omega ^{'}=|(\aleph (g)\cap \aleph (f))|_{\varphi }. \end{aligned}$$
Hence, \(\xi _{\mathbb {\breve{C}}}(g,f)=\xi _{\mathbb {\breve{C}}^{'}}(g,f)\) and \(\varphi _{\mathbb {\breve{C}}}(g,f)=\varphi _{\mathbb {\breve{C}}^{'}}(g,f)\) for all \(g,f\in W.\) \(\square \)
Theorem 5
If a symmetric CFG \(\overrightarrow{\Omega }\) has a loop at every node, then \(\mathfrak {C}_{k}\left( \overrightarrow{\Omega }\right) =\mathfrak {N}_{k}[\mathfrak {U}(\Omega )],\) where \(\mathfrak {U}(\Omega )\) is the loopless underlying CFG of \(\overrightarrow{\Omega }.\)
Proof
Similar to Theorem 4. \(\square \)

Complex fuzzy set applied to m-step competition graphs

Now, we define m-step CFCG by combining CFS with m-step CGs. Before defining m-step CFCG , we first discuss m-step complex fuzzy digraph (m-step CFDG), complex fuzzy m-step out-neighborhood of a node and then complex fuzzy m-step in-neighborhood of a node below.
Definition 23
Let \(\overrightarrow{\Omega }=\left( W,\mathbb {\widehat{P}},\overrightarrow{\mathbb {\widehat{Q}}}\right) \) be CFDG. Then m-step CFDG of \(\overrightarrow{\Omega }\) is symbolized by \(\overrightarrow{\Omega }_{m}=\left( \overrightarrow{\Omega },A,\overrightarrow{B}\right) \) with same CF node set as \(\overrightarrow{\Omega }\) and has a CF edge connecting two vertices g and f in \(\overrightarrow{\Omega }_{m}\) if it has a CF directed path (CFDP) of length m from g to f, i.e., \(\overrightarrow{P}^{m}_{(g,f)}\) in \(\overrightarrow{\Omega }.\)
Definition 24
For a node g of a CFG \(\overrightarrow{\Omega }=\left( W,\mathbb {\widehat{P}},\overrightarrow{\mathbb {\widehat{Q}}}\right) \), the CF m-step out-neighborhood is CFS
$$\begin{aligned} \aleph _{m}^{p}(g)=\left( S^{p}_{g},\rho ^{p}_{g}e^{i\eta ^{p}_{g}}\right) , \end{aligned}$$
where
$$\begin{aligned} S^{p}_{g}=\{f| \mathrm{~if ~CFDP ~of~ length ~m~ from~ node~g~ to~node~ f ~exists,}\overrightarrow{P}^{m}_{(g,f)}\} \end{aligned}$$
such that \(\rho ^{p}_{g}:S^{p}_{g}\rightarrow [0,1]\) given by \(\rho ^{p}_{g}(f)=\{\min \xi _{\mathbb {\widehat{Q}}}(d,s)\), (ds) is an edge of \(\overrightarrow{P}^{m}_{(g,f)}\}\) and \(\eta ^{p}_{g}:S^{p}_{g}\rightarrow [0,2\pi ]\) given by \(\rho ^{p}_{g}(f)=\{\min \varphi _{\mathbb {\widehat{Q}}}(d,s)\), (ds) is an edge of \(\overrightarrow{P}^{m}_{(g,f)}\}\)
Definition 25
For a node g of a CFG \(\overrightarrow{\Omega }=\left( W,\mathbb {\widehat{P}},\overrightarrow{\mathbb {\widehat{Q}}}\right) \), the CF m-step in-neighborhood is CFS
$$\begin{aligned} \aleph _{m}^{n}(g)=\left( S^{n}_{g},\rho ^{n}_{g}e^{i\eta ^{n}_{g}}\right) , \end{aligned}$$
where
$$\begin{aligned} S^{p}_{g}=\{f| \mathrm{~if ~CFDP ~of~ length ~m~ from~ node ~f~ to~ node~ g ~exists~,}\overrightarrow{P}^{m}_{(f,g)}\} \end{aligned}$$
such that \(\rho ^{n}_{g}:S^{p}_{g}\rightarrow [0,1]\) given by \(\rho ^{n}_{g}(f)=\{\min \xi _{\mathbb {\widehat{Q}}}(d,s)\), (ds) is an edge of \(\overrightarrow{P}^{m}_{(f,g)}\}\) and \(\eta ^{n}_{g}:S^{p}_{g}\rightarrow [0,2\pi ]\) given by \(\rho ^{p}_{g}(f)=\{\min \varphi _{\mathbb {\widehat{Q}}}(d,s)\), (ds) is an edge of \(\overrightarrow{P}^{m}_{(f,g)}\}\).
Example 6
Let \(\overrightarrow{\Omega }=\left( W,\mathbb {\widehat{P}},\overrightarrow{\mathbb {\widehat{Q}}}\right) \) be a CFDG as presented in Fig. 7, given by
\(\mathbb {\widehat{P}}=\left\langle \dfrac{a}{0.8e^{i0.7\pi }},\dfrac{b}{1e^{i1.3\pi }},\dfrac{c}{0.7e^{1.2\pi }},\dfrac{x}{0.6e^{i1.3\pi }},\dfrac{y}{0.5e^{i1.8\pi }} ,\right. \left. \dfrac{z}{0.9e^{i1.7\pi }}\right\rangle ,\)
\(\overrightarrow{\mathbb {\widehat{Q}}}=\left\langle \dfrac{\overrightarrow{(a,c)}}{0.6e^{i0.5\pi }},\dfrac{\overrightarrow{(b,z)}}{0.8e^{i1.2\pi }},\dfrac{\overrightarrow{(c,x)}}{0.6e^{i1.1\pi }}, \dfrac{\overrightarrow{(c,y)}}{0.4e^{i0.3\pi }},\dfrac{\overrightarrow{(z,x)}}{0.6e^{i1\pi }},\right. \left. \dfrac{\overrightarrow{(z,y)}}{0.3e^{i0.9\pi }}\right\rangle .\)
In Fig. 7a, two-step out-neighborhood of the node a is the CFS \(\aleph ^{p}_{2}(a)=\{(x,0.6e^{i0.5\pi }),(y,0.4e^{i0.3\pi })\}\) in \(\overrightarrow{\Omega }.\) Similarly, two-step in-neighborhood of the node x is the CFS \(\{(a,0.6e^{i0.5\pi }),(b,0.6e^{i 1\pi })\}\).
Definition 26
Let \(\overrightarrow{\Omega }=\left( W,\mathbb {\widehat{P}},\overrightarrow{\mathbb {\widehat{Q}}}\right) \) be a CFDG. The m-step CFCG of \(\Omega \) is symbolized by \(\mathfrak {C}_{m}\left( \overrightarrow{\Omega }\right) =\left( W,\mathbb {\widehat{P}},\mathbb {\breve{C}}\right) \) with same CF node set as in \(\overrightarrow{\Omega }\) and possesses a CF edge joining two nodes g and f in \(\mathfrak {C}_{m}\left( \overrightarrow{\Omega }\right) \) if and only if \(\aleph ^{p}_{m}(g)\cap \aleph ^{p}_{m}(f)\ne \varnothing \) and the MV of the edge (gf) is given as
$$\begin{aligned} \xi _{\mathbb {\breve{C}}}(g,f)= & {} \left( \xi _{\mathbb {\widehat{P}}}(g)\wedge \xi _{\mathbb {\widehat{P}}}(f)\right) \times {\hbar }_{\xi }\left( \aleph ^{p}_{m}(g)\cap \aleph ^{p}_{m}(f)\right) , \\ \varphi _{\mathbb {\breve{C}}}(g,f)= & {} 2\pi \left[ \left( \frac{\varphi _{\mathbb {\widehat{P}}}(g)}{2\pi }\wedge \frac{\varphi _{\mathbb {\widehat{P}}}(f)}{2\pi }\right) \times \frac{{ {\hbar }_{\varphi }\left( \aleph ^{p}_{m}(g)\cap \aleph ^{p}_{m}(f)\right) }}{2\pi }\right] , \end{aligned}$$
for all \(g,f\in W.\)
Example 7
Let \(\overrightarrow{\Omega }=\left( W,\mathbb {\widehat{P}},\overrightarrow{\mathbb {\widehat{Q}}}\right) \) be a CFDG as presented in Fig. 7a, given by
\(\mathbb {\widehat{P}}=\left\langle \dfrac{a}{0.8e^{i0.7\pi }},\dfrac{b}{1e^{i1.3\pi }},\dfrac{c}{0.7e^{1.2\pi }},\dfrac{x}{0.6e^{i1.3\pi }},\dfrac{y}{0.5e^{i1.8\pi }} ,\right. \left. \dfrac{z}{0.9e^{i1.7\pi }}\right\rangle ,\)
\(\overrightarrow{\mathbb {\widehat{Q}}}=\left\langle \dfrac{\overrightarrow{(a,c)}}{0.6e^{i0.5\pi }},\dfrac{\overrightarrow{(b,z)}}{0.8e^{i1.2\pi }},\dfrac{\overrightarrow{(c,x)}}{0.6e^{i1.1\pi }}, \dfrac{\overrightarrow{(c,y)}}{0.4e^{i0.3\pi }},\dfrac{\overrightarrow{(z,x)}}{0.6e^{i1\pi }},\right. \left. \dfrac{\overrightarrow{(z,y)}}{0.3e^{i0.9\pi }}\right\rangle .\)
The two-step out-neighborhood of the nodes are displayed in Table 9.
Table 9
Two-step out-neighborhood of the nodes
g
\(\aleph ^{p}_{2}(g)\)
a
\(\{\left( x,0.6e^{i0.5\pi }\right) ,\left( y,0.4e^{i0.3\pi }\right) \}\)
b
\(\{\left( x,0.6e^{i1.0\pi }\right) ,\left( y,0.3e^{i0.3\pi }\right) \}\)
c
\(\varnothing \)
x
\(\varnothing \)
y
\(\varnothing \)
z
\(\varnothing \)
Therefore,
$$\begin{aligned} \aleph ^{p}_{2}(a)\cap \aleph ^{p}_{2}(b)=\{(x,0.6e^{i0.5\pi }),(y,0.3e^{i0.3\pi })\}. \end{aligned}$$
The two-step CFCG of \(\overrightarrow{\Omega }\) is shown in Fig. 7b.
Now, we define the strength of CFCG below.
Definition 27
Let \(\overrightarrow{\Omega }=\left( W,\mathbb {\widehat{P}},\overrightarrow{\mathbb {\widehat{Q}}}\right) \) be a CFDG. Let the common node of m-step out-neighborhoods of nodes \(s_{1},s_{2},\cdots s_{n}\) be x. Also, let \(\xi _{\mathbb {\widehat{Q}}}\overrightarrow{(d_{1},l_{1})}e^{i\varphi _{\mathbb {\widehat{Q}}}\overrightarrow{(d_{1},l_{1})}},\xi _{\mathbb {\widehat{Q}}}\overrightarrow{(d_{2},l_{2})}e^{i\varphi _{\mathbb {\widehat{Q}}}\overrightarrow{(d_{2},l_{2})}},\cdots \xi _{\mathbb {\widehat{Q}}}\overrightarrow{(d_{n},l_{n})}e^{i\varphi _{\mathbb {\widehat{Q}}}\overrightarrow{(d_{n},l_{n})}}\) denote the minimum membership degrees of the edges of paths \( \overrightarrow{P}^{m}_{(s_{1},x)}, \overrightarrow{P}^{m}_{(s_{2},x)},\cdots \overrightarrow{P}^{m}_{(s_{n},x)},\) respectively. The m-step node \(x\in W \) is called strong if \(\xi _{\mathbb {\widehat{Q}}}\overrightarrow{(d_{j},l_{j})}>\dfrac{1}{2}\) and \(\varphi _{\mathbb {\widehat{Q}}}\overrightarrow{(d_{j},l_{j})}>1\pi ,\) for all \( j=1,2,3,\cdots ,n\).
For the prey x, the strength is measured by the mapping \(s:W \rightarrow \{z|z\in \mathbf {C}:|z|\le 1\}\) such that
$$\begin{aligned} s(x)= & {} \dfrac{\sum ^{n}_{j=1}\xi _{\mathbb {\widehat{Q}}}\overrightarrow{(d_{j},l_{j})}}{n}e^{i\frac{\sum ^n_{j=1}\varphi _{\mathbb {\widehat{Q}}} \overrightarrow{(d_{j},l_{j})}}{n}}. \end{aligned}$$
Example 8
Let \(\overrightarrow{\Omega }=\left( W,\mathbb {\widehat{P}},\overrightarrow{\mathbb {\widehat{Q}}}\right) \) be a CFDG as shown in Fig. 8, given by
\(\mathbb {\widehat{P}}=\left\langle \dfrac{s}{0.8e^{i1.4\pi }},\dfrac{t}{1e^{i1.3\pi }},\dfrac{e}{0.7e^{1.2\pi }},\dfrac{f}{0.6e^{i1.3\pi }},\dfrac{g}{0.5e^{i1.8\pi }} ,\right. \left. \dfrac{h}{0.9e^{i1.7\pi }}\right\rangle ,\)
\(\overrightarrow{\mathbb {\widehat{Q}}}=\left\langle \dfrac{\overrightarrow{(s,e)}}{0.6e^{i1.1\pi }},\dfrac{\overrightarrow{(t,h)}}{0.8e^{i1.2\pi }},\dfrac{\overrightarrow{(e,f)}}{0.6e^{i1.1\pi }}, \dfrac{\overrightarrow{(e,g)}}{0.4e^{i1.2\pi }},\right. \left. \dfrac{\overrightarrow{(h,f)}}{0.6e^{i1.1\pi }}, \dfrac{\overrightarrow{(h,g)}}{0.3e^{i1.4\pi }}\right\rangle .\)
In Fig. 8, the strength of the prey f is
$$\begin{aligned} s(f)=\dfrac{0.6+0.6}{2}e^{i\frac{1.1\pi +1.1\pi }{2}}. \end{aligned}$$
Hence, the prey f is two-step strong node as \(0.6>\frac{1}{2}\) and \(1.1\pi >1\pi .\)
Theorem 6
If a node x of \(\overrightarrow{\Omega }\) is strong, then in strength of x
1.
\(\frac{\sum ^n_{j=1}\xi _{\mathbb {\widehat{Q}}}(d_{j},l_{j})}{n}>\frac{1}{2},\)
 
2.
\(\frac{\sum ^n_{j=1}\varphi _{\mathbb {\widehat{Q}}}(d_{j},l_{j})}{n}>1\pi .\)
 
Proof
Let \(\overrightarrow{\Omega }=\left( W,\mathbb {\widehat{P}},\overrightarrow{\mathbb {\widehat{Q}}}\right) \) be a CFDG. Let x be the common node of m-step out-neighborhood of nodes \(s_{1},s_{2},\cdots ,s_{n},\) i.e., there exist CFDPs \( \overrightarrow{P}^{m}_{(s_{1},x)},\overrightarrow{P}^{m}_{(s_{2},x)},\cdots \overrightarrow{P}^{m}_{(s_{n},x)},\) in \(\overrightarrow{\Omega }\). Also, let
\(\xi _{\mathbb {\widehat{Q}}}\overrightarrow{(d_{1},l_{1})}e^{i\varphi _{\mathbb {\widehat{Q}}}\overrightarrow{(d_{1},l_{1})}}, \xi _{\mathbb {\widehat{Q}}}\overrightarrow{(d_{2},l_{2})}e^{i\varphi _{\mathbb {\widehat{Q}}}\overrightarrow{(d_{2},l_{2})}}, \cdots \xi _{\mathbb {\widehat{Q}}}\overrightarrow{(d_{j},l_{j})}e^{i\varphi _{\mathbb {\widehat{Q}}}\overrightarrow{(d_{j},l_{j})}}\) be the minimum MVs of the edges of paths \( \overrightarrow{P}^{m}_{(a_{1},x)},\overrightarrow{P}^{m}_{(a_{2},x)},\cdots \overrightarrow{P}^{m}_{(a_{n},x)},\) respectively. If x is strong, each arc \(\overrightarrow{(d_{j},l_{j})},\) \(j=1,2,\cdots ,n\) is strong. So, \(\xi _{\mathbb {\widehat{Q}}}\overrightarrow{(d_{j},l_{j})}>\frac{1}{2}\) and \(\varphi _{\mathbb {\widehat{Q}}}\overrightarrow{(d_{j},l_{j})}>1\pi \). Now,
$$\begin{aligned} s(x)=\frac{\sum ^n_{j=1}\xi _{\mathbb {\widehat{Q}}}(d_{j},l_{j})}{n}e^{i\frac{\sum ^n_{j=1}\varphi _{\mathbb {\widehat{Q}}}(d_{j},l_{j})}{n}}, \end{aligned}$$
where
$$\begin{aligned} \frac{\sum ^n_{j=1}\xi _{\mathbb {\widehat{Q}}}(d_{j},l_{j})}{n}> & {} \frac{\frac{1}{2}+\frac{1}{2}+\cdots (n-times)+\frac{1}{2}}{n}>\frac{1}{2},\\ \frac{\sum ^n_{j=1}\varphi _{\mathbb {\widehat{Q}}}(d_{j},l_{j})}{n}> & {} \frac{1\pi +1\pi +\cdots (n-times)+1\pi }{n}>1\pi . \end{aligned}$$
This completes the result. \(\square \)
Theorem 7
If in \(\overrightarrow{\Omega }\) all the nodes are strong, then in \(\mathfrak {C}_{m}(\overrightarrow{\Omega })\) all the edges are strong.
Proof
Let \(\overrightarrow{\Omega }=\left( W,\mathbb {\widehat{P}},\overrightarrow{\mathbb {\widehat{Q}}}\right) \) be a CFDG. Suppose that all the nodes of \(\overrightarrow{\Omega }\) are strong. Let \(\mathfrak {C}_{m}(\overrightarrow{\Omega })=\left( W,\mathbb {\widehat{P}},\mathbb {\breve{C}}\right) \) be m-step CFCG.
Case 1
Let \(\aleph ^{p}_{m}(g)\cap \aleph ^{p}_{m}(f)=\varnothing \). Then there exists no edge connecting g and f in \(\mathfrak {C}_{m}(\overrightarrow{\Omega }).\) Thus, there is nothing to proof.
Case 2
Let \(\aleph ^{p}_{m}(g)\cap \aleph ^{p}_{m}(f)\) be a non-empty set. As all the nodes are strong, then clearly \({\hbar }_{\xi }(\aleph ^{p}_{m}(g)\cap \aleph ^{p}_{m}(f))>\frac{1}{2}\) and \({\hbar }_{\varphi }(\aleph ^{p}_{m}(g)\cap \aleph ^{p}_{m}(f))>1\pi \) in \(\overrightarrow{\Omega }.\) Then the amplitude and phase term for the edge (gf) is
$$\begin{aligned} \xi _{\mathbb {\breve{C}}}(g,f)= & {} \left( \xi _{\mathbb {\widehat{P}}}(g)\wedge \xi _{\mathbb {\widehat{P}}}(f)\right) \times {\hbar }_{\xi }\left( \aleph ^{p}_{m}(g)\cap \aleph ^{p}_{m}(f)\right) ,\\ \xi _{\mathbb {\breve{C}}}(g,f)> & {} \left( \xi _{\mathbb {\widehat{P}}}(g)\wedge \xi _{\mathbb {\widehat{P}}}(f)\right) \times \frac{1}{2},\\ \varphi _{\mathbb {\breve{C}}}(g,f)= & {} 2\pi \left[ \left( \frac{\xi _{\mathbb {\widehat{P}}}(g)}{2\pi }\wedge \frac{\xi _{\mathbb {\widehat{P}}}(f)}{2\pi }\right) \times \frac{{\hbar }_{\varphi }\left( \aleph ^{p}_{m}(g)\cap \aleph ^{p}_{m}(f)\right) }{2\pi }\right] ,\\ \varphi _{\mathbb {\breve{C}}}(g,f)> & {} \left[ 2\pi \left( \frac{\varphi _{\mathbb {\widehat{P}}}(g)}{2\pi }\wedge \frac{\varphi _{\mathbb {\widehat{P}}}(f)}{2\pi }\right) \times \frac{1\pi }{2\pi }\right] . \end{aligned}$$
Then clearly \(\xi _{\mathbb {\breve{C}}}(g,f)>\frac{1}{2}\left( \xi _{\mathbb {\widehat{P}}}(g)\wedge \xi _{\mathbb {\widehat{P}}}(f)\right) \) and \(\varphi _{\mathbb {\breve{C}}}(g,f)>\frac{1}{2}\left( 2\pi \left( \frac{\varphi _{\mathbb {\widehat{P}}}(g)}{2\pi }\wedge \frac{\varphi _{\mathbb {\widehat{P}}}(f)}{2\pi }\right) \right) .\) Hence, the edge (gf) is strong. Since (gf) is an arbitrary edge of \(\mathfrak {C}_{m}(\overrightarrow{\Omega }),\) then in \(\mathfrak {C}_{m}(\overrightarrow{\Omega })\) all the edges are strong. \(\square \)
Now, we establish a relation between m-step CFCG of a CFDG and CFCG of m-step CFDG.
Theorem 8
Let \(\overrightarrow{\Omega }=\left( W,\mathbb {\widehat{P}},\overrightarrow{\mathbb {\widehat{Q}}}\right) \) be a CFDG. If \(m>|W|\) then \(\mathfrak {C}_{m}\left( \overrightarrow{\Omega }\right) \) has no edges.
Proof
Let \(\overrightarrow{\Omega }=\left( W,\mathbb {\widehat{P}},\overrightarrow{\mathbb {\widehat{Q}}}\right) \) be CFDG and \(\mathfrak {C}_{m}\left( \overrightarrow{\Omega }\right) =\left( W,\mathbb {\widehat{P}},\mathbb {\breve{C}}\right) \) be the corresponding m-step CFCG, where
$$\begin{aligned} \xi _{\mathbb {\breve{C}}}(g,f)= & {} \left( \xi _{\mathbb {\widehat{P}}}(g)\wedge \xi _{\mathbb {\widehat{P}}}(f)\right) \times {\hbar }_{\xi }\left( \aleph ^{p}_{m}(g)\cap \aleph ^{p}_{m}(f)\right) ,\\ \varphi _{\mathbb {\breve{C}}}(g,f)= & {} 2\pi \left[ \left( \frac{\xi _{\mathbb {\widehat{P}}}}{2\pi }(g)\wedge \frac{\xi _{\mathbb {\widehat{P}}}(f)}{2\pi }\right) \times \frac{ {\hbar }_{\varphi }\left( \aleph ^{p}_{m}(g)\cap \aleph ^{p}_{m}(f)\right) }{2\pi }\right] . \end{aligned}$$
If \(m>|W|\) there does not exists any CFDP of length m in \(\overrightarrow{\Omega }.\) So, the CFS \((\aleph ^{p}_{m}(g)\cap \aleph ^{p}_{m}(f))=\varnothing \), i.e., \( {\hbar }_{\xi }(\aleph ^{p}_{m}(g)\cap \aleph ^{p}_{m}(f))=0\) and \({\hbar }_{\varphi }(\aleph ^{p}_{m}(g)\cap \aleph ^{p}_{m}(f))=0\). Hence, there does not exist any edge in \(\mathfrak {C}_{m}(\overrightarrow{\Omega }).\) This proves the result.
\(\square \)
Definition 28
Complex fuzzy m-step neighborhood of a node g of a CFG \(\Omega =(W,\mathbb {\widehat{P}},\mathbb {\widehat{Q}})\) is the CFS
$$\begin{aligned} \aleph _{m}(g)=(S_{g},\rho _{g}e^{i\eta _{g}}), \end{aligned}$$
where
$$\begin{aligned} S_{g}&=\{f| ~~\mathrm{if ~a ~complex~ fuzzy~ path~ (CFP)~ of~ length~ m}\\&~{\mathrm{from~ g ~to~ f ~exists},~ P}^{m}_{(g,f)}\} \end{aligned}$$
such that \(\rho _{g}:S_{g}\in [0,1]\) given by \(\rho _{g}(f)=\{\min \xi _{\mathbb {\widehat{Q}}}(a,b)~|~(a,b)\) is an edge of \(P^{m}_{(g,f)}\}\) and \(\eta _{g}:S_{g}\in [0,2\pi ]\) given by \(\eta _{g}(f)=\{\min \varphi _{\mathbb {\widehat{Q}}}(a,b)~|~(a,b)\) is an edge of \(P^{m}_{(g,f)}\}\).
Definition 29
Let \(\overrightarrow{\Omega }=\left( W,\mathbb {\widehat{P}},\overrightarrow{\mathbb {\widehat{Q}}}\right) \) be CFG. The m-step CFNG \(\overrightarrow{\Omega }\) is symbolized by \(\mathfrak {N}_{m}(\Omega )=(W,\mathbb {\widehat{P}},\mathbb {\breve{C}})\) with same CF node set as \(\overrightarrow{\Omega }\) and possesses a CF edge joining two nodes g and f in \(\mathfrak {N}_{m}(\Omega )\) if and only if CFS \(\aleph _{m}(g)\cap \aleph _{m}(f)\ne \varnothing \) and the MV of the edge (gf) is calculated as
$$\begin{aligned} \xi _{\mathbb {\breve{C}}}(g,f)= & {} \left( \xi _{\mathbb {\widehat{P}}}(g)\wedge \xi _{\mathbb {\widehat{P}}}(f)\right) \times {\hbar }_{\xi }\left( \aleph _{m}(g)\cap \aleph _{m}(f)\right) ,\\ \varphi _{\mathbb {\breve{C}}}(g,f)= & {} 2\pi \left[ \left( \frac{\varphi _{\mathbb {\widehat{P}}}(g)}{2\pi }\wedge \frac{\varphi _{\mathbb {\widehat{P}}}(f)}{2\pi }\right) \times \frac{{\hbar }_{\varphi }\left( \aleph _{m}(g)\cap \aleph _{m}(f)\right) }{2\pi }\right] , \end{aligned}$$
for all \(g,f\in W.\)
Example 9
Let \(\overrightarrow{\Omega }=\left( W,\mathbb {\widehat{P}},\overrightarrow{\mathbb {\widehat{Q}}}\right) \) be a CFG as presented in Fig. 9a, given by
\(\mathbb {\widehat{P}}=\left\langle \dfrac{a}{0.9e^{i0.8\pi }},\dfrac{b}{0.8e^{i1.3\pi }},\dfrac{c}{0.9e^{i1.7\pi }},\dfrac{d}{1e^{i0.7\pi }}, \dfrac{e}{0.6e^{i1.7\pi }},\right. \left. \dfrac{f}{0.7e^{i0.9\pi }}\right\rangle ,\)
\(\overrightarrow{\mathbb {\widehat{Q}}}=\left\langle \dfrac{(a,b)}{0.7e^{i0.7\pi }},\dfrac{(b,c)}{0.8e^{i1.2\pi }},\dfrac{(a,f)}{0.7e^{i0.7\pi }},\dfrac{(e,d)}{0.6e^{i0.6\pi }},\right. \left. \dfrac{(d,f)}{0.7e^{i0.6\pi }},\dfrac{(d,c)}{0.8e^{i0.5\pi }}\right\rangle .\)
The CF two-step neighborhood of the nodes are displayed in Table 10.
Table 10
CF two-step neighborhood of the nodes
g
\(\aleph _{2}(g)\)
a
\(\{(c,0.7e^{i0.7\pi }),(d,0.7e^{i0.6\pi })\}\)
b
\(\{(f,0.7e^{i0.7\pi }),(d,0.8e^{i0.5\pi })\}\)
c
\(\{(f,0.7e^{i0.5\pi }),(e,0.6e^{i0.5\pi }),(a,0.7e^{i0.7\pi })\}\)
d
\(\{(a,0.7e^{i0.6\pi }),(b,0.8e^{i0.5\pi })\}\)
e
\(\{(c,0.6e^{i0.5\pi }),(f,0.6e^{i0.6\pi })\}\)
f
\(\{(e,0.6e^{i0.6\pi }),(c,0.7e^{i0.5\pi }),(b,0.7e^{i0.7\pi })\}\)
The CFSs \(\aleph (g)\cap \aleph (f)\) and \({\hbar }(\aleph (g)\cap \aleph (f))\) are given in Table 11.
Table 11
CFSs \(\aleph (g)\cap \aleph (f)\) and \({\hbar }(\aleph (g)\cap \aleph (f))\)
g
f
\(\aleph (g)\cap \aleph (f)\)
\({\hbar }(\aleph (g)\cap \aleph (f))\)
a
b
\(\{(d,0.7e^{i0.5\pi })\}\)
\(\{(0.7e^{i0.5\pi })\}\)
a
c
\(\varnothing \)
\(\varnothing \)
a
d
\(\varnothing \)
\(\varnothing \)
a
e
\(\{(c,0.6e^{i0.5\pi })\}\)
\(\{(0.6e^{i0.5\pi })\}\)
a
f
\(\{(c,0.7e^{i0.5\pi })\}\)
\(\{(0.7e^{i0.5\pi })\}\)
b
c
\(\{(f,0.7e^{i0.5\pi })\}\)
\(\{(0.7e^{i0.5\pi })\}\)
b
d
\(\varnothing \)
\(\varnothing \)
b
e
\(\{(f,0.6e^{i0.6\pi })\}\)
\(\{(0.6e^{i0.6\pi })\}\)
b
f
\(\varnothing \)
\(\varnothing \)
c
d
\(\{(a,0.7e^{i0.6\pi })\}\)
\(\{(0.7e^{i0.6\pi })\}\)
c
e
\(\{(f,0.6e^{i0.5\pi })\}\)
\(\{(0.6e^{i0.5\pi })\}\)
c
f
\(\{(e,0.6e^{i0.5\pi })\}\)
\(\{(0.7e^{i0.5\pi })\}\)
d
e
\(\varnothing \)
\(\varnothing \)
d
f
\(\{(b,0.7e^{i0.5\pi })\}\)
\(\{(0.7e^{i0.5\pi })\}\)
e
f
\(\{(c,0.6e^{i0.5\pi })\}\)
\(\{(0.6e^{i0.5\pi })\}\)
The two-step CFNG of \(\overrightarrow{\Omega }\) is shown in Fig. 9b.

Complex fuzzy economic competition graphs

Now a days, the transfer of money from one place to another place is very easy because of the advancement of internet. During this exchange of money, there are destinations and sources. Let us consider three projects, namely, \(C_{1},C_{2},C_{3}\) as sources of money and let five organizations, namely \(D_{1},D_{2},D_{3},D_{4},D_{5}\) in which some projects are running in (see Fig. 10). Here, the projects and organizations can be taken as vertices and interconnection between them can be illustrated by arcs. The two organizations are connected by an edge if they are under a certain project, and so on. The graph of this type is called economic competition graph. Now, we develop complex fuzzy economic competition graphs and m-step complex fuzzy economic competition graphs.
Definition 30
The complex fuzzy economic competition graph (CFECG) \(\mathbb {E}\left( \overrightarrow{\Omega }\right) \) of a CFDG \(\overrightarrow{\Omega }=(W,\mathbb {\widehat{P}},\overrightarrow{\mathbb {\widehat{Q}}})\) is an undirected CFG denoted by \(\Omega =\left( W,\mathbb {\widehat{P}},\mathbb {\widehat{Q}}\right) \) with same CF node set as in \(\overrightarrow{\Omega }\) and possesses a CF edge joining two nodes \(g,f\in W\) in \(\mathbb {E}\left( \overrightarrow{\Omega }\right) \) if and only if CFS \(\aleph ^{n}(g)\cap \aleph ^{n}(f)\ne \varnothing \) in \(\overrightarrow{\Omega }\) and the MV of the edge (gf) in \( \mathbb {E}(\overrightarrow{\Omega })\) is calculated as
$$\begin{aligned} \xi _{\mathbb {\widehat{Q}}}(g,f)= & {} \left( \xi _{\mathbb {\widehat{P}}}(g)\wedge \xi _{\mathbb {\widehat{P}}}(f)\right) \times {\hbar }_{\xi }\left( \aleph ^{n}(g)\cap \aleph ^{n}(f)\right) , \\ \varphi _{\mathbb {\widehat{Q}}}(g,f)= & {} 2\pi \left[ \left( \frac{\varphi _{\mathbb {\widehat{P}}}(g)}{2\pi }\wedge \frac{\varphi _{\mathbb {\widehat{P}}}(f)}{2\pi }\right) \times \frac{{\hbar }_{\varphi }(\aleph ^{n}(g)\cap \aleph ^{n}(f)}{2\pi }\right] . \end{aligned}$$
Definition 31
Let \(\overrightarrow{\Omega }=\left( W,\mathbb {\widehat{P}},\overrightarrow{\mathbb {\widehat{Q}}}\right) \) be a CFDG. The m-step complex fuzzy economic competition graph (m-step CFECG) of \(\overrightarrow{\Omega }\) is denoted by \(\mathbb {E}_{m}\left( \overrightarrow{\Omega }\right) =\left( W,\mathbb {\widehat{P}},\mathbb {\breve{C}}\right) \) with same CF node set as in \(\overrightarrow{\Omega }\) and possesses a CF edge joining two distinct nodes \(g,f\in W\) in \(\mathbb {E}_{m}(\overrightarrow{\Omega })\) if and only if \(\aleph ^{n}_{m}(g)\cap \aleph ^{n}_{m}(f)\) is non-empty CFS in \(\overrightarrow{\Omega }\) and the MV of the edge (gf) in \( \mathbb {E}_{m}(\overrightarrow{\Omega })\) is calculated as
$$\begin{aligned} \xi _{\mathbb {\breve{C}}}(g,f)= & {} \left( \xi _{\mathbb {\widehat{P}}}(g)\wedge \xi _{\mathbb {\widehat{P}}}(f)\right) \times , {\hbar }_{\xi }\left( \aleph ^{n}_{m}(g)\cap \aleph ^{n}_{m}(f)\right) , \\ \varphi _{\mathbb {\breve{C}}}(g,f)= & {} 2\pi \left[ \left( \frac{\varphi _{\mathbb {\widehat{P}}}(g)}{2\pi }\wedge \frac{\varphi _{\mathbb {\widehat{P}}}(f)}{2\pi }\right) \times \frac{ {\hbar }_{\varphi }(\aleph ^{n}_{m}(g)\cap \aleph ^{n}_{m}(f)) }{2\pi }\right] , \end{aligned}$$
for all \(g,f\in W.\)
Example 10
Let \(\overrightarrow{\Omega }=\left( W,\mathbb {\widehat{P}},\overrightarrow{\mathbb {\widehat{Q}}}\right) \) be a CFDG, where
\(\mathbb {\widehat{P}}=\left\langle \dfrac{a}{0.8e^{i1.7\pi }},\dfrac{b}{0.7e^{i1.2\pi }},\dfrac{c}{0.9e^{i1.1\pi }},\dfrac{d}{0.6e^{i0.9\pi }}, \dfrac{e}{1e^{i0.8\pi }},\right. \left. \dfrac{f}{0.8e^{i1.3\pi }},\dfrac{g}{0.8e^{i1.3\pi }} \right\rangle ,\)
\(\overrightarrow{\mathbb {\widehat{Q}}}=\left\langle \dfrac{\overrightarrow{(a,b)}}{0.7e^{i1.1\pi }},\dfrac{\overrightarrow{(a,d)}}{0.6e^{i0.8\pi }},\dfrac{\overrightarrow{(a,f)}}{0.7e^{i1.2\pi }}, \dfrac{\overrightarrow{(b,c)}}{0.6e^{i1\pi }},\dfrac{\overrightarrow{(d,c)}}{0.5e^{i0.8\pi }},\right. \left. \dfrac{\overrightarrow{(d,e)}}{0.6e^{i0.7\pi }}, \dfrac{\overrightarrow{(f,g)}}{0.6e^{i1.2\pi }},\dfrac{\overrightarrow{(f,e)}}{0.7e^{i0.6\pi }}\right\rangle .\)
The CFDG is presented in Fig. 11a.
The CFIN of the nodes are shown in Table 12.
Table 12
CFIN of the nodes
x
\(\aleph ^{n}(x)\)
\(\aleph ^{n}_{2}(x)\)
g
\(\{(f,0.6e^{i1.2\pi })\}\)
\(\{a,0.6e^{i1.2\pi }\}\)
f
\(\{(a,0.7e^{i1.2\pi })\}\)
\(\varnothing \)
a
\(\varnothing \)
\(\varnothing \)
b
\(\{(a,0.7e^{i1.1\pi })\}\)
\(\varnothing \)
c
\(\{(d,0.5e^{i0.8\pi }),(b,0.6e^{i1.0\pi })\}\)
\(\{(a,0.6e^{i1.0\pi })\} ~or ~\{(a,0.5e^{i0.8\pi })\}\)
e
\(\{(f,0.7e^{i0.6\pi }),(d,0.6e^{i0.7\pi })\}\)
\(\{(a,0.7e^{i0.6\pi })\}~or~\{(a,0.6e^{i0.7\pi })\}\)
d
\(\{(a,0.6e^{i0.8\pi })\}\)
\(\varnothing \)
The heights of CFSs \(\aleph ^{n}(a)\cap \aleph ^{n}(b)\) and \(\aleph ^{n}_{2}(a)\cap \aleph _{2}^{n}(b)\) are given in Table 13.
Table 13
Heights of CFSs \(\aleph ^{n}(a)\cap \aleph ^{n}(b)\) and \(\aleph ^{n}_{2}(a)\cap \aleph _{2}^{n}(b)\)
a
b
\(\aleph ^{n}(a)\cap \aleph ^{n}(b)\)
\(\aleph ^{n}_{2}(a)\cap \aleph _{2}^{n}(b)\)
\({\hbar }(\aleph ^{n}(a)\cap \aleph ^{n}(b))\)
\({\hbar }(\aleph ^{n}_{2}(a)\cap \aleph ^{n}_{2}(b))\)
g
f
\(\varnothing \)
\(\varnothing \)
\(\varnothing \)
\(\varnothing \)
g
a
\(\varnothing \)
\(\varnothing \)
\(\varnothing \)
\(\varnothing \)
g
b
\(\varnothing \)
\(\varnothing \)
\(\varnothing \)
\(\varnothing \)
g
c
\(\varnothing \)
\(\{(a,0.5e^{i0.8\pi })\}\)
\(\varnothing \)
\(\{(0.5e^{i0.8\pi })\}\)
g
e
\(\{(f,0.6e^{i0.6\pi })\}\)
\(\{(a,0.6e^{i0.6\pi })\}\)
\(\{(0.6e^{i0.6\pi })\}\)
\(\{(0.6e^{i0.6\pi })\}\)
g
d
\(\varnothing \)
\(\varnothing \)
\(\varnothing \)
\(\varnothing \)
f
a
\(\varnothing \)
\(\varnothing \)
\(\varnothing \)
\(\varnothing \)
f
b
\(\{(a,0.7e^{i1.1\pi })\}\)
\(\varnothing \)
\(\{(0.7e^{i1.1\pi })\}\)
\(\varnothing \)
f
c
\(\varnothing \)
\(\varnothing \)
\(\varnothing \)
\(\varnothing \)
f
e
\(\varnothing \)
\(\varnothing \)
\(\varnothing \)
\(\varnothing \)
f
d
\(\{(a,0.6e^{i0.8\pi })\}\)
\(\varnothing \)
\(\{(0.6e^{i0.8\pi })\}\)
\(\varnothing \)
a
b
\(\varnothing \)
\(\varnothing \)
\(\varnothing \)
\(\varnothing \)
a
c
\(\varnothing \)
\(\varnothing \)
\(\varnothing \)
\(\varnothing \)
a
e
\(\varnothing \)
\(\varnothing \)
\(\varnothing \)
\(\varnothing \)
a
d
\(\varnothing \)
\(\varnothing \)
\(\varnothing \)
\(\varnothing \)
b
c
\(\varnothing \)
\(\varnothing \)
\(\varnothing \)
\(\varnothing \)
b
e
\(\varnothing \)
\(\varnothing \)
\(\varnothing \)
\(\varnothing \)
b
d
\(\{(a,0.6e^{i0.8\pi })\}\)
\(\varnothing \)
\(\{(0.6e^{i0.8\pi })\}\)
\(\varnothing \)
c
e
\(\{(a,0.5e^{i0.7\pi })\}\)
\(\{(a,0.5e^{i0.7\pi })\}\)
\(\{(0.5e^{i0.7\pi })\}\)
\(\{(0.5e^{i0.7\pi })\}\)
c
d
\(\varnothing \)
\(\varnothing \)
\(\varnothing \)
\(\varnothing \)
e
d
\(\varnothing \)
\(\varnothing \)
\(\varnothing \)
\(\varnothing \)
The corresponding CFECG and two-step CFECGs are shown in Fig. 11b and c.
Theorem 9
CFECG and CFCG of any complete graphs are same.
Proof
Let \(\overrightarrow{\Omega }=\left( W,\mathbb {\widehat{P}},\overrightarrow{\mathbb {\widehat{Q}}}\right) \) be a CFDG. Let \(\mathfrak {C}(\overrightarrow{\Omega })=\left( W,\mathbb {\widehat{P}},\overrightarrow{\mathbb {\widehat{Q}}}\right) \) and \(\mathbb {E}(\overrightarrow{\Omega })=\left( W,\mathbb {\widehat{P}},\overrightarrow{\mathbb {\breve{C}}}\right) \) are the corresponding CFCG and CFECG, respectively.
We have to show that \(\mathfrak {C}(\overrightarrow{\Omega })\) and \(\mathbb {E}(\overrightarrow{\Omega })\) are same. For this, we have to show that CF node set and CF edge set of both the graphs are same. Clearly, the CF node set of \(\mathfrak {C}(\overrightarrow{\Omega })\) is same as the \(\overrightarrow{\Omega }\) and also the CF node set of \(\mathbb {E}(\overrightarrow{\Omega })\) is same as the \(\overrightarrow{\Omega }.\) Thus, the CF node set of \(\mathfrak {C}(\overrightarrow{\Omega })\) is same as \(\mathbb {E}(\overrightarrow{\Omega }).\) Now, we need to show that CF edge set of \(\mathfrak {C}(\overrightarrow{\Omega })\) is equal to the CF edge set of \(\mathbb {E}(\overrightarrow{\Omega }).\) The MV of the edge (gf) in \(\mathfrak {C}(\overrightarrow{\Omega })\) is
$$\begin{aligned} \xi _{\mathbb {\widehat{Q}}}(g,f)= & {} \left( \xi _{\mathbb {\widehat{P}}}(g)\wedge \xi _{\mathbb {\widehat{P}}}(f)\right) \times {\hbar }_{\xi }(\aleph ^{p}(g)\cap \aleph ^{p}(f)),\\ \varphi _{\mathbb {\widehat{Q}}}(g,f)= & {} 2\pi \left[ \left( \frac{\varphi _{\mathbb {\widehat{P}}}(g)}{2\pi }\wedge \frac{\varphi _{\mathbb {\widehat{P}}}(f)}{2\pi }\right) \times \frac{{\hbar }_{\varphi }(\aleph ^{p}(g)\cap \aleph ^{p}(f))}{2\pi }\right] . \end{aligned}$$
Also, the MV of the edge (gf) in \(\mathfrak {E}(\overrightarrow{\Omega })\) is
$$\begin{aligned} \xi _{\mathbb {\breve{C}}}(g,f)= & {} (\xi _{\mathbb {\widehat{P}}}(g)\wedge \xi _{\mathbb {\widehat{P}}}(f))\times {\hbar }_{\xi }(\aleph ^{n}(g)\cap \aleph ^{n}(f)),\\ \varphi _{\mathbb {\breve{C}}}(g,f)= & {} 2\pi \left[ \left( \frac{\varphi _{\mathbb {\widehat{P}}}(g)}{2\pi }\wedge \frac{\varphi _{\mathbb {\widehat{P}}}(f)}{2\pi }\right) \times \frac{{\hbar }_{\varphi }(\aleph ^{p}(g)\cap \aleph ^{p}(f))}{2\pi }\right] . \end{aligned}$$
As \(\overrightarrow{\Omega }\) is a complete fuzzy digraph, then clearly
$$\begin{aligned} {\hbar }(\aleph ^{p}(g)\cap \aleph ^{p}(f))= {\hbar }(\aleph ^{n}(g)\cap \aleph ^{n}(f)), \end{aligned}$$
i.e.,
$$\begin{aligned} {\hbar }_{\xi }\left( \aleph ^{p}(g)\cap \aleph ^{p}(f)\right)= & {} {\hbar }_{\xi }\left( \aleph ^{n}(g)\cap \aleph ^{n}(f)\right) ,\\ {\hbar }_{\varphi }\left( \aleph ^{p}(g)\cap \aleph ^{p}(f)\right)= & {} {\hbar }_{\varphi }\left( \aleph ^{n}(g)\cap \aleph ^{n}(f)\right) . \end{aligned}$$
Then \(\xi _{\mathbb {\widehat{Q}}}(g,f)=\xi _{\mathbb {\breve{C}}}(g,f)\) and \(\varphi _{\mathbb {\widehat{Q}}}(g,f)=\varphi _{\mathbb {\breve{C}}}(g,f).\) Hence, the result is proved. \(\square \)
Theorem 10
If \(\overrightarrow{\Omega }_{1}\) is the CF-sub-digraph of \(\overrightarrow{\Omega }.\) Then
1.
\(\mathfrak {C}_{m}(\overrightarrow{\Omega }_{1})\subset \mathfrak {C}_{m}(\overrightarrow{\Omega }).\)
 
2.
\(\mathbb {E}_{m}(\overrightarrow{\Omega _{1}})\subset \mathbb {E}_{m}(\overrightarrow{\Omega }).\)
 
Proof
Let \(\overrightarrow{\Omega }=\left( W,\mathbb {\widehat{P}},\overrightarrow{\mathbb {\widehat{Q}}}\right) \) and \(\overrightarrow{\Omega _{1}}=\left( W_{1},\mathbb {\widehat{P}}_{1},\overrightarrow{\mathbb {\widehat{Q}}}_{1}\right) ,\) where \(W_{1}\subset W,\) \(\xi _{\mathbb {\widehat{P}}_{1}}(g)\le \xi _{\mathbb {\widehat{P}}}(g)\) and \(\varphi _{\mathbb {\widehat{P}}_{1}}(g)\le \varphi _{\mathbb {\widehat{P}}}(g)\) for all \(g\in W_{1}\) and \(\xi _{\mathbb {\widehat{Q}}_{1}}\overrightarrow{(g,f)}\le \xi _{\mathbb {\widehat{Q}}}\overrightarrow{(g,f)}\) and \(\varphi _{\mathbb {\widehat{Q}}_{1}}\overrightarrow{(g,f)}\le \varphi _{\mathbb {\widehat{Q}}}\overrightarrow{(g,f)},\) for all \(g,f\in W_{1}\).
1.
The complex fuzzy node set of \(\mathfrak {C}_{m}(\overrightarrow{\Omega }_{1})\) is the subset of \(\mathfrak {C}_{m}(\overrightarrow{\Omega })\) as \(W_{1}\subset W.\) Now, for any complex fuzzy edge (gf) in \(\mathfrak {C}_{m}(\overrightarrow{\Omega _{1}})\), \(\aleph _{m}^{p}(g)\cap \aleph ^{p}_{m}(f)\) is the complex fuzzy subset of the same in \(\mathfrak {C}_{m}(\overrightarrow{\Omega }).\) So, \(\xi _{\mathbb {\widehat{Q}}_1}\overrightarrow{(g,f)}\le \xi _{\mathbb {\widehat{Q}}}\overrightarrow{(g,f)}\) and \(\varphi _{\mathbb {\widehat{Q}}_{1}}\overrightarrow{(g,f)}\le \varphi _{\mathbb {\widehat{Q}}}\overrightarrow{(g,f)}\) for all \(g,f\in W_{1}.\) Hence, this proves the result.
 
2.
Similar to the proof 1.
 
\(\square \)

Application

Competition between objects of real world can be represented by competition graphs. However, there are some competitions of real world which cannot be represented through these competition graphs. This motivates to introduce CFCGs. In this section, we discuss an application of CFCGs to study the competition among the species of ecology.
For example, suppose a small ecosystem, sea otters like to feed on starfish and sea urchins, killer whales like to feed on sea otters, starfish want to feed on sea urchins and snails, both snails and sea urchins feed on seaweed. These six species seaweed, snail, sea urchin, starfish, sea otter and killer whale are taken as vertices. Suppose that seaweed exists 90% in the ecosystem and seaweed is 20% strong under a certain interval of time, i.e., the MV of the seaweed is \(0.9e^{i0.4\pi }.\) Similarly, we assume the MVs of the other nodes as \(0.7e^{i0.8\pi },0.8e^{i1\pi },0.9e^{i1.2\pi },0.8e^{i1.6\pi },0.9e^{i1.8 \pi }\), where the amplitude terms show the degree of existence of species while the phase terms show that how much the specie is strong under certain time interval. Suppose killer whale like to feed on sea otter say 60% and the prey sea otter is 70% tasty for the predator killer whale under a certain duration of time. The MV of the edge between killer whale and sea otter is \(0.6e^{i0.7\pi }\) and similarly the likeness and tastiness of preys for predators is shown in Table 14. The corresponding food web is shown in Fig. 12.
Table 14
Likeness and tastiness of predators and preys
Name of predator
Name of prey
Like to eat\((\%)\)
Tasty to eat\((\%)\)
Killer whale
Sea otter
60
70
Sea otter
Sea urchin
60
45
Sea otter
Starfish
70
55
Starfish
Sea urchin
80
40
Starfish
Snail
70
40
Snail
Seaweed
70
20
Sea urchin
Seaweed
70
20
It is detected that if starfish are taken out from the food web then sea urchins and snails grow limitless and sea otters must be disappear. The food web can be seen by help of CFDG.
The CFONs of the nodes are displayed in Table 15.
Table 15
Complex fuzzy out-neighborhoods
\(y \in Z\)
\(\aleph ^{p}(y)\)
Killer whale
\(\phi \)
Sea otter
\(\left\{ \left( \mathrm{killer whale},0.6e^{i1.4\pi }\right) \right\} \)
Sea urchin
{(sea otter, \(0.6e^{i0.9\pi }\)), (starfish,\(0.8e^{i0.8\pi }\))}
Starfish
{ (sea otter,\(0.7e^{i1.1\pi })\)}
Snail
{(starfish,\(0.7e^{i0.4\pi })\)}
Seaweed
{(sea urchin,\(0.7e^{i0.4\pi })\),(snail,\(0.7e^{i0.4\pi }\))}
There exist only two edges in CFCG as
$$\begin{aligned} \aleph ^{p}(starfish)\cap \aleph ^{p}(sea ~urchin)= & {} \{(sea ~otter,0.6e^{i0.9\pi })\},\\ \aleph ^{p}~(sea ~urchin)\cap \aleph ^{p}~(snail)= & {} \{(sea ~otter,0.7e^{i0.4\pi })\}. \end{aligned}$$
The corresponding CFCG is shown in Fig. 13.
Now, sea urchin and starfish are connected by an edge, and similarly sea urchin and snail are connected by an edge in the CFCG. There is no edge in the CFCG for the other pair of vertices. The MVs of the edges between sea urchin and starfish is \(0.48e^{i0.45\pi },\) and sea urchin and snail is \(0.49e^{i0.16\pi }\) calculated by the definition of CFCG. Hence, sea urchin and starfish; sea urchin and snail compete for sea otter and starfish, respectively. Thus, there is competition between sea urchin and starfish; sea urchin and snail in the ecosystem. The method which is used in our ecosystem application is shown in Table 16 .
Table 16
Method to find competition among species
Method
Ecosystem
Step 1
Assign the MVs for the set of n species in the food web. \(\overrightarrow{\Omega }=(\mathbb {\widehat{P}},\overrightarrow{\mathbb {\widehat{Q}}})\)(say).
Step 2
If for any two nodes \(y_{i}\) and \(y_{j},\) \(\xi _{\mathbb {\widehat{Q}}}(y_{i},y_{j})>0,\) then
 
\((y_{j},\xi _{\mathbb {\widehat{Q}}}(y_{i},y_{j})e^{i\varphi _{\mathbb {\widehat{Q}}}(y_{i},y_{j})})\in \aleph ^{p}(y_{i}).\)
Step 3
Find out the CFON \(\aleph ^{p}(y_{i})\) for all vertices \(y_{i},y_{j}\).
Step 4
calculate the \(\aleph ^{p}(y_{i})\cap \aleph ^{p}(y_{j}).\)
Step 5
calculate \(\hbar (\aleph ^{p}(y_{i})\cap \aleph ^{p}(y_{j})).\)
Step 6
If \(\aleph ^{p}(y_{i})\cap \aleph ^{p}(y_{j})\ne \varnothing \) then draw an edge \((y_{i},y_{j}).\)
Step 7
Repeat the Step 6 for all the disjoint nodes of the digraph.
Step 8
Calculate the MVs using
 
\(\xi _{\mathbb {\widehat{Q}}}(y_{i},y_{j})=(\xi _{\mathbb {\widehat{P}}}(y_{i})\wedge \xi _{\mathbb {\widehat{Q}}}y_{j})\times {\hbar }_{\xi }(\aleph ^{p}(y_{i})\cap \aleph ^{p}(y_{j}))\) and
 
\(\varphi _{\mathbb {\widehat{Q}}}(y_{i},y_{j})=2\pi \left[ \left( \frac{\varphi _{\mathbb {\widehat{P}}}(y_{i})}{2\pi }\wedge \frac{\varphi _{\mathbb {\widehat{P}}}( y_{j})}{2\pi }\right) \times \frac{{\hbar }_{\varphi }(\aleph ^{p}(y_{i})\cap \aleph ^{p}(y_{j}))}{2\pi }\right] .\)

Comparative analysis

CGs are very useful to show the competitions among the different objects. Fuzzy competition graphs were proposed by Samanta et al. [20] to show all the competitions of the real world. Fuzzy competition graphs have larger ability to deal with vagueness and uncertainty. There are many applications of fuzzy competition graphs in various fields of life. Ecosystem is one of these applications of fuzzy competition graphs. For example, in ecology, let \(\{(f_{1},0.9),(f_{2},0.8),(f_{3},0.9),(f_{4},0.8),(f_{5},0.7)\}\) be the set of species and let \(\{(\overrightarrow{f_{2}f_{1}},0.7),(\overrightarrow{f_{3}f_{2}},0.8),(\overrightarrow{f_{5}f_{3}},0.7),(\overrightarrow{{f_4}f_{3}},0.8), (\overrightarrow{f_{6}f_{5}},0.7)\}\) be the edge set, where \(f_{1},f_{2},f_{3},f_{4},f_{5},f_{6}\) represent the species killer whale, sea otters, urchins, starfish, snails and seaweed, respectively. The MVs of the species show the existence of these species in ecosystem and the MVs of edges show the degree of likeness of predators for the prey. These MVs of the species only show the existence of these species but it does not give the information that how much the specie is strong. Similarly, the MVs of the edges show only the likeness of preys for the predators but fails to illustrate that how much the prey is tasty to eat for the predator. This information about the preys and predators is two-dimensional which cannot be modeled by one dimensional phenomenon. This lack of knowledge motivates us to introduce the more generalized concept, CFCGs of FCGs, which have a capability to handle the two dimensional data with more perfection. The proposed work provides us a better platform to show the periodicity of the phenomenon. An application is designed in our presented work, in which the phase terms of the nodes and edges show the strength and tastiness of these species under some specific time interval. Therefore, CFCGs are more useful then the FCGs, as these graphs can handle the two-dimensional information. The aptitude of these graphs to represent the two-dimensional phenomena make it worthier to manage the ambiguous and intuitive data.

Further discussion

From the above comparison, it is clear that the proposed competition graphs are more generalized and superior the the existing competition graphs because they are efficient to deal with two-dimensional data of species in a single set. The drawbacks of the existing CGs and the main advantages of proposed CGs are given below.
1.
The existing competition graphs are developed under fuzzy environment in which the uncertainties and ambiguities present in the data are handled with the help of degrees of membership that are the subset of real numbers, which may lose some useful information.
 
2.
The proposed competition graphs are developed under CF environment in which the uncertainties of data are handled by complex numbers. The CFS can handle two dimensional and periodic information more precisely then the other existing models. The phase term of CFS is efficient which discriminates this set from all other existing models of the literature.
 
3.
On removing the phase term of CFS, the CFS reduces to ordinary FS. Thus, CFS is an effective generalization of FS.
 
The characteristics comparison of our proposed approach with different existing approaches is given in Table 17.
Table 17
The characteristic comparison of different graphs with existing graphs
Method
Whether have ability
Whether have ability
Whether have the characteristics
 
to handle periodic problems
to represent 2-D information
of generalization
Samanta et al. [20]
\(\times \)
\(\times \)
\(\times \)
Sahoo and Pal [18]
\(\times \)
\(\times \)
\(\times \)
Sarwar [21]
\(\times \)
\(\times \)
\(\times \)
Habib et al. [9]
\(\times \)
\(\times \)
\(\checkmark \)
The proposed CFCGs
\(\checkmark \)
\(\checkmark \)
\(\checkmark \)

Conclusion

CFS is an indispensable tool to deal with two-dimensional or periodic information due to the existence of additional term named as phase term which discriminate this set from all other existing sets of literature. In this paper, we have introduced a novel concept of CGs and economic competition graphs under CF environment. We have also investigated two worthwhile extensions of complex fuzzy competition graphs, named as complex fuzzy k-competition graphs and p-competition complex fuzzy graph. Moreover, we have developed neighborhood graphs and m-step neighborhood graphs under complex fuzzy environment with some of their remarkable results. In addition, to reveal the importance of these competition graphs in realistic situations, we have designed an application of complex fuzzy competition graphs in ecology. Finally, we have compared our proposed complex fuzzy competition graphs with existing graphs to show the superiority and authenticity of proposed graphs which leads us to the result that competition graphs are useful to represent the competition among those entities which possess the two-dimensional information. Our next interest of research is to extend our work to (1) complex fuzzy mixed graphs, (2) Fermatean fuzzy competition graphs, (3) complex Fermatean fuzzy sets , (4) Fermatean fuzzy planar graphs, and (5) complex Fermatean fuzzy competition graphs.

Compliance with ethical standards

Conflict of interest

The authors declare no conflict of interest.
Open AccessThis article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://​creativecommons.​org/​licenses/​by/​4.​0/​.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Literatur
1.
Zurück zum Zitat Akram M (2019) \(m\)-Polar fuzzy graphs. Stud Fuzziness Soft Comput 2019:371MATH Akram M (2019) \(m\)-Polar fuzzy graphs. Stud Fuzziness Soft Comput 2019:371MATH
3.
Zurück zum Zitat Akram M, Dudek WA, Habib A, Al-Kenani AL (2020) Imperfect competition models in economic market structure with \(q\)-rung picture fuzzy information. J Intell Fuzzy Syst 38(4):5107–5126CrossRef Akram M, Dudek WA, Habib A, Al-Kenani AL (2020) Imperfect competition models in economic market structure with \(q\)-rung picture fuzzy information. J Intell Fuzzy Syst 38(4):5107–5126CrossRef
4.
5.
Zurück zum Zitat Cho HH, Kim SR, Yunsun N (2000) The \(m\)-step competition graph of a digraph. Discrete Appl Math 105(1–3):115–127MathSciNetCrossRef Cho HH, Kim SR, Yunsun N (2000) The \(m\)-step competition graph of a digraph. Discrete Appl Math 105(1–3):115–127MathSciNetCrossRef
6.
Zurück zum Zitat Cohen JE (1968) Interval graphs and food webs: a finding and a problem. RAND Corporation Document 17696-PR, Santa Monica, CA Cohen JE (1968) Interval graphs and food webs: a finding and a problem. RAND Corporation Document 17696-PR, Santa Monica, CA
7.
Zurück zum Zitat Das SK, Panda DC, Sethi N, Gantayat SS (2011) Inductive learning of complex fuzzy relation. Int J Comput Sci Eng Inf Technol 1:29–38 Das SK, Panda DC, Sethi N, Gantayat SS (2011) Inductive learning of complex fuzzy relation. Int J Comput Sci Eng Inf Technol 1:29–38
8.
Zurück zum Zitat Dey A, Pal A, Long HV (2020) Fuzzy minimum spanning tree with interval type 2 fuzzy arc length: formulation and a new genetic algorithm. Soft Comput 24(6):3963–3974CrossRef Dey A, Pal A, Long HV (2020) Fuzzy minimum spanning tree with interval type 2 fuzzy arc length: formulation and a new genetic algorithm. Soft Comput 24(6):3963–3974CrossRef
9.
Zurück zum Zitat Habib A, Akram M, Farooq A (2019) q-Rung orthopair fuzzy competition graphs with application in the soil ecosystem. Mathematics 7(1):91MathSciNetCrossRef Habib A, Akram M, Farooq A (2019) q-Rung orthopair fuzzy competition graphs with application in the soil ecosystem. Mathematics 7(1):91MathSciNetCrossRef
10.
Zurück zum Zitat Garg H, Rani D (2020) Generalized geometric aggregation operators based on t-norm operations for complex intuitionistic fuzzy sets and their application to decision-making. Cogn Comput 12:679–698CrossRef Garg H, Rani D (2020) Generalized geometric aggregation operators based on t-norm operations for complex intuitionistic fuzzy sets and their application to decision-making. Cogn Comput 12:679–698CrossRef
11.
Zurück zum Zitat Garg H, Rani D (2020) Novel aggregation operators and ranking method for complex intuitionistic fuzzy sets and their applications to decision-making process. Artif Intell Rev 53:3595–3620CrossRef Garg H, Rani D (2020) Novel aggregation operators and ranking method for complex intuitionistic fuzzy sets and their applications to decision-making process. Artif Intell Rev 53:3595–3620CrossRef
12.
Zurück zum Zitat Isaak G, Kim SR, McKees TA, McMorris FR, Roberts FS (1992) 2-competition graphs. SIAM J Discrete Math 5(4):524–538MathSciNetCrossRef Isaak G, Kim SR, McKees TA, McMorris FR, Roberts FS (1992) 2-competition graphs. SIAM J Discrete Math 5(4):524–538MathSciNetCrossRef
13.
14.
Zurück zum Zitat Luqman A, Akram M, Al-Kenani AN, Alcantud JCR (2019) A study on hypergraph representations of complex fuzzy information. Symmetry 11(11):1381CrossRef Luqman A, Akram M, Al-Kenani AN, Alcantud JCR (2019) A study on hypergraph representations of complex fuzzy information. Symmetry 11(11):1381CrossRef
15.
Zurück zum Zitat Mohanta K, Dey A, Pal A, Long HV, Son LH (2020) A study of \(m\)-polar neutrosophic graph with applications. J Intell Fuzzy Syst 38(4):4809–4828CrossRef Mohanta K, Dey A, Pal A, Long HV, Son LH (2020) A study of \(m\)-polar neutrosophic graph with applications. J Intell Fuzzy Syst 38(4):4809–4828CrossRef
16.
Zurück zum Zitat Ramot D, Milo R, Friedman M, Kandel A (2002) Complex fuzzy sets. IEEE Trans Fuzzy Syst 10(2):171–186CrossRef Ramot D, Milo R, Friedman M, Kandel A (2002) Complex fuzzy sets. IEEE Trans Fuzzy Syst 10(2):171–186CrossRef
17.
Zurück zum Zitat Rosenfeld A (1975) Fuzzy graphs. Fuzzy sets and their applications to cognitive and decision processes. Academic Press, Cambridge, pp 77–95CrossRef Rosenfeld A (1975) Fuzzy graphs. Fuzzy sets and their applications to cognitive and decision processes. Academic Press, Cambridge, pp 77–95CrossRef
18.
19.
20.
Zurück zum Zitat Samanta S, Pal M (2013) Fuzzy \(k\)-competition graphs and \(p\)-competition fuzzy graphs. Fuzzy Inf Eng 5(2):191–204MathSciNetCrossRef Samanta S, Pal M (2013) Fuzzy \(k\)-competition graphs and \(p\)-competition fuzzy graphs. Fuzzy Inf Eng 5(2):191–204MathSciNetCrossRef
21.
Zurück zum Zitat Sarwar M, Akram M, Alshehri M (2018) A new method to decision-making with fuzzy competition hypergraphs. Symmetry 10(9):404CrossRef Sarwar M, Akram M, Alshehri M (2018) A new method to decision-making with fuzzy competition hypergraphs. Symmetry 10(9):404CrossRef
22.
24.
Zurück zum Zitat Thirunavukarasu P, Suresh R, Viswanathan KK (2016) Energy of a complex fuzzy graph. Int J Math Sci Eng Appl 10:243–248 Thirunavukarasu P, Suresh R, Viswanathan KK (2016) Energy of a complex fuzzy graph. Int J Math Sci Eng Appl 10:243–248
26.
Zurück zum Zitat Zhang G, Dillon TS, Cai KY, Ma J, Lu J (2009) Operation properties and d-equalities of complex fuzzy sets. Int J Approx Reason 50(8):1227–1249MathSciNetCrossRef Zhang G, Dillon TS, Cai KY, Ma J, Lu J (2009) Operation properties and d-equalities of complex fuzzy sets. Int J Approx Reason 50(8):1227–1249MathSciNetCrossRef
27.
Zurück zum Zitat Zuo C, Pal A, Dey A (2019) New concepts of picture fuzzy graphs with application. Mathematics 7(5):470CrossRef Zuo C, Pal A, Dey A (2019) New concepts of picture fuzzy graphs with application. Mathematics 7(5):470CrossRef
Metadaten
Titel
Extension of competition graphs under complex fuzzy environment
verfasst von
Muhammad Akram
Aqsa Sattar
Faruk Karaaslan
Sovan Samanta
Publikationsdatum
04.11.2020
Verlag
Springer International Publishing
Erschienen in
Complex & Intelligent Systems / Ausgabe 1/2021
Print ISSN: 2199-4536
Elektronische ISSN: 2198-6053
DOI
https://doi.org/10.1007/s40747-020-00217-5

Weitere Artikel der Ausgabe 1/2021

Complex & Intelligent Systems 1/2021 Zur Ausgabe