Next Article in Journal
The Pentagonal Fuzzy Number:Its Different Representations, Properties, Ranking, Defuzzification and Application in Game Problems
Next Article in Special Issue
Multi-Attribute Decision Making Method Based on Aggregated Neutrosophic Set
Previous Article in Journal
Explicit Integrator of Runge-Kutta Type for Direct Solution of u(4) = f(x, u, u′, u″)
Previous Article in Special Issue
Inspection Strategy under Indeterminacy Based on Neutrosophic Coefficient of Variation
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Neutrosophic Cubic Einstein Geometric Aggregation Operators with Application to Multi-Criteria Decision Making Method

1
Department of Mathematics and Statistics, Hazara University, Mansehra 21130, Pakistan
2
Department of Mathematics, College of Science Al-Zulfi, Majmaah University, Al-Zulfi 11932, Saudi Arabia
3
Department of Mathematics, COMSATS University Iaslamabad, Abbottabad Campus, Abbottabad 22060, Pakistan
4
Department of Mathematics, University of New Mexico, Albuquerque, NM 87301, USA
*
Author to whom correspondence should be addressed.
Symmetry 2019, 11(2), 247; https://doi.org/10.3390/sym11020247
Submission received: 26 December 2018 / Revised: 28 January 2019 / Accepted: 31 January 2019 / Published: 16 February 2019

Abstract

:
Neutrosophic cubic sets (NCs) are amore generalized version of neutrosophic sets(Ns) and interval neutrosophic sets (INs). Neutrosophic cubic setsare better placed to express consistent, indeterminate and inconsistent information, which provides a better platform to deal with incomplete, inconsistent and vague data. Aggregation operators play a key role in daily life, and in relation to science and engineering problems. In this paper we defined the algebraic and Einstein sum, multiplication and scalar multiplication, score and accuracy functions. Using these operations we defined geometric aggregation operators and Einstein geometric aggregation operators. First, we defined the algebraic and Einstein operators of addition, multiplication and scalar multiplication. We defined score and accuracy function to compare neutrosophic cubic values. Then we definedthe neutrosophic cubic weighted geometric operator (NCWG), neutrosophic cubic ordered weighted geometric operator (NCOWG), neutrosophic cubic Einstein weighted geometric operator (NCEWG), and neutrosophic cubic Einstein ordered weighted geometric operator (NCEOWG) over neutrosophic cubic sets. A multi-criteria decision making method is developed as an application to these operators. This method is then applied to a daily life problem.

1. Introduction

The theory of fuzzy sets was introduced by Zadeh [1].Soon after, it attracted experts of sciences and engineering due to its possibilistic behavior. The applicability of fuzzy sets extended it to interval valued fuzzy sets(IVFs) [2,3]. In 1986, K. Atnassov developed the theory of intuitionistic fuzzy sets [4], which were further extended to interval valued intuitionistic fuzzy sets in 1989 [5]. In 2012, Y.B. Jun generalized the idea of fuzzy sets and intuitionistic fuzzy sets to form cubic sets [6]. Smarandache presented his theory regarding the inconsistent and indeterminate behavior of data in 1999, and named it the neutrosophic set [7]. Neutrosophic sets consist of three components:Truth, indeterminate and falsehood, which provides a more general platform to deal with vague and insufficient data. In 2005, Wang et al. [8] presented the idea of interval valued neutrosophic sets. Interval valued neutrosophic sets provide a range to experts which makes them more comfortable with making the choice. Jun et al. defined the neutrosophic cubic set [9,10]. Neutrosophic cubic sets are a generalization of neutrosophic sets and interval neutrosophic sets. They enable us to choose both interval values and single value membership. This characteristic of neutrosophic cubic sets enables us to deal with uncertain and vague data more efficiently.
Decision making is one of the most important factors in scienceand day-to-day life as well. Aggregation operators are an imperative part of modern decision making. A lack of data or information makes it difficult for decision makers to take an appropriatedecision. This uncertain situation can be minimized using the vague nature neutrosophic cubic set and its extensions. Neutrosophic cubic set (NCs) are a more generalized version of neutrosophic sets (Ns) and interval neutrosophic sets (INs). Neutrosophic cubic setsare better placed to express consistent, indeterminate, and inconsistent information, which provides a better platform to deal with incomplete, inconsistent, and vague data. Aggregation operators have a key role in daily life, science and engineering problems. Zhan et al. [11] in their workapplications of neutrosophic cubic sets in multi-criteria decision making in 2017. Banerjee et al. [12] usedgrey rational analysis in their workGRA for multi attribute decision making in neutrosophic cubic set environment in 2017.Lu and Ye [13] definedcosine measure for neutrosophic cubic sets for multiple attribte decision making in 2017. Pramanik et al. [14] defined neutrosophic cubic MCGDM method based on similarity measurein 2017. Shi and Ye [15] defined Dombi aggregation operators of neutrosophic cubic set for multiple attribute deicision makingin 2018. Baolin et al. [16] applied Einstein aggregations onneutrosophic sets in a novel generalized simplified neutrosophic number Einstein aggregation operator 2018. Alot of work has been done and is being done by different researchers in decision making using neutrosophic cubic sets.
In this paper, we define algebraic and Einstein sum, multiplication and scalar multiplication, score and accuracy functions. Using these operations, we define geometric aggregation operators and Einstein geometric aggregation operators. First, we define algebraic and Einstein operators of addition, multiplication and scalar multiplication. We then define score and accuracy functions to compare neutrosophic cubic values. Following this, we propose a neutrosophic cubic ordered weighted geometric operator (NCOWG), neutrosophic cubic Einstein weighted geometric operator (NCEWG), and a neutrosophic cubic Einstein ordered weighted geometric operator (NCEOWG) over neutrosophic cubic sets. A multi-criteria decision making method is then developed as an application for these operators. This method is then applied to a daily life problem.

2. Preliminaries

This section consists of two parts: Notations, which consists of notations with their descriptions and some previous definitions; and results. We recommend the reader to see [1,2,3,6,7,8,9,16].

2.1. Notations

This section consists of some notations with their descriptions, as shown in Table 1.

2.2. Pre-Defined Definitions

This section consists of some predefined definitions and results.
Definition 1
[1].A mapping ψ : U [ 0 , 1 ] is called a fuzzy set, and ψ ( u ) is called a membership function, simply denoted by ψ .
Definition 2
[2,3].A mapping Ψ ˜ : U D [ 0 , 1 ] , where D [ 0 , 1 ] is the interval value of [ 0 , 1 ] , called the interval valued fuzzy set(IVF). For all u U Ψ ˜ ( u ) = { [ ψ L ( u ) , ψ U ( u ) ] | ψ L ( u ) , ψ U ( u ) [ 0 , 1 ]   a n d   ψ L ( u ) ψ U ( u ) } is membership degree of u in Ψ ˜ . This is simply denoted by Ψ ˜ = [ Ψ L , Ψ U ] .
Definition 3
[6].A structure C = { ( u , Ψ ˜ ( u ) , Ψ ( u ) ) | u U } is a cubic set in U in which Ψ ˜ ( u ) is IVF in U , that is, Ψ ˜ = [ Ψ L , Ψ U ] and Ψ is a fuzzy set in U . This can be simply denoted by C = ( Ψ ˜ , Ψ ) . C U denotes the collection of cubic sets in U .
Definition 4
[7].A structure N = { ( T N ( u ) , I N ( u ) , F N ( u ) ) | u U } is a neutrosophic set(Ns), where { T N ( u ) , I N ( u ) , F N ( u ) [ 0 , 1 ] } are called truth, indeterminacy and falsity functions, respectively.This can be simply denoted by N = ( T N , I N , F N ) .
Definition 5
[8].An interval neutrosophic set (INs) in U is a structure N = { ( T ˜ N ( u ) , I ˜ N ( u ) , F ˜ N ( u ) ) | u U } , where { T ˜ N ( u ) , I ˜ N ( u ) , F ˜ N ( u ) D [ 0 , 1 ] } is calledtruth, indeterminacy an falsity functionin U , respectively. This can be simply denoted by N = ( T ˜ N , I ˜ N , F ˜ N ) . For convenience, we denote N = ( T ˜ N , I ˜ N , F ˜ N ) by N = ( T ˜ N = [ T N L , T N U ] , I ˜ N = [ I N L , I N U ] , F ˜ N = [ F N L , F N U ] ) .
Definition 6
[9].A structure N = { ( u , T ˜ N ( u ) , I ˜ N ( u ) , F ˜ N ( u ) , T N ( u ) , I N ( u ) , F N ( u ) ) | u U } is neutrosophic cubic set(NCs) in U , in which ( T ˜ N = [ T N L , T N U ] , I ˜ N = [ I N L , I N U ] , F ˜ N = [ F N L , F N U ] ) is an interval neutrosophic set and ( T N , I N , F N ) is a neutrosophic set in U . Simply denoted by N = ( T ˜ N , I ˜ N , F ˜ N , T N , I N , F N ) , [ 0 , 0 ] T ˜ N + I ˜ N + F ˜ N [ 3 , 3 ] and 0 T N + I N + F N 3 . N U denotes the collection of neutrosophic cubic sets in U . Simply denoted by N = ( T ˜ N , I ˜ N , F ˜ N , T N , I N , F N ) .
Definition 7
[16].The t-operators are basically union and intersection operators in the theory of fuzzy sets, which are denoted by t-conorm ( Γ * ) and t-norm ( Γ ) , respectively. The role of t-operators is very important in fuzzy theory and its applications.
Definition 8
[16]. Γ * : [ 0 , 1 ] × [ 0 , 1 ] [ 0 , 1 ] is called t-conorm if it satisfies the following axioms:
  • Axiom 1. Γ * ( 1 , u ) = 1 and Γ * ( 0 , u ) = 0 ;
  • Axiom 2. Γ * ( u , v ) = Γ * ( v , u ) for all a and b;
  • Axiom 3. Γ * ( u , Γ * ( v , w ) ) = Γ * ( Γ * ( u , v ) , w ) for all a, b and c;
  • Axiom 4.If u u and v v , then Γ * ( u , v ) Γ * ( u , v ) .
Most known t-conorms are as follows:
  • The default t-conorm: Γ max * ( u , v ) = max ( u , v ) .
  • The bounded t-conorm: Γ b o u n d e d * ( u , v ) = min ( 1 , u + v ) .
  • The algebraic t-conorm: Γ a lg e b r a i c * ( u , v ) = u + v u v .
Definition 9
[16]. Γ : [ 0 , 1 ] × [ 0 , 1 ] [ 0 , 1 ] is called t-norm if it satisfies the following axioms:
  • Axiom 5. Γ ( 1 , u ) = u and Γ ( 0 , u ) = 0 ;
  • Axiom 6. Γ ( u , v ) = Γ ( v , u ) for all a and b;
  • Axiom 7. Γ ( u , Γ ( v , w ) ) = Γ ( Γ ( u , v ) , w ) for all a, b and c;
  • Axiom 8.If u u and v v , then Γ ( u , v ) Γ ( u , v ) .
Most well known t-norms are as follows:
  • The default t-norm: Γ min ( u , v ) = min ( u , v ) .
  • The bounded t-norm: Γ b o u n d e d ( u , v ) = max ( 0 , u + v 1 ) .
  • The algebraic t-norm: Γ a lg e b r a i c ( u , v ) = u v .
If Γ * ( u , v ) , Γ ( u , v ) are continuous and Γ * ( u , u ) > u , Γ ( u , u ) < u , then Γ * and Γ are said to be Archimedes t-conorm and t-norm, respectively. Any pair of dual t-conorm ( Γ * ) and t-norm ( Γ ) is used. It is known that t-norms and t-conorms operators satisfy the condition of conjunction and disjunction operators, respectively. However, the algebraic operations, like algebraic sum and product, are not unique and may correspond to union and intersection. The t-conorms and t-norms families have a vast range, which corresponds to unions and intersections. Among these, the Einstein sum and Einstein product are good choices since they give the smooth approximation like algebraic sum and algebraic product, respectively. Einstein sum E and Einstein product E are examples of t-conorm and t-norm, respectively:
Γ E * ( u , v ) = u + v 1 + u v
Γ E ( u , v ) = u v 1 + ( 1 u ) ( 1 v )
Group decision making is an important aspect of decision making theory. We are often in situationsin which we have to deal with more then one expert, attribute and alternative. Motivated by such situations, a multi-attribute decision making method for more then one expert is proposed on neutrosophic cubic aggregation operators.This whole work consisted of six sections. In Section 3, we define some algebraicEinstein operations and score and accuracy functions, along with some important results and examples. On the basis of these definitions and results, we define geometric and Einstein geometric aggregation operators on neutrosophic cubic sets in Section 4. In Section 5, an algorithm is proposed based on neutrosophic cubic geometric and Einstein geometric aggregation operators to deal with multi-attribute decision making problems. In the final section, a numerical example from daily life is presented as an application of the work.

3. Operations on Neutrosophic Cubic Sets

In this section, we introduce some new operations on neutrosophic cubic sets which are further used in the article.

3.1. Algebraic Addition, Multiplication and Scalar Multiplication

We introduce the algebraic addition, multiplication, and scalar multiplication on neutrosophic cubic sets(NCs). An important result of exponential multlipliction is established on the basis of these defintions, which provides the basis to define neutrosophic cubic geometric aggregation operators.
Definition 10.
The sum of two neutrosophic cubic sets(NCs), A = ( T ˜ A , I ˜ A , F ˜ A , T A , I A , F A ) , where T ˜ A = [ T A L , T A U ] , I ˜ A = [ I A L , I A U ] , F ˜ A = [ F A L , F A U ] , a n d B = ( T ˜ B , I ˜ B , F ˜ B , T B , I B , F B ) , where T ˜ B = [ T B L , T B U ] , I ˜ B = [ I B L , I B U ] , F ˜ B = [ F B L , F B U ] is defined as
A B = ( [ T A L + T B L T A L T B L , T A U + T B U T A U T B U ] , [ I A L + I B L I A L I B L , I A U + I B U I A U I B U ] , [ F A L F B L , F A U F B U ] , T A T B , I A I B , F A + F B F A F B )
Definition 11.
The product between two neutrosophic cubic sets (NCs), A = ( T ˜ A , I ˜ A , F ˜ A , T A , I A , F A ) , where T ˜ A = [ T A L , T A U ] , I ˜ A = [ I A L , I A U ] , F ˜ A = [ F A L , F A U ] and B = ( T ˜ B , I ˜ B , F ˜ B , T B , I B , F B ) , where T ˜ B = [ T B L , T B U ] , I ˜ B = [ I B L , I B U ] , F ˜ B = [ F B L , F B U ] is defined as
A B = ( [ T A L T B L , T A U T B U ] , [ I A L I B L , I A U I B U ] , [ F A L + F B L F A L F B L , F A U + F B U F A U F B U ] , T A + T B T A T B , I A + I B I A I B , F A F B )
Definition 12.
The scalar multiplication on a neutrosophic cubic set (NCs), A = ( T ˜ A , I ˜ A , F ˜ A , T A , I A , F A ) , where T ˜ A = [ T A L , T A U ] , I ˜ A = [ I A L , I A U ] , F ˜ A = [ F A L , F A U ] , and a Scalar k is defined as
k A = ( [ 1 ( 1 T A L ) k , 1 ( 1 T A U ) k ] , [ 1 ( 1 I A L ) k , 1 ( 1 I A U ) k ] , [ ( F A L ) k , ( F A U ) k ] , ( T A ) k , ( I A ) k , 1 ( 1 F A ) k )
The following result is established to deal with the exponential multiplication on neutrosophic cubic values. This result enables us to define geometric aggregation operators along some important results on neutrosophic cubic sets.
Theorem 1.
Let A = ( T ˜ A , I ˜ A , F ˜ A , T A , I A , F A ) , where T ˜ A = [ T A L , T A U ] , I ˜ A = [ I A L , I A U ] , F ˜ A = [ F A L , F A U ] , be a neutrosophic cubic value, then the exponential operation can be defined by
A k = ( [ ( T A L ) k , ( T A U ) k ] , [ ( I A L ) k , ( I A U ) k ] , [ 1 ( 1 F A L ) k , 1 ( 1 F A U ) k ] , 1 ( 1 T A ) k , 1 ( 1 I A ) k , ( F A ) k )
where A k = A A , A ( k t i m e s ) , and A k is a neutrosophic cubic value for every positive value of k.
Proof. 
We prove the theorem by mathematical induction, as the k = 1 , A 1 = A result holds.We assume that for k = m the result is true:
A m = ( [ ( T A L ) m , ( T A U ) m ] , [ ( I A L ) m , ( I A U ) m ] , [ 1 ( 1 F A L ) m , 1 ( 1 F A U ) m ] , 1 ( 1 T A ) m , 1 ( 1 I A ) m , ( F A ) m )
That is A m is neutrosophic cubic value. We prove that for k = m + 1 is also neutrosophic cubic value.
Since
A m A = ( [ ( T A L ) m , ( T A U ) m ] , [ ( I A L ) m , ( I A U ) m ] , [ 1 ( 1 F A L ) m , 1 ( 1 F A U ) m ] , 1 ( 1 T A ) m , 1 ( 1 I A ) m , ( F A ) m ) ( [ ( T A L ) , ( T A U ) ] , [ ( I A L ) , ( I A U ) ] , [ F A L , F A U ] , T A , I A , F A ) = ( [ ( T A L ) m + 1 , ( T A U ) m + 1 ] , [ ( I A L ) m + 1 , ( I A U ) m + 1 ] , [ 1 ( 1 F A L ) m + F A L ( 1 ( 1 F A L ) m ) F A L , 1 ( 1 F A U ) m + F A U ( 1 ( 1 F A U ) m ) F A U ] , 1 ( 1 T A ) m + T A ( 1 ( 1 T A ) m ) T A , 1 ( 1 I A ) m + I A ( 1 ( 1 I A ) m I A ) , ( F A ) m + 1 ) = ( [ ( T A L ) m + 1 , ( T A U ) m + 1 ] , [ ( I A L ) m + 1 , ( I A U ) m + 1 ] , [ 1 ( 1 F A L ) m + F A L F A L + ( 1 F A L ) m F A L , 1 ( 1 F A U ) m + F A U F A U + ( 1 F A U ) m F A U ] , 1 ( 1 T A ) m + T A T A + ( 1 T A ) m T A , 1 ( 1 I A ) m + I A I A + ( 1 I A ) m I A , ( F A ) m + 1 ) = ( [ ( T A L ) m + 1 , ( T A U ) m + 1 ] , [ ( I A L ) m + 1 , ( I A U ) m + 1 ] , [ 1 ( 1 F A L ) m + ( 1 F A L ) m F A L , 1 ( 1 F A U ) m + ( 1 F A U ) m F A U ] , 1 ( 1 T A ) m + ( 1 T A ) m T A , 1 ( 1 I A ) m + ( 1 I A ) m I A , ( F A ) m + 1 ) = ( [ ( T A L ) m + 1 , ( T A U ) m + 1 ] , [ ( I A L ) m + 1 , ( I A U ) m + 1 ] , [ 1 ( 1 F A L ) m ( 1 F A L ) , 1 ( 1 F A U ) m ( 1 F A U ) ] , 1 ( 1 T A ) m ( 1 T A ) , 1 ( 1 I A ) m ( 1 I A ) , ( F A ) m + 1 ) = ( [ ( T A L ) m + 1 , ( T A U ) m + 1 ] , [ ( I A L ) m + 1 , ( I A U ) m + 1 ] , [ 1 ( 1 F A L ) m + 1 , 1 ( 1 F A U ) m + 1 ] , 1 ( 1 T A ) m + 1 , 1 ( 1 I A ) m + 1 , ( F A ) m + 1 ) = A m + 1 .
 □

3.2. Einstein Addition, Multiplication and Scalar Multiplication

Taking into account the dual t-conorm ( Γ * ) and t-norm ( Γ ), the Einstein operations of union, intersection, addition, multiplication and scalar multiplication are defined on the neutrosophic cubic sets.An important result of Einstein exponential multlipliction is established on the basis of these defintions, which provides the base with which to define neutrosophic cubic Einstein geometric aggregation operators.
Definition 13.
The Einstein union between two neutrosophic cubic sets (NCs), A = ( T ˜ A , I ˜ A , F ˜ A , T A , I A , F A ) where T ˜ A = [ T A L , T A U ] , I ˜ A = [ I A L , I A U ] , F ˜ A = [ F A L , F A U ] , and B = ( T ˜ B , I ˜ B , F ˜ B , T B , I B , F B ) where T ˜ B = [ T B L , T B U ] , I ˜ B = [ I B L , I B U ] , F ˜ B = [ F B L , F B U ] is defined as
A B = ( Γ { T ˜ A , T ˜ B } , Γ { I ˜ A , I ˜ B } , Γ * { F ˜ A , F ˜ B } , Γ * { T A , T B } , Γ * { I A , I B } , Γ { F A , F B } )
Definition 14.
The Einstein intersection between two neutrosophic cubic sets(NCS), A = ( T ˜ A , I ˜ A , F ˜ A , T A , I A , F A ) , where T ˜ A = [ T A L , T A U ] , I ˜ A = [ I A L , I A U ] , F ˜ A = [ F A L , F A U ] and B = ( T ˜ B , I ˜ B , F ˜ B , T B , I B , F B ) , where T ˜ B = [ T B L , T B U ] , I ˜ B = [ I B L , I B U ] , F ˜ B = [ F B L , F B U ] is defined as
A B = ( Γ * { T ˜ A , T ˜ B } , Γ * { I ˜ A , I ˜ B } , Γ { F ˜ A , F ˜ B } , Γ { T A , T B } , Γ { I A , I B } , Γ * { F A , F B } ) .
On the basis of Einstein union and intersection the Einstein sum and product is defined over neutrosophic cubic values.
Definition 15.
The Einstein sum between two neutrosophic cubic sets (NCS), A = ( T ˜ A , I ˜ A , F ˜ A , T A , I A , F A ) , where T ˜ A = [ T A L , T A U ] , I ˜ A = [ I A L , I A U ] , F ˜ A = [ F A L , F A U ] and B = ( T ˜ B , I ˜ B , F ˜ B , T B , I B , F B ) , where T ˜ B = [ T B L , T B U ] , I ˜ B = [ I B L , I B U ] , F ˜ B = [ F B L , F B U ] is defined as
A E B = ( [ T A L + T B L 1 + T A L T B L , T A U + T B U 1 + T A U T B U ] , [ I A L + I B L 1 + I A L I B L , I A U + I B U 1 + I A U I B U ] , [ F A L F B L 1 + ( 1 F A L ) ( 1 F B L ) , F A U F B U 1 + ( 1 F A U ) ( 1 F B U ) ] T A T B 1 + ( 1 T A ) ( 1 T B ) , I A I B 1 + ( 1 I A ) ( 1 I B ) , F A + F B 1 + F A F B )
Definition 16.
The Einstein product between two neutrosophic cubic sets (NCS), A = ( T ˜ A , I ˜ A , F ˜ A , T A , I A , F A ) , where T ˜ A = [ T A L , T A U ] , I ˜ A = [ I A L , I A U ] , F ˜ A = [ F A L , F A U ] and B = ( T ˜ B , I ˜ B , F ˜ B , T B , I B , F B ) , where T ˜ B = [ T B L , T B U ] , I ˜ B = [ I B L , I B U ] , F ˜ B = [ F B L , F B U ] is defined as
A E B = ( [ T A L T B L 1 + ( 1 T A L ) ( 1 T B L ) , T A U T B U 1 + ( 1 T A U ) ( 1 T B U ) ] , [ I A L I B L 1 + ( 1 I A L ) ( 1 I B L ) , I A U I B U 1 + ( 1 I A U ) ( 1 I B U ) ] , [ F A L + F B L 1 + F A L F B L , F A U + F B U 1 + F A U F B U ] T A + T B 1 + T A T B , I A + I B 1 + I A I B , F A F B 1 + ( 1 F A ) ( 1 F B ) )
Definition 17.
The scalar multiplication on a neutrosophic cubic set(NCS), A = ( T ˜ A , I ˜ A , F ˜ A , T A , I A , F A ) , where T ˜ A = [ T A L , T A U ] , I ˜ A = [ I A L , I A U ] , F ˜ A = [ F A L , F A U ] , and scalar k is defined as
k E A = ( [ ( 1 + T A L ) k ( 1 T A L ) k ( 1 + T A L ) k + ( 1 T A L ) k , ( 1 + T A U ) k ( 1 T A U ) k ( 1 + T A U ) k + ( 1 T A U ) k ] , [ ( 1 + I A L ) k ( 1 I A L ) k ( 1 + I A L ) k + ( 1 I A L ) k , ( 1 + I A U ) k ( 1 I A U ) k ( 1 + I A U ) k + ( 1 I A U ) k ] , [ 2 ( F A L ) k ( 2 F A L ) k + ( F A L ) k , 2 ( F A U ) k ( 2 F A U ) k + ( F A U ) k ] , 2 ( T A ) k ( 2 T A ) k + ( T A ) k , 2 ( I A ) k ( 2 I A ) k + ( I A ) k , ( 1 + F A ) k ( 1 F A ) k ( 1 + F A ) k + ( 1 F A ) k )
After defining the scalar multiplication over the neutrosophic cubic set, we established the following result, which deals with the Einstein exponential multiplication on neutrosophic cubic values. This result enabled us to define Einstein geometric aggregation operators along with some important results on neutrosophic cubic sets.
Theorem 2.
Let A = ( T ˜ A , I ˜ A , F ˜ A , T A , I A , F A ) , where T ˜ A = [ T A L , T A U ] , I ˜ A = [ I A L , I A U ] , F ˜ A = [ F A L , F A U ] , be a neutrosophic cubic value, then the exponential operation defined by
A E k = ( [ 2 ( T A L ) k 2 ( T A L ) k + ( T A L ) k , 2 ( T A U ) k ( 2 T A U ) k + ( T A U ) k ] , [ 2 ( I A L ) k ( 2 I A L ) k + ( I A L ) k , 2 ( I A U ) k ( 2 I A U ) k + ( I A U ) k ] , [ ( 1 + F A L ) k ( 1 F A L ) k ( 1 + F A L ) k + ( 1 F A L ) k , ( 1 + F A U ) k ( 1 F A U ) k ( 1 + F A U ) k + ( 1 F A U ) k ] , ( 1 + T A ) k ( 1 T A ) k ( 1 + T A ) k + ( 1 T A ) k , ( 1 + I A ) k ( 1 I A ) k ( 1 + I A ) k + ( 1 I A ) k , 2 ( F A ) k ( 2 F A ) k + ( F A ) k )
where A E k = A E A E E A ( k t i m e s ) , moreover A E k is a neutrosophic cubic value for every positive value of k.
Proof. 
We prove the theorem by mathematical induction. For k = 1
A E = ( [ 2 ( T A L ) ( 2 T A L ) + ( T A L ) , 2 ( T A U ) ( 2 T A U ) + ( T A U ) ] , [ 2 ( I A L ) ( 2 I A L ) + ( I A L ) , 2 ( I A U ) ( 2 I A U ) + ( I A U ) ] , [ ( 1 + F A L ) ( 1 F A L ) ( 1 + F A L ) + ( 1 F A L ) , ( 1 + F A U ) ( 1 F A U ) ( 1 + F A U ) + ( 1 F A U ) ] , ( 1 + T A ) ( 1 T A ) ( 1 + T A ) + ( 1 T A ) , ( 1 + I A ) ( 1 I A ) ( 1 + I A ) + ( 1 I A ) , 2 ( F A ) ( 2 F A ) + ( F A ) )
We observe that the components T A L , T A U , I A L , I A U , F A are of the form 2 x ( 2 x ) + x , and F A L , F A U , T A , I A are of the form ( 1 + y ) ( 1 y ) ( 1 + y ) + ( 1 y ) ,
For all x , y [ 0 , 1 ] , clearly x = 2 x ( 2 x ) + x and y = ( 1 + y ) ( 1 y ) ( 1 + y ) + ( 1 y )
Hence A E is neutrosophic cubic value.
Assuming k = m is a neutrosophic cubic value i.e.,
A E m = ( [ 2 ( T A L ) m ( 2 T A L ) m + ( T A L ) m , 2 ( T A U ) m ( 2 T A U ) m + ( T A U ) m ] , [ 2 ( I A L ) m ( 2 I A L ) m + ( I A L ) m , 2 ( I A U ) m ( 2 I A U ) m + ( I A U ) m ] , [ ( 1 + F A L ) m ( 1 F A L ) m ( 1 + F A L ) m + ( 1 F A L ) m , ( 1 + F A U ) m ( 1 F A U ) m ( 1 + F A U ) m + ( 1 F A U ) m ] , ( 1 + T A ) m ( 1 T A ) m ( 1 + T A ) m + ( 1 T A ) m , ( 1 + I A ) m ( 1 I A ) m ( 1 + I A ) m + ( 1 I A ) m , 2 ( F A ) m ( 2 F A ) m + ( F A ) m )
is a neutrosophic cubic value. Then we prove A E k + 1 is neutrosophic cubic value.
Consider , A E m E A E = ( [ 2 ( T A L ) m ( 2 T A L ) m + ( T A L ) m , 2 ( T A U ) m ( 2 T A U ) m + ( T A U ) m ] , [ 2 ( I A L ) m ( 2 I A L ) m + ( I A L ) m , 2 ( I A U ) m ( 2 I A U ) m + ( I A U ) m ] , [ ( 1 + F A L ) m ( 1 F A L ) m ( 1 + F A L ) m + ( 1 F A L ) m , ( 1 + F A U ) m ( 1 F A U ) m ( 1 + F A U ) m + ( 1 F A U ) m ] , ( 1 + T A ) m ( 1 T A ) m ( 1 + T A ) m + ( 1 T A ) m , ( 1 + I A ) m ( 1 I A ) m ( 1 + I A ) m + ( 1 I A ) m , 2 ( F A ) m ( 2 F A ) m + ( F A ) m ) E ( [ 2 ( T A L ) ( 2 T A L ) + ( T A L ) , 2 ( T A U ) ( 2 T A U ) + ( T A U ) ] , [ 2 ( I A L ) 1 ( 2 I A L ) + ( I A L ) , 2 ( I A U ) 1 ( 2 I A U ) + ( I A U ) ] , [ ( 1 + F A L ) ( 1 F A L ) ( 1 + F A L ) + ( 1 F A L ) , ( 1 + F A U ) ( 1 F A U ) ( 1 + F A U ) + ( 1 F A U ) ] , ( 1 + T A ) ( 1 T A ) ( 1 + T A ) + ( 1 T A ) , ( 1 + I A ) ( 1 I A ) ( 1 + I A ) + ( 1 I A ) , 2 ( F A ) ( 2 F A ) + ( F A ) )
= ( [ 4 ( T A L ) m + 1 ( ( 2 T A L ) m + ( T A L ) m ) ( ( 2 T A L ) + T A L ) 1 + ( 1 2 ( T A L ) m ( 2 T A L ) m + ( T A L ) m ) ( 1 2 T A L ( 2 T A L ) + T A L ) , 4 ( T A U ) m + 1 ( ( 2 T A U ) m + ( T A U ) m ) ( ( 2 T A U ) + T A U ) 1 + ( 1 2 ( T A U ) m ( 2 T A U ) m + ( T A U ) m ) ( 1 2 T A U ( 2 T A U ) + T A U ) ] , [ 4 ( I A L ) m + 1 ( ( 2 I A L ) m + ( I A L ) m ) ( ( 2 I A L ) + I A L ) 1 + ( 1 2 ( I A L ) m ( 2 I A L ) m + ( I A L ) m ) ( 1 2 I A L ( 2 I A L ) + I A L ) , 4 ( I A U ) m + 1 ( ( 2 I A U ) m + ( I A U ) m ) ( ( 2 I A U ) + I A U ) 1 + ( 1 2 ( I A U ) m ( 2 I A U ) m + ( I A U ) m ) ( 1 2 I A U ( 2 I A U ) + I A U ) ] , [ ( ( 1 + F A L ) m ( 1 F A L ) m ( 1 + F A L ) m + ( 1 F A L ) m ) + ( ( 1 + F A L ) ( 1 F A L ) ( 1 + F A L ) + ( 1 F A L ) ) 1 + ( ( 1 + F A L ) m ( 1 F A L ) m ( 1 + F A L ) m + ( 1 F A L ) m ) ( ( 1 + F A L ) ( 1 F A L ) ( 1 + F A L ) + ( 1 F A L ) ) , ( ( 1 + F A U ) m ( 1 F A U ) m ( 1 + F A U ) m + ( 1 F A U ) m ) + ( ( 1 + F A U ) ( 1 F A U ) ( 1 + F A U ) + ( 1 F A U ) ) 1 + ( ( 1 + F A U ) m ( 1 F A U ) m ( 1 + F A U ) m + ( 1 F A U ) m ) ( ( 1 + F A U ) ( 1 F A U ) ( 1 + F A U ) + ( 1 F A U ) ) ] , ( ( 1 + T A ) m ( 1 T A ) m ( 1 + T A ) m + ( 1 T A ) m ) + ( ( 1 + T A ) ( 1 T A ) ( 1 + T A ) + ( 1 T A ) ) 1 + ( ( 1 + T A ) m ( 1 T A ) m ( 1 + T A ) m + ( 1 T A ) m ) ( ( 1 + T A ) ( 1 T A ) ( 1 + T A ) + ( 1 T A ) ) , ( ( 1 + I A ) m ( 1 I A ) m ( 1 + I A ) m + ( 1 I A ) m ) + ( ( 1 + I A ) ( 1 I A ) ( 1 + I A ) + ( 1 I A ) ) 1 + ( ( 1 + I A ) m ( 1 I A ) m ( 1 + I A ) m + ( 1 I A ) m ) ( ( 1 + I A ) ( 1 I A ) ( 1 + I A ) + ( 1 I A ) ) , 4 ( F A ) m + 1 ( ( 2 F A ) m + ( F A ) m ) ( ( 2 F A ) + F A ) 1 + ( 1 2 ( F A ) m ( 2 F A ) m + ( F A ) m ) ( 1 2 F A ( 2 F A ) + F A ) )
= ( [ 4 ( T A L ) m + 1 ( ( 2 T A L ) m + ( T A L ) m ) ( ( 2 T A L ) + T A L ) 1 + ( ( 2 T A L ) m + ( T A L ) m 2 ( T A L ) m ( 2 T A L ) m + ( T A L ) m ) ( ( 2 T A L ) + T A L 2 T A L ( 2 T A L ) + T A L ) , 4 ( T A U ) m + 1 ( ( 2 T A U ) m + ( T A U ) m ) ( ( 2 T A U ) + T A U ) 1 + ( ( 2 T A U ) m + ( T A U ) m 2 ( T A U ) m ( 2 T A U ) m + ( T A U ) m ) ( ( 2 T A U ) + T A U 2 T A U ( 2 T A U ) + T A U ) ] , [ 4 ( I A L ) m + 1 ( ( 2 I A L ) m + ( I A L ) m ) ( ( 2 I A L ) + I A L ) 1 + ( ( 2 I A L ) m + ( I A L ) m 2 ( I A L ) m ( 2 I A L ) m + ( I A L ) m ) ( ( 2 I A L ) + I A L 2 I A L ( 2 I A L ) + I A L ) , 4 ( I A U ) m + 1 ( ( 2 I A U ) m + ( I A U ) m ) ( ( 2 I A U ) + I A U ) 1 + ( ( 2 I A U ) m + ( I A U ) m 2 ( I A U ) m ( 2 I A U ) m + ( I A U ) m ) ( ( 2 I A U ) + I A U 2 I A U ( 2 I A U ) + I A U ) ] , [ ( ( 1 + F A L ) m ( 1 F A L ) m ) ( ( 1 + F A L ) + ( 1 F A L ) ) + ( ( 1 + F A L ) m + ( 1 F A L ) m ) ( ( 1 + F A L ) ( 1 F A L ) ) ( ( 1 + F A L ) m + ( 1 F A L ) m ) ( ( 1 + F A L ) + ( 1 F A L ) ) ( ( 1 + F A L ) m + ( 1 F A L ) m ) ( ( 1 + F A L ) + ( 1 F A L ) ) + ( 1 + F A L ) m + 1 ( 1 + F A L ) m ( 1 F A L ) ( 1 F A L ) m ( 1 + F A L ) + ( 1 F A L ) m + 1 ( ( 1 + F A L ) m + ( 1 F A L ) m ) ( ( 1 + F A L ) + ( 1 F A L ) ) , ( ( 1 + F A U ) m ( 1 F A U ) m ) ( ( 1 + F A U ) + ( 1 F A U ) ) + ( ( 1 + F A U ) m + ( 1 F A U ) m ) ( ( 1 + F A U ) ( 1 F A U ) ) ( ( 1 + F A U ) m + ( 1 F A U ) m ) ( ( 1 + F A U ) + ( 1 F A U ) ) ( ( 1 + F A U ) m + ( 1 F A U ) m ) ( ( 1 + F A U ) + ( 1 F A U ) ) + ( 1 + F A U ) m + 1 ( 1 + F A U ) m ( 1 F A U ) ( 1 F A U ) m ( 1 + F A U ) + ( 1 F A U ) m + 1 ( ( 1 + F A U ) m + ( 1 F A U ) m ) ( ( 1 + F A U ) + ( 1 F A U ) ) ] , ( ( 1 + T A ) m ( 1 T A ) m ) ( ( 1 + T A ) + ( 1 T A ) ) + ( ( 1 + T A ) m + ( 1 T A ) m ) ( ( 1 + T A ) ( 1 T A ) ) ( ( 1 + T A ) m + ( 1 T A ) m ) ( ( 1 + T A ) + ( 1 T A ) ) ( ( 1 + T A ) m + ( 1 T A ) m ) ( ( 1 + T A ) + ( 1 T A ) ) + ( 1 + T A ) m + 1 ( 1 + T A ) m ( 1 T A ) ( 1 T A ) m ( 1 + T A ) + ( 1 T A ) m + 1 ( ( 1 + T A ) m + ( 1 T A ) m ) ( ( 1 + T A ) + ( 1 T A ) ) , ( ( 1 + I A ) m ( 1 I A ) m ) ( ( 1 + I A ) + ( 1 I A ) ) + ( ( 1 + I A ) m + ( 1 I A ) m ) ( ( 1 + I A ) ( 1 I A ) ) ( ( 1 + I A ) m + ( 1 I A ) m ) ( ( 1 + I A ) + ( 1 I A ) ) ( ( 1 + I A ) m + ( 1 I A ) m ) ( ( 1 + I A ) + ( 1 I A ) ) + ( 1 + I A ) m + 1 ( 1 + I A ) m ( 1 I A ) ( 1 I A ) m ( 1 + I A ) + ( 1 I A ) m + 1 ( ( 1 + I A ) m + ( 1 I A ) m ) ( ( 1 + I A ) + ( 1 I A ) ) , 4 ( F A ) m + 1 ( ( 2 F A ) m + ( F A ) m ) ( ( 2 F A ) + F A ) 1 + ( ( 2 F A ) m + ( F A ) m 2 ( F A ) m ( 2 F A ) m + ( F A ) m ) ( ( 2 F A ) + F A 2 F A ( 2 F A ) + F A ) )
= ( [ 4 ( T A L ) m + 1 ( ( 2 T A L ) m + ( T A L ) m ) ( ( 2 T A L ) + T A L ) ( ( ( 2 T A L ) m + ( T A L ) m ) ( ( 2 T A L ) + T A L ) ) + ( ( ( 2 T A L ) m ( T A L ) m ) ( ( 2 T A L ) T A L ) ) ( ( 2 T A L ) m + ( T A L ) m ) ( ( 2 T A L ) + T A L ) , 4 ( T A U ) m + 1 ( ( 2 T A U ) m + ( T A U ) m ) ( ( 2 T A U ) + T A U ) ( ( ( 2 T A U ) m + ( T A U ) m ) ( ( 2 T A U ) + T A U ) ) + ( ( ( 2 T A U ) m ( T A U ) m ) ( ( 2 T A U ) T A U ) ) ( ( 2 T A U ) m + ( T A U ) m ) ( ( 2 T A U ) + T A U ) ] , [ 4 ( I A L ) m + 1 ( ( 2 I A L ) m + ( I A L ) m ) ( ( 2 I A L ) + I A L ) ( ( ( 2 I A L ) m + ( I A L ) m ) ( ( 2 I A L ) + I A L ) ) + ( ( ( 2 I A L ) m ( I A L ) m ) ( ( 2 I A L ) I A L ) ) ( ( 2 I A L ) m + ( I A L ) m ) ( ( 2 I A L ) + I A L ) , 4 ( I A U ) m + 1 ( ( 2 I A U ) m + ( I A U ) m ) ( ( 2 I A U ) + I A U ) ( ( ( 2 I A U ) m + ( I A U ) m ) ( ( 2 I A U ) + I A U ) ) + ( ( ( 2 I A U ) m ( I A U ) m ) ( ( 2 I A U ) I A U ) ) ( ( 2 I A U ) m + ( I A U ) m ) ( ( 2 I A U ) + I A U ) ] , [ ( 1 + F A L ) m + 1 + ( 1 + F A L ) m ( 1 F A L ) ( 1 F A L ) m ( 1 + F A L ) ( 1 F A L ) m + 1 + ( 1 + F A L ) m + 1 ( 1 + F A L ) m ( 1 F A L ) + ( 1 F A L ) m ( 1 + F A L ) ( 1 F A L ) m + 1 ( 1 + F A L ) m + 1 + ( 1 + F A L ) m ( 1 F A L ) ( 1 F A L ) m ( 1 + F A L ) + ( 1 F A L ) m + 1 + ( 1 + F A L ) m + 1 ( 1 + F A L ) m ( 1 F A L ) + ( 1 F A L ) m ( 1 + F A L ) + ( 1 F A L ) m + 1 , ( 1 + F A U ) m + 1 + ( 1 + F A U ) m ( 1 F A U ) ( 1 F A U ) m ( 1 + F A U ) ( 1 F A U ) m + 1 + ( 1 + F A U ) m + 1 ( 1 + F A U ) m ( 1 F A U ) + ( 1 F A U ) m ( 1 + F A U ) ( 1 F A U ) m + 1 ( 1 + F A U ) m + 1 + ( 1 + F A U ) m ( 1 F A U ) ( 1 F A U ) m ( 1 + F A U ) + ( 1 F A U ) m + 1 + ( 1 + F A U ) m + 1 ( 1 + F A U ) m ( 1 F A U ) + ( 1 F A U ) m ( 1 + F A U ) + ( 1 F A U ) m + 1 ] , ( 1 + T A ) m + 1 + ( 1 + T A ) m ( 1 T A ) ( 1 T A ) m ( 1 + T A ) ( 1 T A ) m + 1 + ( 1 + T A ) m + 1 ( 1 + T A ) m ( 1 T A ) + ( 1 T A ) m ( 1 + T A ) ( 1 T A ) m + 1 ( 1 + T A ) m + 1 + ( 1 + T A ) m ( 1 T A ) ( 1 T A ) m ( 1 + T A ) + ( 1 T A ) m + 1 + ( 1 + T A ) m + 1 ( 1 + T A ) m ( 1 T A ) + ( 1 T A ) m ( 1 + T A ) + ( 1 T A ) m + 1 , ( 1 + I A ) m + 1 + ( 1 + I A ) m ( 1 I A ) ( 1 I A ) m ( 1 + I A ) ( 1 I A ) m + 1 + ( 1 + I A ) m + 1 ( 1 + I A ) m ( 1 I A ) + ( 1 I A ) m ( 1 + I A ) ( 1 I A ) m + 1 ( 1 + I A ) m + 1 + ( 1 + I A ) m ( 1 I A ) ( 1 I A ) m ( 1 + I A ) + ( 1 I A ) m + 1 + ( 1 + I A ) m + 1 ( 1 + I A ) m ( 1 I A ) + ( 1 I A ) m ( 1 + I A ) + ( 1 I A ) m + 1 , 4 ( F A ) m + 1 ( ( 2 F A ) m + ( F A ) m ) ( ( 2 F A ) + F A ) ( ( ( 2 F A ) m + ( F A ) m ) ( ( 2 F A ) + F A ) ) + ( ( ( 2 F A ) m ( F A ) m ) ( ( 2 F A ) F A ) ) ( ( 2 F A ) m + ( F A ) m ) ( ( 2 F A ) + F A ) )
= ( [ 4 ( T A L ) m + 1 ( 2 T A L ) m + 1 + T A L ( 2 T A L ) m + ( T A L ) m + 1 + T A L m ( 2 T A L ) + ( ( 2 T A L ) m + 1 T A L ( 2 T A L ) m + ( T A L ) m + 1 ( T A L ) m ( 2 T A L ) ) , 4 ( T A U ) m + 1 ( 2 T A U ) m + 1 + T A U ( 2 T A U ) m + ( T A U ) m + 1 + T A U m ( 2 T A U ) + ( ( 2 T A U ) m + 1 T A U ( 2 T A U ) m + ( T A U ) m + 1 ( T A U ) m ( 2 T A U ) ) ] , [ 4 ( I A L ) m + 1 ( 2 I A L ) m + 1 + I A L ( 2 I A L ) m + ( I A L ) m + 1 + I A L m ( 2 I A L ) + ( ( 2 I A L ) m + 1 I A L ( 2 I A L ) m + ( I A L ) m + 1 ( I A L ) m ( 2 I A L ) ) , 4 ( I A U ) m + 1 ( 2 I A U ) m + 1 + I A U ( 2 I A U ) m + ( I A U ) m + 1 + I A U m ( 2 I A U ) + ( ( 2 I A U ) m + 1 I A U ( 2 I A U ) m + ( I A U ) m + 1 ( I A U ) m ( 2 I A U ) ) ] , [ 2 ( ( 1 + F A L ) m + 1 ( 1 F A L ) m + 1 ) 2 ( ( 1 + F A L ) m + 1 + ( 1 F A L ) m + 1 ) , 2 ( ( 1 + F A U ) m + 1 ( 1 F A U ) m + 1 ) 2 ( ( 1 + F A U ) m + 1 + ( 1 F A U ) m + 1 ) ] , 2 ( ( 1 + T A ) m + 1 ( 1 T A ) m + 1 ) 2 ( ( 1 + T A ) m + 1 + ( 1 T A ) m + 1 ) , 2 ( ( 1 + I A ) m + 1 ( 1 I A ) m + 1 ) 2 ( ( 1 + I A ) m + 1 + ( 1 I A ) m + 1 ) , 4 ( F A ) m + 1 ( 2 F A ) m + 1 + F A ( 2 F A ) m + ( F A ) m + 1 + F A m ( 2 F A ) + ( ( 2 F A ) m + 1 F A ( 2 F A ) m + ( F A ) m + 1 ( F A ) m ( 2 F A ) ) )
= ( [ 4 ( T A L ) m + 1 2 ( ( 2 T A L ) m + 1 + ( T A L ) m + 1 ) , 4 ( T A U ) m + 1 2 ( ( 2 T A U ) m + 1 + ( T A U ) m + 1 ) ] , [ 4 ( I A L ) m + 1 2 ( ( 2 I A L ) m + 1 + ( I A L ) m + 1 ) , 4 ( I A U ) m + 1 2 ( ( 2 I A U ) m + 1 + ( I A U ) m + 1 ) ] , [ ( ( 1 + F A L ) m + 1 ( 1 F A L ) m + 1 ) ( ( 1 + F A L ) m + 1 + ( 1 F A L ) m + 1 ) , ( ( 1 + F A U ) m + 1 ( 1 F A U ) m + 1 ) ( ( 1 + F A U ) m + 1 + ( 1 F A U ) m + 1 ) ] , ( ( 1 + T A ) m + 1 ( 1 T A ) m + 1 ) ( ( 1 + T A ) m + 1 + ( 1 T A ) m + 1 ) , ( ( 1 + I A ) m + 1 ( 1 I A ) m + 1 ) ( ( 1 + I A ) m + 1 + ( 1 I A ) m + 1 ) , 4 ( F A ) m + 1 2 ( ( 2 F A ) m + 1 + ( F A ) m + 1 ) )
= ( [ 2 ( T A L ) m + 1 ( ( 2 T A L ) m + 1 + ( T A L ) m + 1 ) , 2 ( T A U ) m + 1 ( ( 2 T A U ) m + 1 + ( T A U ) m + 1 ) ] , [ 2 ( I A L ) m + 1 ( ( 2 I A L ) m + 1 + ( I A L ) m + 1 ) , 2 ( I A U ) m + 1 ( ( 2 I A U ) m + 1 + ( I A U ) m + 1 ) ] , [ ( ( 1 + F A L ) m + 1 ( 1 F A L ) m + 1 ) ( ( 1 + F A L ) m + 1 + ( 1 F A L ) m + 1 ) , ( ( 1 + F A U ) m + 1 ( 1 F A U ) m + 1 ) ( ( 1 + F A U ) m + 1 + ( 1 F A U ) m + 1 ) ] , ( ( 1 + T A ) m + 1 ( 1 T A ) m + 1 ) ( ( 1 + T A ) m + 1 + ( 1 T A ) m + 1 ) , ( ( 1 + I A ) m + 1 ( 1 I A ) m + 1 ) ( ( 1 + I A ) m + 1 + ( 1 I A ) m + 1 ) , 2 ( F A ) m + 1 ( ( 2 F A ) m + 1 + ( F A ) m + 1 ) )
Which shows that k = m + 1 is a neutrosophic cubic value. □

3.3. Score and Accuracy Function of Neutrosophic Cubic Set

For the comparison of two neutrosophic values, the score and accuracy function are defined. The score function is used tocompare two neutrosophic cubic values; sometimes the score of two neutrosophic cubic values becomes equal, although they have different components of truth, indeterminancy and falsity functions. This situation can be overcome by the help of an accuracy function. The following definition, along with examples, providesa better view of understanding to the reader.
Definition 18.
Let N = ( T ˜ N , I ˜ N , F ˜ N , T N , I N , F N ) , where T ˜ N = [ T N L , T N U ] , I ˜ N = [ I N L , I N U ] , F ˜ N = [ F N L , F N U ] , be a neutrosophic cubic value and we define the score function as
S ( N ) = [ T N L F N L + T N U F N U + T N F N ]
Sometimes the situation arises that the score of two neutrosophic cubic values are equal. In such a situation, a comparison is made on the basis of an accuracy function.
Definition 19.
Let N = ( T ˜ N , I ˜ N , F ˜ N , T N , I N , F N ) , where T ˜ N = [ T N L , T N U ] , I ˜ N = [ I N L , I N U ] , F ˜ N = [ F N L , F N U ] , be a neutrosophic cubic value, the accuracy function is defined as
H ( u ) = 1 9 { T N L + I N L + F N L + T N U + I N U + F N U + T N + I N + F N }
The following definition is accomplished for the comparison relation of the neutrosophic cubic values.
Definition 20.
Let N 1 and N 2 be two neutrosophic cubic values, where S N 1 and S N 2 are scores and H N 1 and H N 2 are accuracy functions of N 1 and N 2 , respectively.
  • If S N 1 > S N 2 N 1 > N 2
  • If S N 1 = S N 2 and
    H N 1 > H N 2 N 1 > N 2
    H N 1 = H N 2 N 1 = N 2
Example 1.
Let N 1 = ( [ 0.5 , 0.9 ] [ 0.6 , 0.9 ] [ 0.1 , 0.4 ] , 0.3 , 0.4 , 0.4 ) and N 2 = ( [ 0.2 , 0.8 ] [ 0.5 , 0.9 ] [ 0.4 , 0.8 ] , 0.4 , 0.45 , 0.8 ) be two neutrosophic sets.
Then
S N 1 = 0.8 , a n d S N 2 = 0.6
S N 1 > S N 2 N 1 > N 2
In the following example the score funtions are equal, so accuracy functions are used to compare neutrosophic cubic values.
Example 2.
Let N 1 = ( [ 0.4 , 0.9 ] [ 0.5 , 0.8 ] [ 0.1 , 0.7 ] , 0.4 , 0.5 , 0.8 ) and N 2 = ( [ 0.4 , 0.6 ] [ 0.5 , 0.9 ] [ 0.6 , 0.7 ] , 0.7 , 0.5 , 0.3 ) be two neutrosophic sets.
S N 1 = 0.1 , S N 2 = 0.1
S N 1 = S N 2 N 1 = N 2
H N 1 = 0.566 , H N 2 = 0.577
H N 1 < H N 2 N 1 < N 2

4. Neutrosophic Cubic Geometric and Einstein Geometric Aggregation Operators

In this section, we introduce the concept of neutrosophic cubic geometric aggregation operators and neutrosophic cubic Einstein geometric aggregation operators.
This section consists of two sub-sections: In Section 4.1, the neutrosophic cubic geometric aggregation operators are defined on the basis of Section 3.1; and in Section 4.2, the neutrosophic cubic Einstein geometric aggregation operators are defined on the basis of Section 3.2.

4.1. Neutrosophic Cubic Weighted Geometric Aggregation Operator

We define neutrosophic cubic geometric aggregation operators using Section 3.1.
Definition 21.
We define the neutrosophic cubic weighted geometric operator(NCWG) as
N C W G : R m R   defined   by   N C W G w ( N 1 , N 2 , , N m ) = j = 1 m N j w j
where the weight W = ( w 1 , w 2 , , w m ) T of corresponding neutrosophic cubic values is such that each w j [ 0 , 1 ] and w j j = 1 m = 1 .
In NCWG, the neutrosophic cubic values are first weighted then aggregated.
Definition 22.
We define the neutrosophic cubic ordered weighted geometric operator(NCOWG) as
N C O W G : R m R   defined   by   N C O W G w ( N 1 , N 2 , , N m ) = j = 1 m N ( γ ) j w j
where N ( γ ) j are descending ordered neutrosophic cubic values, and the weight W = ( w 1 , w 2 , , w m ) T of corresponding neutrosophic cubic values N j ( j = 1 , 2 , 3 , , m ) is such that each w j [ 0 , 1 ] and w j j = 1 m = 1 .
In NCOWG, the neutrosophic cubic values are first arranged in decending order, weighted and then aggregated.
Theorem 3.
Let N j = ( T ˜ N j , I ˜ N j , F ˜ N j , T N j , I N j , F N j ) , where T ˜ N j = [ T N j L , T N j U ] , I ˜ N j = [ I N j L , I N j U ] , F ˜ N j = [ F N j L , F N j U ] ( j = 1 , 2 , , n ) are a collection of neutrosophic cubic values, then neutrosophic cubic weighted geometric(NCWG) operator of N j is also a neutrosophic cubic value and
N C W G ( N j ) = ( [ j = 1 m ( T N j L ) w j , j = 1 m ( T N j U ) w j ] , [ j = 1 m ( I N j L ) w j , j = 1 m ( I N j U ) w j ] [ 1 j = 1 m ( 1 F N j L ) w j , 1 j = 1 m ( 1 F N j U ) w j ] 1 j = 1 m ( 1 ( T N j ) ) w j , 1 j = 1 m ( 1 ( I N j ) ) w j , j = 1 m ( F N j ) w j )
where the weight W = ( w 1 , w 2 , , w m ) T of N j ( j = 1 , 2 , 3 , , m ) such that w j [ 0 , 1 ] and w j j = 1 m = 1 .
Proof. 
By mathematical induction for m = 2 , using
j = 1 2 N j w j = N 1 w 1 N 2 w 2
= ( [ ( T N j L ) w 1 , ( T N j U ) w 1 ] , [ ( I N j L ) w 1 , ( I N j U ) w 1 ] , [ 1 ( 1 F N j L ) w 1 , 1 ( 1 F N j U ) w 1 ] , 1 ( 1 ( T N j ) ) w 1 , 1 ( 1 ( I N j ) ) w 1 , ( F N j ) w 1 ) ( [ ( T N j L ) w 2 , ( T N j U ) w 2 ] , [ ( I N j L ) w 2 , ( I N j U ) w 2 ] , [ 1 ( 1 F N j L ) w 2 , 1 ( 1 F N j U ) w 2 ] , 1 ( 1 ( T N j ) ) w 2 , 1 ( 1 ( I N j ) ) w 2 , ( F N j ) w 2 )
= ( [ j = 1 2 ( T N j L ) w j , j = 1 2 ( T N j U ) w j ] , [ j = 1 2 ( I N j L ) w j , j = 1 2 ( I N j U ) w j ] , [ 1 j = 1 2 ( 1 F N j L ) w j , j = 1 2 ( F N j U ) w j ] , 1 j = 1 2 ( 1 T N j ) w j , 1 j = 1 2 ( 1 I N j ) w j , j = 1 2 ( F N j ) w j )
For m = n , we have
j = 1 n N j w j = ( [ j = 1 n ( T N j L ) w j , j = 1 n ( T N j U ) w j ] , [ j = 1 n ( I N j L ) w j , j = 1 n ( I N j U ) w j ] , [ 1 j = 1 n ( 1 F N j L ) w j , j = 1 n ( F N j U ) w j ] , 1 j = 1 n ( 1 T N j ) w j , 1 j = 1 n ( 1 I N j ) w j , j = 1 n ( F N j ) w j )
We prove the result holds for m = n + 1 ,
N n + 1 w n + 1 = ( [ ( T N n + 1 L ) w n + 1 , ( T N n + 1 U ) w n + 1 ] , [ ( I N j + 1 L ) w j + 1 , ( I N j + 1 U ) w j + 1 ] , [ 1 ( 1 F N n + 1 L ) w n + 1 , 1 ( 1 F N n + 1 U ) w n + 1 ] , 1 ( 1 T N n + 1 ) w n + 1 , 1 ( 1 I N n + 1 ) w n + 1 , ( F N n + 1 ) w n + 1 )
j = 1 n N j w j N n + 1 w n + 1 = ( [ j = 1 n ( T N j L ) w j , j = 1 n ( T N j U ) w j ] , [ j = 1 n ( I N j L ) w j , j = 1 n ( I N j U ) w j ] , [ 1 j = 1 n ( 1 F N j L ) w j , j = 1 n ( F N j U ) w j ] , 1 j = 1 n ( 1 T N j ) w j , 1 j = 1 n ( 1 I N j ) w j , j = 1 n ( F N j ) w j ) ( [ ( T N n + 1 L ) w n + 1 , ( T N n + 1 U ) w n + 1 ] , [ ( I N j + 1 L ) w j + 1 , ( I N j + 1 U ) w j + 1 ] , [ 1 ( 1 F N n + 1 L ) w n + 1 , 1 ( 1 F N n + 1 U ) w n + 1 ] , 1 ( 1 T N n + 1 ) w n + 1 , 1 ( 1 I N n + 1 ) w n + 1 , ( F N n + 1 ) w n + 1 )
j = 1 n + 1 N j w j = ( [ j = 1 n ( T N j L ) w j ( T N m + 1 L ) w m + 1 , j = 1 n ( T N j U ) w j ( T N m + 1 U ) w m + 1 ] , [ j = 1 n ( I N j L ) w j ( I N m + 1 L ) w m + 1 , j = 1 n ( I N j U ) w j ( I N m + 1 U ) w m + 1 ] , [ 1 j = 1 n ( 1 F N j L ) w j + 1 ( 1 F N m + 1 L ) w m + 1 ( 1 j = 1 n ( 1 F N j L ) w j ) ( 1 ( 1 F N m + 1 L ) w m + 1 ) , 1 j = 1 n ( 1 F N j U ) w j + 1 ( 1 F N m + 1 U ) w m + 1 ( 1 j = 1 n ( 1 F N j U ) w j ) ( 1 ( 1 F N m + 1 U ) w m + 1 ) , ] , 1 j = 1 n ( 1 T N j ) w j + 1 ( 1 T N m + 1 ) w m + 1 ( 1 j = 1 n ( 1 T N j ) w j ) ( 1 ( 1 T N m + 1 ) w m + 1 ) 1 j = 1 n ( 1 I N j ) w j + 1 ( 1 I N m + 1 ) w m + 1 ( 1 j = 1 n ( 1 I N j ) w j ) ( 1 ( 1 I N m + 1 ) w m + 1 ) j = 1 n ( F N j ) w j ( F N m + 1 ) w m + 1 )
= ( [ j = 1 n + 1 ( T N j L ) w j , j = 1 n + 1 ( T N j U ) w j ] [ j = 1 n + 1 ( I N j L ) w j , j = 1 n + 1 ( I N j U ) w j ] , [ 2 j = 1 n + 1 ( 1 F N j L ) w j 1 + j = 1 n ( 1 F N j L ) w j + ( 1 F N m + 1 L ) w m + 1 ( j = 1 n ( 1 F N j L ) w j ) ( 1 F N m + 1 L ) w m + 1 , 2 j = 1 n + 1 ( 1 F N j U ) w j 1 + j = 1 n + 1 ( 1 F N j U ) w j + ( 1 F N m + 1 U ) w m + 1 ( j = 1 n ( 1 F N j U ) w j ) ( 1 F N m + 1 U ) w m + 1 ] , 2 j = 1 n + 1 ( 1 T N j ) w j 1 + j = 1 n ( 1 T N j ) w j + ( 1 T N m + 1 ) w m + 1 ( j = 1 n ( 1 T N j ) w j ) ( 1 T N m + 1 ) w m + 1 , 2 j = 1 n + 1 ( 1 I N j ) w j 1 + j = 1 n ( 1 I N j ) w j + ( 1 I N m + 1 ) w m + 1 ( j = 1 n ( 1 I N j ) w j ) ( 1 I N m + 1 ) w m + 1 , j = 1 n + 1 ( F N j ) w j )
= ( [ J = 1 n + 1 ( T N j L ) w j , J = 1 n + 1 ( T N j U ) w j ] [ J = 1 n + 1 ( I N j L ) w j , J = 1 n + 1 ( I N j U ) w j ] , [ 1 J = 1 n + 1 ( 1 F N j L ) w j , 1 J = 1 n + 1 ( 1 F N j U ) w j ] , , 1 J = 1 n + 1 ( 1 T N j ) w j , 1 J = 1 n + 1 ( 1 I N j ) w j , J = 1 n + 1 ( 1 F N j ) w j )
 □
Theorem 4.
Let N j = ( T ˜ N j , I ˜ N j , F ˜ N j , T N j , I N j , F N j ) , where T ˜ N j = [ T N j L , T N j U ] , I ˜ N j = [ I N j L , I N j U ] , F ˜ N j = [ F N j L , F N j U ] , ( j = 1 , 2 , , m ) is a collection of neutrosophic cubic values The weight W = ( w 1 , w 2 , , w m ) T of N j ( j = 1 , 2 , 3 , , m ) , be such that w j [ 0 , 1 ] and w j j = 1 m = 1 .
  • Idempotency: If for all N j = ( T ˜ N j , I ˜ N j , F ˜ N j , T N j , I N j , F N j ) , where T ˜ N j = [ T N j L , T N j U ] , I ˜ N j = [ I N j L , I N j U ] , F ˜ N j = [ F N j L , F N j U ] , ( j = 1 , 2 , , m ) are equal, that is, N j = N for all k, then NCW G w ( N 1 , N 2 , , N m ) = N
  • Monotonicity: Let B j = ( T ˜ B j , I ˜ B j , F ˜ B j , T B j , I B j , F B j ) where T ˜ B j = [ T B j L , T B j U ] , I ˜ B j = [ I B j L , I B j U ] , F ˜ B j = [ F B j L , F B j U ] ( j = 1 , 2 , , m ) is the collection of neutrosophic cubic values. If S B j ( u ) S N j ( u ) and B j ( u ) N j ( u ) then N C W G w ( N 1 , N 2 , , N m ) N C W G w ( B 1 , B 2 , , B m ) .
  • Boundary: N N C W G w { ( N 1 ) T , ( N 2 ) T , , ( N m ) T } N + , where
    N = { min j T N j L , min j I N j L , 1 max j F N j L , min j T N j , min j I N j , 1 max j F N j L , min j T N j , min j I N j , 1 max j F N j L } , N + = { max j T N j U , max j I N j U , 1 min j F N j U , max j T N j , max j I N j , 1 min j F N j , max T N j j , max I N j j , 1 min j F N j }
Proof. 
  • Idempotent: Since N j = N , so
    N C W G ( N j ) = ( [ j = 1 m ( T N L ) w j , j = 1 m ( T N U ) w j ] , [ j = 1 m ( I N L ) w j , j = 1 m ( I N U ) w j ] , [ 1 j = 1 m ( 1 F N L ) w j , 1 j = 1 m ( 1 F N L ) w j ] , 1 j = 1 m ( 1 T N ) w j , 1 j = 1 m ( 1 I N ) w j , j = 1 m ( F N ) w j ) = ( [ ( T N L ) j = 1 m w j , ( T N U ) j = 1 m w j ] , [ ( I N L ) j = 1 m w j , ( I N U ) j = 1 m w j ] , [ 1 ( 1 F N L ) j = 1 m w j , 1 ( 1 F N U ) j = 1 m w j ] , 1 ( 1 T N ) j = 1 m w j , 1 ( 1 I N ) j = 1 m w j , ( F N ) j = 1 m w j ) = ( T ˜ N , I ˜ N , F ˜ N , T N , I N , F N )
  • Monotonicity: Since NCOWG is strictly monotone function.
  • Boundary: Let u = min N and y = max N + , then by monotonicity we have u N C O W A ( N j ) y N N C O W G ( N j ) N + .
 □
Theorem 5.
Let N j = ( T ˜ N j , I ˜ N j , F ˜ N j , T N j , I N j , F N j ) , where T ˜ N j = [ T N j L , T N j U ] , I ˜ N j = [ I N j L , I N j U ] , F ˜ N j = [ F N j L , F N j U ] , ( j = 1 , 2 , , n ) be the collection of neutrosophic cubic values and W = ( w 1 , w 2 , , w n ) T is the weight of the NCOWG, with w j [ 0 , 1 ] and w j j = 1 m = 1 .
  • If W = ( 1 , 0 , , 0 ) T , then
    NCOWG ( N 1 , N 2 , , N n ) = max N j
  • If W = ( 0 , 0 , , 1 ) T , t h e n
    NCOWG ( N 1 , N 2 , , N n ) = min N j
  • If w j = 1 , w l = 0 , a n d j l , t h e n
    NCOWG ( N 1 , N 2 , , N n ) = N j
where N j is the jth largest of ( N 1 , N 2 , , N n ) .
Proof. 
Since in NCOWG the neutrosophic values are ordered in descending order. □

4.2. Neutrosophic Cubic Einstein Weighted Geometric Aggregation Operator

We define neutrosophic cubic Einstein geometric aggregation operators using Section 3.2.
Definition 23.
The neutrosophic cubic Einstein weighted geometric operator(NCEWA) is defined as
NCEWG : R m R , defined by N C E W G w ( N 1 , N 2 , , N m ) = j = 1 m ( N j E ) w j
where, W = ( w 1 , w 2 , , w m ) T is the weight of N j ( j = 1 , 2 , 3 , , m ) , such that w j [ 0 , 1 ] and w j j = 1 m = 1 .
That is, first all the neutrosophic values are weighted then aggregated using Einstein operations.
Definition 24.
Order neutrosophic cubic Einstein weighted geometric operator(NCEOWG) is defined as
NCEOWG : R m R   b y   N C E O W G w ( N 1 , N 2 , , N m ) = j = 1 m ( B j E ) w j
where B j is the j t h largest, W = ( w 1 , w 2 , , w m ) T is the weight of N j ( j = 1 , 2 , 3 , , m ) , such that w j [ 0 , 1 ] and w j j = 1 m = 1 .
That is, first all the neutrosophic values are ordered and then weighted, after ordering weighted values are aggregated using Einstein operations.The fundamental concept of ordered weighted operators is to rearrange the neutrosophic cubic values in descending order.
Theorem 6.
Let N j = ( T ˜ N j , I ˜ N j , F ˜ N j , T N j , I N j , F N j ) , where T ˜ N j = [ T N j L , T N j U ] , I ˜ N j = [ I N j L , I N j U ] , F ˜ N j = [ F N j L , F N j U ] , ( j = 1 , 2 , , m ) is a collection of neutrosophic cubic values, then their Einstein weighted geometric aggregated value by NCEWG operator is also a neutrosophic cubic value, and
N C E W G ( N j ) = ( [ 2 j = 1 m ( T N j L ) w j j = 1 m ( 2 T N j L ) w j + j = 1 m ( T N j L ) w j , 2 j = 1 m ( T N j U ) w j j = 1 m ( 2 T N j U ) w j + j = 1 m ( T N j U ) w j ] , [ 2 j = 1 m ( I N j L ) w j j = 1 m ( 2 I N j L ) w j + j = 1 m ( I N j L ) w j , 2 j = 1 m ( I N j U ) w j j = 1 m ( 2 I N j U ) w j + j = 1 m ( I N j U ) w j ] , [ j = 1 m ( 1 + F N j L ) w j j = 1 m ( 1 F N j L ) w j j = 1 m ( 1 + F N j L ) w j + j = 1 m ( 1 F N j L ) w j , j = 1 m ( 1 + F N j U ) w j j = 1 m ( 1 F N j U ) w j j = 1 m ( 1 + F N j U ) w j + j = 1 m ( 1 F N j U ) w j ] , j = 1 m ( 1 + T N j ) w j j = 1 m ( 1 T N j ) w j j = 1 m ( 1 + T N j ) w j + j = 1 m ( 1 T N j ) w j , j = 1 m ( 1 + I N j ) w j j = 1 m ( 1 I N j ) w j j = 1 m ( 1 + I N j ) w j + j = 1 m ( 1 I N j ) w j , 2 j = 1 m ( F N j ) w j j = 1 m ( 2 F N j ) w j + j = 1 m ( F N j ) w j )
where W = ( w 1 , w 2 , , w m ) T is the weight vector of N j ( j = 1 , 2 , 3 , , m ) , such that w j [ 0 , 1 ] and w j j = 1 m = 1 .
Proof. 
We use mathematical induction to prove this result, for m = 2 , using definition (Einstein sum and Einstein scalar multiplication).
( N 1 E ) w 1 = ( [ 2 ( T N 1 L ) w 1 ( 2 T N 1 L ) w 1 + T N 1 L , 2 ( T N 1 U ) w 1 ( 2 T N 1 U ) w 1 + T N 1 U ] , [ 2 ( I N 1 L ) w 1 ( 2 I N 1 L ) w 1 + I N 1 L , 2 ( I N 1 U ) w 1 ( 2 I N 1 U ) w 1 + I N 1 U ] , [ ( 1 + F N 1 L ) w 1 ( 1 F N 1 L ) w 1 ( 1 + F N 1 L ) w 1 + ( 1 F N 1 L ) w 1 , ( 1 + F N 1 U ) w 1 ( 1 F N 1 U ) w 1 ( 1 + F N 1 U ) w 1 + ( 1 F N 1 U ) w 1 ] , ( 1 + T N 1 ) w 1 ( 1 T N 1 ) w 1 ( 1 + T N 1 ) w 1 + ( 1 T N 1 ) w 1 , ( 1 + I N 1 ) w 1 ( 1 I N 1 ) w 1 ( 1 + I N 1 ) w 1 + ( 1 I N 1 ) w 1 , 2 ( F N 1 ) w 1 ( 2 F N 1 ) w 1 + F N 1 )
( N 2 E ) w 2 = ( [ 2 ( T N 2 L ) w 2 ( 2 T N 2 L ) w 2 + T N 2 L , 2 ( T N 2 U ) w 2 ( 2 T N 2 U ) w 2 + T N 2 U ] , [ 2 ( I N 2 L ) w 2 ( 2 I N 2 L ) w 2 + I N 2 L , 2 ( I N 2 U ) w 2 ( 2 I N 2 U ) w 2 + I N 2 U ] , [ ( 1 + F N 2 L ) w 2 ( 1 F N 2 L ) w 2 ( 1 + F N 2 L ) w 2 + ( 1 F N 2 L ) w 2 , ( 1 + F N 2 U ) w 2 ( 1 F N 2 U ) w 2 ( 1 + F N 2 U ) w 2 + ( 1 F N 2 U ) w 2 ] , ( 1 + T N 2 ) w 2 ( 1 T N 2 ) w 2 ( 1 + T N 2 ) w 2 + ( 1 T N 2 ) w 2 , ( 1 + I N 2 ) w 2 ( 1 I N 2 ) w 2 ( 1 + I N 2 ) w 2 + ( 1 I N 2 ) w 2 , 2 ( F N 2 ) w 2 ( 2 F N 2 ) w 2 + F N 2 )
j = 1 2 ( N j E ) w j = ( [ 2 j = 1 2 ( T N j L ) w j j = 1 2 ( 2 T N j L ) w j + j = 1 2 ( T N j L ) w j , 2 j = 1 2 ( T N j U ) w j j = 1 2 ( 2 T N j U ) w j + j = 1 2 ( T N j U ) w j ] , [ 2 j = 1 2 ( I N j L ) w j j = 1 2 ( 2 I N j L ) w j + j = 1 2 ( I N j L ) w j , 2 j = 1 2 ( I N j U ) w j j = 1 2 ( 2 I N j U ) w j + j = 1 2 ( I N j U ) w j ] , [ j = 1 2 ( 1 + F N j L ) w j j = 1 2 ( 1 F N j L ) w j j = 1 2 ( 1 + F N j L ) w j + j = 1 2 ( 1 F N j L ) w j , j = 1 2 ( 1 + F N j U ) w j j = 1 2 ( 1 F N j U ) w j j = 1 2 ( 1 + F N j U ) w j + j = 1 2 ( 1 F N j U ) w j ] , j = 1 2 ( 1 + T N j ) w j j = 1 2 ( 1 T N j ) w j j = 1 2 ( 1 + T N j ) w j + j = 1 2 ( 1 T N j ) w j , j = 1 2 ( 1 + I N j ) w j j = 1 2 ( 1 I N j ) w j j = 1 2 ( 1 + I N j ) w j + j = 1 2 ( 1 I N j ) w j , 2 j = 1 2 ( F N j ) w j j = 1 2 ( 2 F N j ) w j + j = 1 2 ( F N j ) w j )
for m = n
j = 1 n ( N j E ) w j = ( [ 2 j = 1 n ( T N j L ) w j j = 1 n ( 2 T N j L ) w j + j = 1 n ( T N j L ) w j , 2 j = 1 n ( T N j U ) w j j = 1 n ( 2 T N j U ) w j + j = 1 n ( T N j U ) w j ] , [ 2 j = 1 n ( I N j L ) w j j = 1 n ( 2 I N j L ) w j + j = 1 n ( I N j L ) w j , 2 j = 1 n ( I N j U ) w j j = 1 n ( 2 I N j U ) w j + j = 1 n ( I N j U ) w j ] , [ j = 1 n ( 1 + F N j L ) w j j = 1 n ( 1 F N j L ) w j j = 1 n ( 1 + F N j L ) w j + j = 1 n ( 1 F N j L ) w j , j = 1 n ( 1 + F N j U ) w j j = 1 n ( 1 F N j U ) w j j = 1 n ( 1 + F N j U ) w j + j = 1 n ( 1 F N j U ) w j ] , j = 1 n ( 1 + T N j ) w j j = 1 n ( 1 T N j ) w j j = 1 n ( 1 + T N j ) w j + j = 1 n ( 1 T N j ) w j , j = 1 n ( 1 + I N j ) w j j = 1 n ( 1 I N j ) w j j = 1 n ( 1 + I N j ) w j + j = 1 n ( 1 I N j ) w j , 2 j = 1 n ( F N j ) w j j = 1 n ( 2 F N j ) w j + j = 1 n ( F N j ) w j )
We prove the result holds for m = n + 1
a s ( N n + 1 E ) w n + 1 = ( [ 2 ( T N n + 1 L ) w n + 1 ( 2 T N n + 1 L ) w n + 1 + ( T N n + 1 L ) w n + 1 , 2 ( T N n + 1 U ) w n + 1 ( 2 T N n + 1 U ) w n + 1 + ( T N n + 1 U ) w n + 1 ] , [ 2 ( I N n + 1 L ) w n + 1 ( 2 I N n + 1 L ) w n + 1 + ( I N n + 1 L ) w n + 1 , 2 ( I N n + 1 U ) w n + 1 ( 2 I N n + 1 U ) w n + 1 + ( I N n + 1 U ) w n + 1 ] , [ ( 1 + F N n + 1 L ) w n + 1 ( 1 F N n + 1 L ) w n + 1 ( 1 + F N n + 1 L ) w n + 1 + ( 1 F N n + 1 L ) w n + 1 , ( 1 + F N n + 1 U ) w n + 1 ( 1 F N n + 1 U ) w n + 1 ( 1 + F N n + 1 U ) w n + 1 + ( 1 F N n + 1 U ) w n + 1 ] , ( 1 + T N n + 1 ) w n + 1 ( 1 T N n + 1 ) w n + 1 ( 1 + T N n + 1 ) w n + 1 + ( 1 T N n + 1 ) w n + 1 , ( 1 + I N n + 1 ) w n + 1 ( 1 I N n + 1 ) w n + 1 ( 1 + I N n + 1 ) w n + 1 + ( 1 I N n + 1 ) w n + 1 , 2 ( F N n + 1 ) w n + 1 ( 2 F N n + 1 ) w n + 1 + ( F N n + 1 ) w n + 1 )
s o j = 1 n ( N j E ) w j E ( N m + 1 E ) w m + 1 = ( [ 2 j = 1 n ( T N j L ) w j j = 1 n ( 2 T N j L ) w j + j = 1 n ( T N j L ) w j , 2 j = 1 n ( T N j U ) w j j = 1 n ( 2 T N j U ) w j + j = 1 n ( T N j U ) w j ] , [ 2 j = 1 n ( I N j L ) w j j = 1 n ( 2 I N j L ) w j + j = 1 n ( I N j L ) w j , 2 j = 1 n ( I N j U ) w j j = 1 n ( 2 I N j U ) w j + j = 1 n ( I N j U ) w j ] , [ j = 1 n ( 1 + F N j L ) w j j = 1 n ( 1 F N j L ) w j j = 1 n ( 1 + F N j L ) w j + j = 1 n ( 1 F N j L ) w j , j = 1 n ( 1 + F N j U ) w j j = 1 n ( 1 F N j U ) w j j = 1 n ( 1 + F N j U ) w j + j = 1 n ( 1 F N j U ) w j ] , j = 1 n ( 1 + T N j ) w j j = 1 n ( 1 T N j ) w j j = 1 n ( 1 + T N j ) w j + j = 1 n ( 1 T N j ) w j , j = 1 n ( 1 + I N j ) w j j = 1 n ( 1 I N j ) w j j = 1 n ( 1 + I N j ) w j + j = 1 n ( 1 I N j ) w j , 2 j = 1 n ( F N j ) w j j = 1 n ( 2 F N j ) w j + j = 1 n ( F N j ) w j ) E ( [ 2 ( T N n + 1 L ) w n + 1 ( 2 T N n + 1 L ) w n + 1 + ( T N n + 1 L ) w n + 1 , 2 ( T N n + 1 U ) w n + 1 ( 2 T N n + 1 U ) w n + 1 + ( T N n + 1 U ) w n + 1 ] , [ 2 ( I N n + 1 L ) w n + 1 ( 2 I N n + 1 L ) w n + 1 + ( I N n + 1 L ) w n + 1 , 2 ( I N n + 1 U ) w n + 1 ( 2 I N n + 1 U ) w n + 1 + ( I N n + 1 U ) w n + 1 ] , [ ( 1 + F N n + 1 L ) w n + 1 ( 1 F N n + 1 L ) w n + 1 ( 1 + F N n + 1 L ) w n + 1 + ( 1 F N n + 1 L ) w n + 1 , ( 1 + F N n + 1 U ) w n + 1 ( 1 F N n + 1 U ) w n + 1 ( 1 + F N n + 1 U ) w n + 1 + ( 1 F N n + 1 U ) w n + 1 ] , ( 1 + T N n + 1 ) w n + 1 ( 1 T N n + 1 ) w n + 1 ( 1 + T N n + 1 ) w n + 1 + ( 1 T N n + 1 ) w n + 1 , ( 1 + I N n + 1 ) w n + 1 ( 1 I N n + 1 ) w n + 1 ( 1 + I N n + 1 ) w n + 1 + ( 1 I N n + 1 ) w n + 1 , 2 ( F N n + 1 ) w n + 1 ( 2 F N n + 1 ) w n + 1 + ( F N n + 1 ) w n + 1 )
j = 1 n + 1 ( N j E ) w j = ( [ 2 j = 1 n + 1 ( T N j L ) w j j = 1 n + 1 ( 2 T N j L ) w j + j = 1 n + 1 ( T N j L ) w j , 2 j = 1 n + 1 ( T N j U ) w j j = 1 n + 1 ( 2 T N j U ) w j + j = 1 n + 1 ( T N j U ) w j ] , [ 2 j = 1 n + 1 ( I N j L ) w j j = 1 n + 1 ( 2 I N j L ) w j + j = 1 n + 1 ( I N j L ) w j , 2 j = 1 n + 1 ( I N j U ) w j j = 1 n + 1 ( 2 I N j U ) w j + j = 1 n + 1 ( I N j U ) w j ] , [ j = 1 n + 1 ( 1 + F N j L ) w j j = 1 n + 1 ( 1 F N j L ) w j j = 1 n + 1 ( 1 + F N j L ) w j + j = 1 n + 1 ( 1 F N j L ) w j , j = 1 n + 1 ( 1 + F N j U ) w j j = 1 n + 1 ( 1 F N j U ) w j j = 1 n + 1 ( 1 + F N j U ) w j + j = 1 n + 1 ( 1 F N j U ) w j ] , j = 1 n + 1 ( 1 + T N j ) w j j = 1 n + 1 ( 1 T N j ) w j j = 1 n + 1 ( 1 + T N j ) w j + j = 1 n + 1 ( 1 T N j ) w j , j = 1 n + 1 ( 1 + I N j ) w j j = 1 n + 1 ( 1 I N j ) w j j = 1 n + 1 ( 1 + I N j ) w j + j = 1 n + 1 ( 1 I N j ) w j , 2 j = 1 n + 1 ( F N j ) w j j = 1 n + 1 ( 2 F N j ) w j + j = 1 n + 1 ( F N j ) w j )
so result holds for all values of m . □
Theorem 7.
Let N j = ( T ˜ N j , I ˜ N j , F ˜ N j , T N j , I N j , F N j ) , where T ˜ N j = [ T N j L , T N j U ] , I ˜ N j = [ I N j L , I N j U ] , F ˜ N j = [ F N j L , F N j U ] , ( j = 1 , 2 , , m ) is a collection of neutrosophic cubic values and W = ( w 1 , w 2 , , w m ) T is a weight vector of N j ( j = 1 , 2 , 3 , , m ) , with w j [ 0 , 1 ] and w j j = 1 m = 1 .
  • Idempotency: If for all N j = ( T ˜ N j , I ˜ N j , F ˜ N j , T N j , I N j , F N j ) , where T ˜ N j = [ T N j L , T N j U ] , I ˜ N j = [ I N j L , I N j U ] , F ˜ N j = [ F N j L , F N j U ] , ( j = 1 , 2 , , m ) are equal, that is, N j = N for all k, then N C E W G w ( N 1 , N 2 , , N m ) = N
  • Monotonicity: Let B j = ( T ˜ B j , I ˜ B j , F ˜ B j , T B j , I B j , F B j ) , w h e r e   T ˜ B j = [ T B j L , T B j U ] , I ˜ B j = [ I B j L , I B j U ] , F ˜ B j = [ F B j L , F B j U ] ( j = 1 , 2 , , m ) be the collection of cubic values. If S B ( u ) S N ( u ) and B j ( u ) N j ( u )
    then NCW G w ( N 1 , N 2 , , N m ) N C W G w ( B 1 , B 2 , , B m )
  • Boundary: N N C W G w { ( N 1 ) T , ( N 2 ) T , , ( N m ) T } N + , where
    N = { min j T N j L , min j I N j L , 1 max j F N j L , min j T N j , min j I N j , 1 max j F N j L } , N + = { max j T N j U , max j I N j U , 1 min j F N j U , max j T N j , max j I N j , 1 min j F N j }
Proof. 
Followed by Theorem 2. □
Theorem 8.
Let N j = ( T ˜ N j , I ˜ N j , F ˜ N j , T N j , I N j , F N j ) , where T ˜ N j = [ T N j L , T N j U ] , I ˜ N j = [ I N j L , I N j U ] , F ˜ N j = [ F N j L , F N j U ] , ( j = 1 , 2 , , m ) be a collection of neutrosophic cubic values and W = ( w 1 , w 2 , , w m ) T is a weight vector of the NCOWA, with w j [ 0 , 1 ] and w j j = 1 m = 1 .
  • If w = ( 1 , 0 , , 0 ) T , then
    NCEOWG ( N 1 , N 2 , , N m ) = max N j
  • If w ( 0 , 0 , , 1 ) T , then
    NCEOWG ( N 1 , N 2 , , N m ) = min N j
  • If w j = 1 , w j = 0 , and j j , then
    NCEOWG ( N 1 , N 2 , , N m ) = N j
where N j is the jth largest of ( N 1 , N 2 , , N m ) .
Proof. 
Followed by Theorem 3. □

5. An Application of Neutrosophic cubic Geometric and Einstein Geometric Aggregation Operator to Group Decision Making Problems

Group decision making is an important factor of decision making theory. We are often in a situation with more then one expert, attribute and alternative to deal with. Motivated by such situations, a multi-attribute decision making method for more then one expert is proposed in this section.
In this section, we develop an algorithm for group decision making problems using the geometric and Einstein geometric aggregations (NCWG and NCEWG) under the neutrosophic cubic environment.
Algorithm. 
Let F = { F 1 , F 2 , , F n } be the set of n alternatives, H = { H 1 , H 2 , , H m } be the m attributes subject to their corresponding weight W = { w 1 , w 2 , , w m } such that w j [ 0 , 1 ] and j = 1 m w j = 1 , and D = { D 1 , D 2 ,... D r } be the r decision makers with their corresponding weight V = { v 1 , v 2 , , v r } . such that v j [ 0 , 1 ] and j = 1 r v j = 1 The method has the following steps:
Step1. First, we construct neutrosophic cubic decision matrices for each decision maker D ( s ) = [ N i j ( s ) ] n × m ( s = 1 , 2 , , r ) .
Step2. All decision matrices are aggregated to a single matrix consisting of m attributes, by NCWG and NCEWG corresponding to the weight assigned to the decision maker.
Step3. By using aggregation operators like NCWG and NCEWG, the decision matrix is aggregated by the weight assigned to the m attributes.
Step4. The n alternatives are ranked according to their scores and arranged in descending order to select the alternative with highest score.

6. Application

Mobile companies play a vital role in Pakistan’s stock market. The performance of these companies affects resources of capital market and have become a common concern of shareholders, government authorities, creditors and other stakeholders. In this example, an investor company wants to invest his capital levy in listed companies. They acquire two types of experts: Attorney and market maker. The attorney is acquired to look at the legal matters and the market maker is aquired to provide his expertise in capital market matters. Data are collected on the basis of stock market analysis and growth in different areas. Let the listed mobile companies be ( x 1 ) Zong, ( x 2 ) Jazz, ( x 3 ) Telenor and ( x 4 ) Ufone, which have higher ratios of earnings than the others available in the market, from the three alternatives of ( A 1 ) stock market trends, ( A 2 ) policy directions and ( A 3 ) the annual performance. The two experts evaluated the mobile companies ( x j , j = 1 , 2 , 3 , 4 ) with respect to the corresponding attributes ( A i , i = 1 , 2 , 3 ) , and proposed their decision making matrices consisting of neutrosophic cubic values in Equation (1) and Equation (2). The Equation (3) represents the single matrix as the aggregation of Equtiona1 and Equation (2) by NCWG or NCEWG. The Equation (4) is obtained by applying NCWG or NCEWG on attributes. The decision matrices are aggregated to a single decision matrix. At the end we rank the alternatives according to their score to get the desirable alternative(s).
Step 1. We construct the decision maker matrices in Equations (1) and (2).
Equation (1): Decision making matrix for the first expert(attorney) D a is
( A 1 A 2 A 3 X 1 ( [ 0.2 , 0.6 ] , [ 0.4 , 0.6 ] , [ 0.5 , 0.8 ] , 0.7 , 0.4 , 0.3 ) ( [ 0.1 , 0.4 ] , [ 0.5 , 0.8 ] , [ 0.4 , 0.8 ] , 0.6 , 0.7 , 0.5 ) ( [ 0.4 , 0.6 ] , [ 0.2 , 0.7 ] , [ 0.5 , 0.9 ] , 0.4 , 0.5 , 0.3 ) X 2 ( [ 0.3 , 0.5 ] , [ 0.6 , 0.9 ] , [ 0.3 , 0.6 ] , 0.3 , 0.6 , 0.7 ) ( [ 0.5 , 0.9 ] , [ 0.1 , 0.3 ] , [ 0.4 , 0.8 ] , 0.8 , 0.3 , 0.6 ) ( [ 0.2 , 0.7 ] , [ 0.1 , 0.6 ] , [ 0.4 , 0.7 ] , 0.5 , 0.4 , 0.7 ) X 3 ( [ 0.6 , 0.9 ] , [ 0.2 , 0.7 ] , [ 0.4 , 0.9 ] , 0.5 , 0.5 , 0.6 ) ( [ 0.2 , 0.6 ] , [ 0.7 , 0.3 ] , [ 0.3 , 0.8 ] , 0.4 , 0.6 , 0.5 ) ( [ 0.5 , 0.9 ] , [ 0.7 , 0.9 ] , [ 0.1 , 0.5 ] , 0.5 , 0.6 , 0.4 ) X 4 ( [ 0.4 , 0.8 ] , [ 0.5 , 0.9 ] , [ 0.3 , 0.8 ] , 0.5 , 0.8 , 0.5 ) ( [ 0.2 , 0.7 ] , [ 0.4 , 0.9 ] , [ 0.5 , 0.7 ] , 0.6 , 0.4 , 0.5 ) ( [ 0.3 , 0.5 ] , [ 0.5 , 0.9 ] , [ 0.7 , 0.3 ] , 0.3 , 0.3 , 0.8 ) )
Equation (2): Decision making matrix for the second expert(market maker) D m is
( A 1 A 2 A 3 X 1 ( [ 0.3 , 0.6 ] , [ 0.2 , 0.6 ] , [ 0.2 , 0.6 ] , 0.8 , 0.7 , 0.2 ) ( [ 0.3 , 0.8 ] , [ 0.4 , 0.8 ] , [ 0.3 , 0.8 ] , 0.6 , 0.7 , 0.4 ) ( [ 0.2 , 0.7 ] , [ 0.2 , 0.6 ] , [ 0.3 , 0.8 ] , 0.5 , 0.3 , 0.5 ) X 2 ( [ 0.2 , 0.5 ] , [ 0.6 , 0.9 ] , [ 0.7 , 0.3 ] , 0.4 , 0.8 , 0.7 ) ( [ 0.4 , 0.9 ] , [ 0.1 , 0.4 ] , [ 0.5 , 0.8 ] , 0.6 , 0.5 , 0.7 ) ( [ 0.4 , 0.9 ] , [ 0.1 , 0.4 ] , [ 0.5 , 0.8 ] , 0.6 , 0.5 , 0.7 ) X 3 ( [ 0.5 , 0.9 ] , [ 0.2 , 0.6 ] , [ 0.3 , 0.8 ] , 0.7 , 0.7 , 0.8 ) ( [ 0.2 , 0.5 ] , [ 0.2 , 0.7 ] , [ 0.5 , 0.8 ] , 0.6 , 0.7 , 0.2 ) ( [ 0.3 , 0.5 ] , [ 0.3 , 0.9 ] , [ 0.2 , 0.5 ] , 0.6 , 0.5 , 0.4 ) X 4 ( [ 0.3 , 0.5 ] , [ 0.3 , 0.9 ] , [ 0.2 , 0.5 ] , 0.6 , 0.5 , 0.4 ) ( [ 0.4 , 0.7 ] , [ 0.2 , 0.8 ] , [ 0.7 , 0.3 ] , 0.6 , 0.7 , 0.7 ) ( [ 0.2 , 0.6 ] , [ 0.5 , 0.9 ] , [ 0.2 , 0.8 ] , 0.4 , 0.4 , 0.8 ) )
Step2. Let W = ( 0.4 , 0.6 ) T , then the single matrix corresponding to weight W by use of NCWG operator is
Equation (3): The single decision matrix.
( A 1 A 2 A 3 X 1 ( [ 0.2551 , 0.6000 ] , [ 0.2885 , 0.6732 ] , [ 0.3371 , 0.6968 ] , 0.7647 , 0.6041 , 0.2352 ) ( [ 0.1933 , 0.6062 ] , [ 0.4430 , 0.8001 ] , [ 0.3418 , 0.8680 ] , 0.6000 , 0.7000 , 0.4772 ) ( [ 0.2638 , 0.6581 ] , [ 0.1999 , 0.6381 ] , [ 0.3881 , 0.8484 ] , 0.4621 , 0.3881 , 0.2223 ) X 2 ( [ 0.2352 , 0.5577 ] , [ 0.6000 , 0.9000 ] , [ 0.3000 , 0.6634 ] , 0.3618 , 0.7360 , 0.7000 ) ( [ 0.2352 , 0.5577 ] , [ 0.6000 , 0.9000 ] , [ 0.3000 , 0.6634 ] , 0.3618 , 0.7360 , 0.7000 ) ( [ 0.5253 , 0.8670 ] , [ 0.1515 , 0.6000 ] , [ 0.4621 , 0.8448 ] , 0.3371 , 0.4621 , 0.3301 ) X 3 ( [ 0.5378 , 0.9000 ] , [ 0.3565 , 0.8385 ] , [ 0.3418 , 0.8484 ] , 0.6319 , 0.6319 , 0.7130 ) ( [ 0.2000 , 0.5378 ] , [ 0.2352 , 0.7000 ] , [ 0.4279 , 0.8000 ] , 0.5295 , 0.6634 , 0.2885 ) ( [ 0.3680 , 0.6325 ] , [ 0.4210 , 0.9000 ] , [ 0.1614 , 0.5000 ] , 0.5626 , 0.5426 , 0.4000 ) X 4 ( [ 0.5101 , 0.8000 ] , [ 0.3465 , 0.6325 ] , [ 0.2416 , 0.7449 ] , 0.5000 , 0.6133 , 0.3807 ) ( [ 0.3031 , 0.7000 ] , [ 0.2639 , 0.8385 ] , [ 0.3881 , 0.7000 ] , 0.6000 , 0.6041 , 0.6118 ) ( [ 0.2352 , 0.5578 ] , [ 0.5000 , 0.9000 ] , [ 0.2416 , 0.7647 ] , 0.3618 , 0.3618 , 0.8000 ) )
Step3. Let the weight of attributes are W = { 0.35 , 0.30 , 0.35 } , using NCWG operators on attributes A’s we get Equation (4),
N C W G = ( X 1 ( [ 0.2375 , 0.6195 ] , [ 0.2885 , 0.7916 ] , [ 0.3567 , 0.8146 ] , 0.6315 , 0.5757 , 0.2851 ) X 2 ( [ 0.4426 , 0.7657 ] , [ 0.2165 , 0.5915 ] , [ 0.5382 , 0.7804 ] , 0.4827 , 0.5729 , 0.5282 ) X 3 ( [ 0.3500 , 0.6616 ] , [ 0.3335 , 0.8142 ] , [ 0.3131 , 0.7498 ] , 0.5791 , 0.6133 , 0.4439 ) X 4 ( [ 0.3327 , 0.6774 ] , [ 0.3630 , 0.7787 ] , [ 0.2888 , 0.7396 ] , 0.4906 , 0.5359 , 0.5692 ) )
Step4. Using the score function we rank the alternatives as:
S ( X 1 ) = 0.0321 , S ( X 2 ) = 0.0548 , S ( X 3 ) = 0.0839 and S ( X 4 ) = 0.0969 , X 3 > X 2 > X 1 > X 4
The most desirable alternative is X3.

7. Conclusions

Dealing with real life problems, decision makers encounter incomplete and vague data. The characteristics of neutrosophic cubic sets enablesdecision makers to deal with such a situation. Consequently, for each situation we defined the algebraic and Einstein sum, product and scalar multiplication. It is often difficult to compare two or more neutrosophic cubic values. The score and accuracy functions are defined to compare the neutrosophic cubic values values. Using these operations we defined neutrosophic cubic geometric, neutrosophic cubic weighted geometric, neutrosophic cubic Einstein geometric, and neutrosophic cubic Einstein weighted geometric aggregation operators with some useful properties. In the next section, a multi-criteria decision making algorithm was constructed. In the last section, a daily life problem was solved usingmulti-criteria decision making method (MCDM). This paper is based on some basic definitions and aggregation operators, which can be further extended to new horizons, like neutrosophic cubic hybrid geometric and neutrosophic cubic Einstein hybrid geometric aggregation operators.

Author Contributions

All authors contributed equally.

Acknowledgments

The 3rd author would like to thank the Deanship of Scientific Research at Majmaah University for supporting this work under Project Number 1440-52.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Zadeh, L.A. Fuzzy Sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef]
  2. Turksen, I.B. Interval valued strict preferences with Zadeh triplet. Fuzzy Sets Syst. 1996, 78, 183–195. [Google Scholar] [CrossRef]
  3. Zadeh, L.A. Outlines of new approach to the analysis of complex system and dicision procosses interval valued fuzzy sets. IEEE Trans. Syst. Man Cybernet. 1968, 1, 28–44. [Google Scholar]
  4. Atanassov, K.T. Intuitionistic fuzzy sets. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  5. Atanassov, K.T.; Gargov, G. Interval intuitionistic fuzzy sets. Fuzzy Sets Syst. 1989, 31, 343–349. [Google Scholar] [CrossRef]
  6. Jun, Y.B.; Kim, C.S.; Yang, K.O. Cubic sets. Ann. Fuzzy Math. Inform. 2012, 1, 83–98. [Google Scholar]
  7. Smarandache, F. A Unifying Field in Logics, Neutrosophic Logic, Neutrosophy, Neutrosophic Set and Neutrosophic Probabilty, 4th ed.; American Research Press: Rehoboth, DE, USA, 1999. [Google Scholar]
  8. Wang, H.; Smarandache, F.; Zhang, Y.Q.; Sunderraman, R. Interval neutrosophic sets and loics. In Theory and Application in Computing; Hexis: Phoenox, AZ, USA, 2005. [Google Scholar]
  9. Jun, Y.B.; Smarandache, F.; Kim, C.S. Neutrosophic cubic sets. New. Math. Nat. Comput. 2015, 13, 41–54. [Google Scholar] [CrossRef]
  10. Jun, Y.B.; Smarandache, F.; Kim, C.S. P-union and P-intersection of neutrosophic cubic sets. An. St. Univ. Ovidius Constanta 2017, 25, 99–115. [Google Scholar] [CrossRef]
  11. Zhan, J.; Khan, M.; Gulistan, M.; Ali, A. Applications of neutrosophic cubic sets in multi-criteria decision making. Int. J. Uncertain. Quabtif. 2017, 7, 377–394. [Google Scholar] [CrossRef]
  12. Banerjee, D.; Giri, B.C.; Pramanik, S.; Smarandache, F. GRA for multi attribute decision making in neutrosophic cubic set environment. Neutrosophic Sets Syst. 2017, 15, 64–73. [Google Scholar]
  13. Lu, Z.; Ye, J. Cosine measure for neutrosophic cubic sets for multiple attribte decision making. Symmetry 2017, 9, 121. [Google Scholar]
  14. Pramanik, S.; Dalapati, S.; Alam, S.; Roy, S.; Smarandache, F. Neutrosophic cubic MCGDM method based on similarity measure. Neutrosophic Sets Syst. 2017, 16, 44–56. [Google Scholar]
  15. Shi, L.; Ye, J. Dombi Aggregation Operators of Neutrosophic Cubic Set for Multiple Attribute Deicision Making. Algorithms 2018, 11, 29. [Google Scholar] [CrossRef]
  16. Li, B.; Wang, J.; Yang, L.; Li, X. A Novel Generalized Simplified Neutrosophic Number Einstein Aggregation Operator. Int. J. Appl. Math. 2018, 48, 67–72. [Google Scholar]
Table 1. Some notations with their descriptions.
Table 1. Some notations with their descriptions.
S. NoNotationDescription
1UGround set
2uElement of ground set (U).
3 ψ Fuzzy set
4 Ψ ˜ = [ Ψ L , Ψ U ] Interval valued fuzzy set which is an interval of [0,1]. The left extreme ψ L is referred as lower fuzzy and right extreme ψ U is referred as upper fuzzy function.
5 ( T N , I N , F N ) components of neutrosophic sets each one is fuzzy sets.
6 ( T ˜ N , I ˜ N , F ˜ N ) The components of interval neutrosophic each one is an interval valued fuzzy set.
7 ( T ˜ N , I ˜ N , F ˜ N , T N , I N , F N ) The components of neutrosophic cubic set. Referred to 5 and 6.
8 Γ * , Γ t-conorm, t-norm
9 , Algebraic sum, product
10 E , E Einstein sum, product

Share and Cite

MDPI and ACS Style

Khan, M.; Gulistan, M.; Yaqoob, N.; Khan, M.; Smarandache, F. Neutrosophic Cubic Einstein Geometric Aggregation Operators with Application to Multi-Criteria Decision Making Method. Symmetry 2019, 11, 247. https://doi.org/10.3390/sym11020247

AMA Style

Khan M, Gulistan M, Yaqoob N, Khan M, Smarandache F. Neutrosophic Cubic Einstein Geometric Aggregation Operators with Application to Multi-Criteria Decision Making Method. Symmetry. 2019; 11(2):247. https://doi.org/10.3390/sym11020247

Chicago/Turabian Style

Khan, Majid, Muhammad Gulistan, Naveed Yaqoob, Madad Khan, and Florentin Smarandache. 2019. "Neutrosophic Cubic Einstein Geometric Aggregation Operators with Application to Multi-Criteria Decision Making Method" Symmetry 11, no. 2: 247. https://doi.org/10.3390/sym11020247

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop