scieee AI-readable full text Open interactive document viewer

Eigen Neutrosophic Z- Set and Neutrosophic Z- Relation

P. Sheeba Maybell; M.M. Shanmugapriya

Full text

Neutrosophic Sets and Systems, Vol. 97, 2026 University of New Mexico P. Sheeba Maybell, M.M. Shanmugapriya, Eigen Neutrosophic ZSet and Neutrosophic ZRelation Eigen Neutrosophic ZSet and Neutrosophic ZRelation P. Sheeba Maybell1*, M.M. Shanmugapriya2 1 Department of Mathematics, Karpagam Academy of Higher Education, Coimbatore, Tamil Nadu, India; [email protected] 2 Dept. of Mathematics, Karpagam Academy of Higher Education, Coimbatore, Tamil Nadu, India; [email protected] * Correspondence: Seeba Maybell, Email: [email protected] Abstract: This paper introduces an innovative framework for computing the Greatest Eigen Neutrosophic Z-set and the Least Eigen Neutrosophic Z-set using the composition operators, namely max-min-min and min-max-max. The proposed Eigen Neutrosophic Z-set, along with the Neutrosophic Z-relation, remains constant across different computational perspectives. This study addresses the limitation of existing neutrosophic and fuzzy models that fail to effectively capture eigen-based relationships under uncertainty by introducing the Eigen Neutrosophic Z-set framework for more consistent and interpretable decision analysis. Furthermore, Neutrosophic Z-matrices are developed, and their properties are examined in relation to Neutrosophic Z-relations. In this paper several similarity relations among Neutrosophic Z-matrices are presented, along with discussions on their permutations and the invertibility characteristics. Two distinct algorithms are formulated to establish the Greatest Eigen Neutrosophic Z-set and the Least Eigen Neutrosophic Z-set, accompanied by a numerical example. Additionally, a practical application is provided to demonstrate the enhancement of score value while addressing both effectiveness and uncertainty for future advancements of hotel management decision-making systems. Keywords: Neutrosophic Z-set, Neutrosophic Z-relation, Neutrosophic Z-Matrices, Eigen Neutrosophic Z-set, Composition operators, Decision-making uncertainty modelling. 1. Introduction Zadeh [ 1] proposed a notion namely Z-number, which is an ordered pair of fuzzy numbers 𝑍= (π‘‰ο˜,π‘…ο˜) in 2011.The reliability and restriction of fuzzy is mainly focused in Z-number [2]. Smarandache [3] introduced another concept of imprecise data called Neutrosophic data which deals with complicating aspects to process imprecision, vagueness, and uncertainty in data. Sanjib Mondal et.al., [4] developed similarity relations for Intuitionistic fuzzy matrices. Neutrosophic set was later developed to Quadri partitioned neutrosophic soft set, fuzzy neutrosophic soft matrices and fuzzy Quadri partitioned neutrosophic soft matrix [5, 6, 7] which was more useful in decision making. Neutrosophic qualities and neutrosophic metrics to assess trustworthiness are united in the neutrosophic z-number set technique proposed by Shigui Du et al. [8] as a generalization of the znumbers and the neutrosophic set. The three ordered pairs of neutrosophic numbers along with their reliability measures in indeterminate and inconsistent situations can be resolved by the suggested neutrosophic z-number set [9]. In z-numbers and their set, the multi criteria decision-making technique (MCDM) is readily embraced [10, 11, 12] later on MCDM developed to neutrosophic znumbers. A fuzzy relations eigen fuzzy set was presented by Sanchez [13]. He provided three main algorithms to find the Greatest Eigen Fuzzy Set (GEFS) linked with fuzzy relations using max-min Neutrosophic Sets and Systems, Vol. 97, 2026 688 P. Sheeba Maybell, M.M. Shanmugapriya, Eigen Neutrosophic ZSet and Neutrosophic ZRelation composition so that π‘…βˆ˜A=A. Eigen fuzzy sets have been successfully used in a number of real-world applications in decision-making, genetic algorithms, image analysis, and medicine. Guleria and Bajaj [14] later proposed eigen spherical fuzzy sets and applications. Using spherical fuzzy set, they have produced an astounding achievement by identifying two distinct techniques for finding eigen spherical fuzzy sets. Further T-spherical fuzzy set for similarity measure also found for decisionmaking [15]. Harikrishnan et al. [16] in their work min-max compositions for neutrosophic fuzzy matrices was demonstrated their application in diagnosing diseases. Their work shows that changing composition operators alters diagnostic outcomes, but they do not address eigen-based stability or Z-relations. But this shows the importance of composition operators but lacks information about eigen Z-set theory. Kamran et al. [17] examined the use of neutrosophic Z-numbers in AHP-based prioritization and Z-rough structures for ranking alternatives under uncertainty. Although Znumbers provide richer representation of uncertainty, this work does not define eigen Z-sets or algorithms for stable relation evaluation. This work has a strong Z-number background but doesn’t focus on similarity or eigen properties. Mishra & Kumar [18] investigated algebraic properties of neutrosophic matrices, including invertibility and determinants for decision-oriented systems. Their theoretical work addresses classical neutrosophic matrices but does not extend these results to neutrosophic Z-matrices or eigen computations. This work doesn’t involve the Z-matrix framework; only the foundation of matrix algebra is used for analysis. Al-Faifi et al. [19] applied neutrosophic and plithogenic models to multi-criteria decisionmaking for uncertain preference structures. While they improve decision accuracy, they rely on distance and score measures and do not consider eigen-based consistency. Saha & Abdel-Basset et al. [20] explored spectral measures such as the β€œenergy” of neutrosophic matrices for network analysis and clustering. Their results demonstrate the usefulness of spectral neutrosophic properties, but they do not propose algorithms for greatest/least eigen Z-sets or Zrelations. The Z-set definition and the composition stability are missing. 2. Research Gap The Eigen fuzzy set was introduced by Sanchez [13], along with the concept of fuzzy relations. This method established the Greatest Eigen Fuzzy Set using the max-min composition method. Numerous researchers have applied this max-min composition for image retrieval, genetic algorithms, and in the medicinal field. Subsequently, the Eigen Spherical Fuzzy Set was introduced by Guleria and Bajaj [14]. They offered two techniques for identifying the Greatest Eigen Spherical Fuzzy Set and the Least Eigen Spherical Fuzzy Set. The Neutrosophic Z-set is a novel method used to assess uncertainty in real-life scenarios. We have proposed a new composition operator for the Neutrosophic Z-set along with its Neutrosophic Z-relation. Many researchers have extensively explored Neutrosophic Fuzzy matrices, their relations, and similarity measures. Our study is significant because we extended similarity relations for Neutrosophic fuzzy matrices to Neutrosophic Z-matrices. 3. Contribution of this proposed work β€’ Introduction of new composition operator for neutrosophic z-set: Two distinct composition operators for neutrosophic z-sets,specifically max-min-min and min-max-max, have been developed alongside the concept of neutrosophic z-relation. These composition operators identify the Greatest Eigen Neutrosophic Z-sets (GENZS) and the Least Eigen Neutrosophic Zsets (LENZS), which are tailored to yield suitable values in situations of uncertainty. β€’ Neutrosophic Z-relation for Neutrosophic Z-matrices: A Neutrosophic Z-matrix has been introduced together with the Neutrosophic Z-relation. Various properties of similarity relations Neutrosophic Sets and Systems, Vol. 97, 2026 689 P. Sheeba Maybell, M.M. Shanmugapriya, Eigen Neutrosophic ZSet and Neutrosophic ZRelation were examined, offering a foundational framework for Neutrosophic Z-matrices, with potential for further advancements through these matrices. β€’ Algorithm for strategy finding: This proposed work introduced two algorithms for each composition operator within the framework of Neutrosophic Z-sets. The primary objective of these algorithms is to determine the eigen neutrosophic z-set. β€’ Numerical Example and Application: The efficacy of the proposed method is illustrated using a numerical example. Effectiveness and uncertainty are assessed in a real-world setting. The decision-making scenario provides an in-depth comprehension regarding the methods feasibility and adaptability. Table 1, depicts the comparison of the existing works in neutrosophic Z numbers and fuzzy matrices with the proposed work Eigen Neutrosophic Z set. Table 1 Comparison of existing and proposed work Dimension Existing Works (Neutrosophic, Z-numbers, Fuzzy matrices) Proposed Work Handling of uncertainty Uses truth, indeterminacy, falsity values; Z-numbers add reliability but no eigen characterization Introduces Eigen Neutrosophic Z-set to measure stable relation values under uncertainty Composition operators Studies max–min / min–max families separately Demonstrates both max–min–min and min–max–max operators and proves eigen-set consistency across compositions Matrix framework Classical neutrosophic matrices used for similarity or scoring It defines Neutrosophic Z-matrices, explores invertibility, permutations, similarity relations Eigen-based analysis Mostly absent; spectral analysis exists but not for Zrelations Provides algorithms for Greatest and Least Eigen Neutrosophic Z-sets with numerical examples Practical decisionmaking Score or distance-based ranking Uses eigen Z-sets to enhance score and interpretability in hotel management decision-making Reproducibility Often conceptual or qualitative Delivers two algorithms, operator consistency proof, and implementation steps The paper is organized as follows: Key definitions and concepts are examined in Section 3. Neutrosophic Z-matrices, Neutrosophic Z-relations, invertibility requirements, and similarity relations are introduced in Section 4. NZM idempotent is also taken for consideration in this part. Numerous characteristics and findings pertaining to neutrosophic Z-matrices are examined. The composition operator and the Neutrosophic Z-relation are defined in Section 5. The notions of the Neutrosophic Sets and Systems, Vol. 97, 2026 690 P. Sheeba Maybell, M.M. Shanmugapriya, Eigen Neutrosophic ZSet and Neutrosophic ZRelation Least Eigen Neutrosophic Z-sets (LENZS) and the Greatest Eigen Neutrosophic Z-sets (GENZS) are presented in this study along with an algorithm. The principles of GENZS and LENZS are explained with the use of a numerical example. We show how the suggested technique can be used in practical situations in Section 6. In Section 7 the work is concluded and future research directions are discussed. 3 Preliminaries 3.1 Definition Let X be a universe set then a Neutrosophic Z-number set (NZNs) in a universe set X is defined in the following as 𝑆𝑍=(<x,T(V,R)(x),I(V,R)(x),F(V,R)(x)>π‘₯∈X) (1) here T(V,R)(x)=(𝑇𝑉(x),𝑇𝑅(x)) ,I(V,R)(x)=(𝐼𝑉(x),𝐼𝑅(x)),F (V,R)(x)=(𝐹𝑉(x),𝐹𝑅(x)):Xβ†’[0,1]2 (2) are the order pairs of neutrosophic values for truthfulness, indeterminacy, and falsehood; the first component consists of the neutrosophic values in a universe set X, and the second component consists of neutrosophic reliability measures, with the rule of 0≀𝑇𝑉(x)+ 𝐼𝑉(x)+𝐹𝑉(x)≀3 and 0≀𝑇𝑅(x)+ 𝐼𝑅(x)+𝐹𝑅(x)≀3 (3) 3.2 Definition Let X be a universe set and F be a set of parameters. Consider a nonempty set 𝑆𝑍, 𝑆𝑍 ∈𝐹. Let P(X) be the collection of all neutrosophic znumber sets of X. The set (E, 𝑆𝑍 ) be termed as neutrosophic znumber sets (NZNs) over X, where 𝐸∢ 𝑆𝑍→𝑃(𝑋). Consider S as neutrosophic z-matrices (NZMs) over X instead of (E, 𝑆𝑍). 3.3 Definition Let 𝑆𝐴 be a π‘π‘π‘€π‘šΓ—π‘› and 𝑆𝐡 be a 𝑁𝑍𝑀𝑛×𝑝 then the composition of 𝑆𝐴 and 𝑆𝐡 is defined as π‘†π΄βˆ˜π‘†π΅=(<(βˆ‘(π‘‡π‘‰π‘–π‘˜ 𝐴∧ π‘‡π‘‰π‘˜π‘— 𝐡) 𝑛 𝑖=1 ,(βˆ‘(π‘‡π‘…π‘–π‘˜ π΄βˆ§π‘‡π‘…π‘˜π‘— 𝐡)),(∏(πΌπ‘‰π‘–π‘˜ 𝐴∨ πΌπ‘‰π‘˜π‘— 𝐡)) 𝑛 𝑖=1 , 𝑛 𝑖=1 ( ∏(πΌπ‘…π‘–π‘˜ 𝐴 βˆ¨πΌπ‘…π‘˜π‘— 𝐡)) 𝑛 𝑖=1 ,( ∏(πΉπ‘‰π‘–π‘˜ 𝐴 βˆ¨πΉπ‘‰π‘˜π‘— 𝐡)),( 𝑛 𝑖=1 ∏(πΉπ‘…π‘–π‘˜ π΄βˆ¨πΉπ‘…π‘˜π‘— 𝐡)) 𝑛 𝑖=1 >) (4) Equivalently it can be written as π‘†π΄βˆ˜π‘†π΅=(<(⋃(π‘‡π‘‰π‘–π‘˜ 𝐴∧ π‘‡π‘‰π‘˜π‘— 𝐡)), 𝑛 𝑖=1 (⋃(π‘‡π‘…π‘–π‘˜ π΄βˆ§π‘‡π‘…π‘˜π‘— 𝐡)) 𝑛 𝑖=1 ,(β‹€(πΌπ‘‰π‘–π‘˜ 𝐴∨ πΌπ‘‰π‘˜π‘— 𝐡)), 𝑛 𝑖=1 (β‹€(πΌπ‘…π‘–π‘˜ π΄βˆ¨πΌπ‘…π‘˜π‘— 𝐡)), 𝑛 𝑖=1 (β‹€(πΉπ‘‰π‘–π‘˜ 𝐴 βˆ¨πΉπ‘‰π‘˜π‘— 𝐡)), 𝑛 𝑖=1 (β‹€(πΉπ‘…π‘–π‘˜ π΄βˆ¨πΉπ‘…π‘˜π‘— 𝐡))>) 𝑛 𝑖=1 (5) Neutrosophic Sets and Systems, Vol. 97, 2026 691 P. Sheeba Maybell, M.M. Shanmugapriya, Eigen Neutrosophic ZSet and Neutrosophic ZRelation If the number of 𝑆𝐴 columns equal the number of rows 𝑆𝐡, then the product is defined. This multiplication procedure is called as max-min composition operator. Consequently, π‘†π΄βˆ˜π‘†π΅ and are considered conformable for multiplication, rather than using π‘†π΄βˆ˜π‘†π΅ it is denoted as 𝑆𝐴𝑆𝐡, where βˆ‘(π‘‡π‘‰π‘–π‘˜ 𝐴∧ π‘‡π‘‰π‘˜π‘— 𝐡) 𝑛 𝑖=1 means maxmin operation and ∏(πΌπ‘‰π‘–π‘˜ 𝐴∨ πΌπ‘‰π‘˜π‘— 𝐡)) 𝑛 𝑖=1 means min-max operation. 4 Neutrosophic Z-relation 4.1 Definition Let 𝐻(𝐴,𝐴) be an Neutrosophic Z-relation (NZR) on a set 𝑆𝐴. Let 𝑇𝑉,𝑅:𝑆𝐴 ⟢[0,1]2, 𝐼𝑉,𝑅:𝑆𝐴 ⟢ [0,1]2,π‘Žπ‘›π‘‘ 𝐹𝑉,𝑅:𝑆𝐴 ⟢[0,1]2are the three membership function and 𝑀𝐻 be the corresponding Neutrosophic ZMatrices (NZM) in relation H. 4.2 Definition The relation 𝐻(𝐴,𝐴)is reflexive if the diagonal entries of 𝑀𝐻 is [<(1,1),(0,0),(0,0)>]where 𝑇(𝑉,𝑅)𝐻(π‘₯,π‘₯)=(1,1), 𝐼(𝑉,𝑅)𝐻(π‘₯,π‘₯)=(0,0) and 𝐹(𝑉,𝑅)𝐻(π‘₯,π‘₯)=(0,0) for all π‘₯ ∈ 𝑆𝐴 . 4.3 Definition The relation 𝐻(𝐴,𝐴)is symmetric if 𝑀𝐻=𝑀𝐻 𝑇where 𝑀𝐻 𝑇is the transpose of 𝑀𝐻 such that 𝑇(𝑉,𝑅)𝐻(π‘₯,𝑦)=𝑇(𝑉,𝑅)𝐻(𝑦,π‘₯), 𝐼(𝑉,𝑅)𝐻(π‘₯,𝑦)=𝐼(𝑉,𝑅)𝐻(𝑦,π‘₯) and 𝐹(𝑉,𝑅)𝐻(π‘₯,𝑦)=𝐹(𝑉,𝑅)𝐻(𝑦,π‘₯) for all π‘₯,𝑦 ∈ 𝑆𝐴 . 4.4 Definition The relation 𝐻(𝐴,𝐴) is transitive if 𝑀𝐻β‰₯𝑀𝐻 2 i.e., 𝑇(𝑉,𝑅)𝐻(π‘₯,𝑧)β‰₯max (min ((𝑇(𝑉,𝑅)𝐻(𝑦,π‘₯),𝑇(𝑉,𝑅)𝐻(𝑦,𝑧))), 𝐼(𝑉,𝑅)𝐻(π‘₯,𝑧)≀min (max ((𝐼(𝑉,𝑅)𝐻(𝑦,π‘₯),𝐼(𝑉,𝑅)𝐻(𝑦,𝑧))) and 𝐹(𝑉,𝑅)𝐻(π‘₯,𝑧)≀min (max((𝐹(𝑉,𝑅)𝐻(𝑦,π‘₯),𝐹(𝑉,𝑅)𝐻(𝑦,𝑧))) for all pair(π‘₯,𝑧)βˆˆπ‘†π΄Γ—π‘†π΄. 4.5 Definition Let 𝐻(𝐴,𝐴) relation is reflexive, symmetric and transitive then 𝐻(𝐴,𝐴) relation is called as similarity relation. 4.6 Proposition For any π‘†π΄βˆˆπ‘π‘π‘€π‘›Γ—π‘›, 𝑆𝐴 is reflexive if 𝑆𝐴β‰₯𝐼𝑛 . proof Sinc 𝑆𝐴β‰₯𝐼𝑛, then matrix entries which is diagonal of 𝑆𝐴 are [<(1,1),(0,0),(0,0)>].  𝑆𝐴 is a reflexive matrix. Hence the proof. 4.7 Definition For an π‘†π΄βˆˆπ‘π‘π‘€π‘›Γ—π‘› , we define Neutrosophic Sets and Systems, Vol. 97, 2026 692 P. Sheeba Maybell, M.M. Shanmugapriya, Eigen Neutrosophic ZSet and Neutrosophic ZRelation β€’ 𝑆𝐴 is Reflexive if 𝑆𝐴β‰₯𝐼𝑛 β€’ 𝑆𝐴 is Weekly reflexive if 𝑆𝐴β‰₯𝑆𝐴 β€’ 𝑆𝐴 is Symmetric 𝑆𝐴=𝑆𝐴𝑇 β€’ 𝑆𝐴 is Idempotent 𝑆𝐴=𝑆𝐴2 β€’ 𝑆𝐴 is Transitive 𝑆𝐴2≀𝑆𝐴 4.8 Proposition Let π‘†π΄βˆˆπ‘π‘π‘€π‘›Γ—π‘› be a reflexive of NZM. Then I. 𝑆𝐴𝑇 is reflexive NZM, where𝑆𝐴𝑇 is transpose of 𝑆𝐴. II. 𝑆𝐴𝐾 is reflexive NZM for positive integer k. III. 𝑆𝐴𝑆𝐡 β‰₯ 𝑆𝐡 for π‘†π΅βˆˆπ‘π‘π‘€π‘›Γ—π‘› IV. 𝑆𝐡𝑆𝐴 β‰₯ 𝑆𝐡 for π‘†π΅βˆˆπ‘π‘π‘€π‘›Γ—π‘› V. 𝑆𝐴𝑆𝐡 and 𝑆𝐡𝑆𝐴 are reflexive NZMs if 𝑆𝐡 is reflexive VI. 𝑆𝐴𝑆𝐴𝑇 and 𝑆𝐴𝑇𝑆𝐴 are reflexive NZMs. Proof: I. Since 𝑆𝐴 has reflexive properties only when its diagonal entries are [<(1,1),(0,0),(0,0)>]. Hence 𝑆𝐴𝑇 is reflexive. II. Since 𝑆𝐴 is reflexive, 𝑆𝐴β‰₯𝐼𝑛 then 𝑆𝐴2β‰₯𝑆𝐴β‰₯𝐼𝑛 (multiplying on both sides). Proceeding for (k-1) times we get π‘†π΄π‘˜β‰₯ π‘†π΄π‘˜βˆ’1β‰₯⋯…..β‰₯𝑆𝐴2β‰₯𝑆𝐴 β‰₯𝐼𝑛. The result holds for any scalar k. then π‘†π΄π‘˜ is reflexive. III. 𝑆𝐴β‰₯𝐼𝑛 then, 𝑆𝐴𝑆𝐡β‰₯𝐼𝑛𝑆𝐡 ⇒𝑆𝐴𝑆𝐡β‰₯𝑆𝐡 IV. 𝑆𝐴β‰₯𝐼𝑛 then, 𝑆𝐡𝑆𝐴β‰₯𝐼𝑛𝑆𝐡 ⇒𝑆𝐡𝑆𝐴β‰₯𝑆𝐡 V. Since 𝑆𝐡 is reflexive 𝑆𝐡β‰₯𝐼𝑛 then 𝑆𝐴𝑆𝐡β‰₯𝑆𝐡β‰₯ 𝐼𝑛 and 𝑆𝐡𝑆𝐴β‰₯𝑆𝐡β‰₯ 𝐼𝑛 from (III) and (IV). Hence 𝑆𝐴𝑆𝐡 and 𝑆𝐡𝑆𝐴 are reflexive. VI. Using (I) in (V) replace 𝑆𝐴𝑇 in the place of 𝑆𝐡 we derive the desire result. Hence the proof 4.9 Proposition If π‘†π΄βˆˆπ‘π‘π‘€π‘›Γ—π‘› be transitive and also it is reflexive then 𝑆𝐴 is idempotent. Proof: It is known that 𝑆𝐴 is reflexive, 𝑆𝐴β‰₯𝐼𝑛 𝑆𝐴2β‰₯𝑆𝐴β‰₯𝐼𝑛 (6) Also, 𝑆𝐴 is transitive 𝑆𝐴2≀𝑆𝐴 (7) Combining (6) & (7) 𝑆𝐴2= 𝑆𝐴 Neutrosophic Sets and Systems, Vol. 97, 2026 693 P. Sheeba Maybell, M.M. Shanmugapriya, Eigen Neutrosophic ZSet and Neutrosophic ZRelation Hence 𝑆𝐴 is idempotent Note: Converse is not true. Example Let 𝑆𝐴 = [<(0.8,0.3),(0.3,0.4),(0.4,0.4)> <(0.8,0.3),(0.3,0.4),(0.4,0.4)> <(0.5,0.3),(0.3,0.4),(0.4,0.4)> <(0.8,0.3),(0.3,0.4),(0.4,0.4)>] I2 Hence 𝑆𝐴 is not reflexive, But 𝑆𝐴2=𝑆𝐴𝑆𝐴 (max-min) = [<(0.8,0.3),(0.3,0.4),(0.4,0.4)> <(0.8,0.3),(0.3,0.4),(0.4,0.4)> <(0.5,0.3),(0.3,0.4),(0.4,0.4)> <(0.8,0.3),(0.3,0.4),(0.4,0.4)>] = 𝑆𝐴 𝑆𝐴 is idempotent but not reflexive 4.10 Proposition If 𝑆𝐴 and 𝑆𝐡 are two symmetric NZMs of order n x n such that 𝑆𝐴𝑆𝐡= 𝑆𝐡𝑆𝐴, then 𝑆𝐴𝑆𝐡 is symmetric NZM. It can be proved easily Note: If 𝑆𝐴 is symmetric in 𝑁𝑍𝑀𝑛×𝑛 then 𝑆𝐴𝐾 is also symmetric for any scalar k. 4.11 Proposition Let 𝑆𝐴 , 𝑆𝐡 βˆˆπ‘π‘π‘€π‘›Γ—π‘› is transitive, such that 𝑆𝐴𝑆𝐡= 𝑆𝐡𝑆𝐴 , then 𝑆𝐴 𝑆𝐡 will be transitive. Proof We know 𝑆𝐴 and 𝑆𝐡 both transitive 𝑆𝐴2≀𝑆𝐴 and 𝑆𝐡2≀𝑆𝐡. Now (𝑆𝐴𝑆𝐡)2=(𝑆𝐴𝑆𝐡)(𝑆𝐴𝑆𝐡) =𝑆𝐴(𝑆𝐡𝑆𝐴)𝑆𝐡 =𝑆𝐴(𝑆𝐴𝑆𝐡)𝑆𝐡 =(𝑆𝐴𝑆𝐴)(𝑆𝐡𝑆𝐡) =𝑆𝐴2𝑆𝐡2 β‡’(𝑆𝐴𝑆𝐡)2≀𝑆𝐴𝑆𝐡 hence 𝑆𝐴𝑆𝐡 is transitive. Note: If 𝑆𝐴 is transitive in 𝑁𝑍𝑀𝑛×𝑛 then π‘†π΄π‘˜ is also transitive for any scalar k. 4.12 Proposition: Neutrosophic Sets and Systems, Vol. 97, 2026 694 P. Sheeba Maybell, M.M. Shanmugapriya, Eigen Neutrosophic ZSet and Neutrosophic ZRelation If 𝑆𝐴=[π‘†π΄π‘π‘ž]=[<(π‘‡π‘‰π‘π‘ž 𝐴,π‘‡π‘…π‘π‘ž 𝐴),(πΌπ‘‰π‘π‘ž 𝐴,πΌπ‘…π‘π‘ž 𝐴),(πΉπ‘‰π‘π‘ž 𝐴,πΉπ‘…π‘π‘ž 𝐴)>] βˆˆπ‘π‘π‘€π‘›Γ—π‘› is symmetric and transitive then π‘†π΄π‘π‘ž ≀ 𝑆𝐴𝑝𝑝 for p,q ∈ { 1,2, 3………n}. Proof Let 𝑆𝐴 is symmetric, π‘†π΄π‘π‘ž = π‘†π΄π‘žπ‘for all p, q ∈ {1,2, 3………n} Also, since 𝑆𝐴 is transitive 𝑆𝐴2β‰€π‘†π΄βŸΉπ‘†π΄β‰₯ 𝑆𝐴2 Thus π‘†π΄π‘π‘ž β‰₯ π‘šπ‘Žπ‘₯⏟ π‘Ÿ [min(π‘†π΄π‘π‘Ÿ,π‘†π΄π‘Ÿπ‘—)] for p= q and r ∈ {1,2, 3………n} π‘†π΄π‘π‘ž β‰₯ π‘šπ‘Žπ‘₯⏟ π‘Ÿ [min(π‘†π΄π‘π‘Ÿ,π‘†π΄π‘Ÿπ‘ž)] for p= q and r ∈ {1,2, 3………n} β‰₯ min(π‘†π΄π‘π‘Ÿ,π‘†π΄π‘Ÿπ‘ž) for r=q and each p 𝑆𝐴𝑝𝑝 β‰₯ π‘†π΄π‘π‘ž (since π‘†π΄π‘π‘ž = π‘†π΄π‘žπ‘) Hence proved. 4.13 Definition Let 𝑆𝐴 βˆˆπ‘π‘π‘€π‘› and 𝑆𝐡 is said to be invertible if and only if there exist 𝑆𝐡 βˆˆπ‘π‘π‘€π‘› such that 𝑆𝐴𝑆𝐡= 𝑆𝐡𝑆𝐴=𝐼𝑛 . 4.14 Definition An 𝑆𝐴 βˆˆπ‘π‘π‘€π‘› is called Neutrosophic Z-Permutation matrix (NZPM) if both row and column contains exactly one entry I and all other entries are  . 4.15 Proposition If 𝑆𝐴 be a 𝑁𝑍𝑀𝑛 of an NZPM then 𝑆𝐴𝑆𝐴𝑇= 𝑆𝐴𝑇𝑆𝐴=𝐼𝑛 Proof: 𝑆𝐴=(<(𝑇𝑉𝑖𝑗 𝐴,𝑇𝑅𝑖𝑗 𝐴),(𝐼𝑉𝑖𝑗 𝐴,𝐼𝑅𝑖𝑗 𝐴),(𝐹𝑉𝑖𝑗 𝐴,𝐹𝑅𝑖𝑗 𝐴)>) Then 𝑆𝐴𝑇=(<(𝑇𝑉𝑗𝑖 𝐴,𝑇𝑅𝑗𝑖 𝐴),(𝐼𝑉𝑗𝑖 𝐴,𝐼𝑅𝑗𝑖 𝐴),(𝐹𝑉𝑗𝑖 𝐴,𝐹𝑅𝑗𝑖 𝐴)>) now, i, jth entries of 𝑆𝐴𝑆𝐴𝑇 is βˆ‘π‘†π΄π‘–π‘˜π‘†π΅π‘˜π‘— 𝑛 π‘˜=1 = βˆ‘π‘†π΄π‘–π‘˜π‘†π΄π‘˜π‘— 𝑛 π‘˜=1 ={ 𝑖𝑓 𝑖≠𝑗 𝐼 𝑖𝑓 𝑖=𝑗 Neutrosophic Sets and Systems, Vol. 97, 2026 695 P. Sheeba Maybell, M.M. Shanmugapriya, Eigen Neutrosophic ZSet and Neutrosophic ZRelation (since 𝑆𝐴𝑆𝐡 is NZPM, βˆ‘π‘†π΄π‘–π‘˜π‘†π΄π‘–π‘˜ 𝑛 π‘˜=1 =𝐼 ) Hence 𝑆𝐴𝑆𝐴𝑇 is an 𝐼𝑛. converse can be proved easily. Hence the proof. 4.19 Proposition Let 𝑆𝐴 be a NZMn, 𝑆𝐴 is invertible if and only if 𝑆𝐴 is an NZPM. Proof: First part: 𝑆𝐴𝑆𝐴𝑇= 𝑆𝐴𝑇𝑆𝐴=𝐼𝑛 (by previous proposition) hence 𝑆𝐴 is invertible and 𝑆𝐴𝑇 is the inverse of 𝑆𝐴 (i.e) π‘†π΄βˆ’=𝑆𝐴𝑇 Second part: Let 𝑆𝐴 be invertible and 𝑆𝐡 be the inverse of 𝑆𝐴. Thus 𝑆𝐴𝑆𝐡= 𝑆𝐡𝑆𝐴=𝐼𝑛 follows that βˆ‘π‘†π΄π‘π‘Ÿπ‘†π΅π‘Ÿπ‘ž 𝑛 π‘˜=1 = βˆ‘π‘†π΅π‘π‘Ÿπ‘†π΄π‘Ÿπ‘ž 𝑛 π‘˜=1 = for pβ‰ q βˆ‘π‘†π΄π‘π‘Ÿπ‘†π΅π‘Ÿπ‘ž 𝑛 π‘˜=1 = βˆ‘π‘†π΅π‘π‘Ÿπ‘†π΄π‘Ÿπ‘ 𝑛 π‘˜=1 =𝐼 π‘†π΄π‘π‘žπ‘†π΅π‘žπ‘Ÿ=π‘†π΅π‘π‘Ÿπ‘†π΄π‘Ÿπ‘ž = for pβ‰ q and r οƒŽ{1,2,…..n} (8) π‘†π΄π‘π‘Ÿπ‘†π΅π‘Ÿπ‘ =π‘†π΅π‘π‘Ÿπ‘†π΄π‘Ÿπ‘ =𝐼 for atleast one r οƒŽ{1,2,…..n} and for each p οƒŽ{1,2,…..n} (9) From (8) π‘†π΄π‘π‘Ÿ = or π‘†π΅π‘Ÿπ‘ž = or both π‘†π΄π‘π‘Ÿ =π‘†π΅π‘Ÿπ‘ž = for pβ‰ q and r οƒŽ{1,2,…..n} (10) and π‘†π΅π‘π‘Ÿ = or π‘†π΄π‘Ÿπ‘ž = or both π‘†π΅π‘π‘Ÿ =π‘†π΄π‘Ÿπ‘ž = for pβ‰ q and r οƒŽ{1,2,…..n} (11) Also, using (11) π‘†π΄π‘π‘Ÿ =π‘†π΅π‘Ÿπ‘ =I and π‘†π΄π‘Ÿπ‘ =π‘†π΅π‘π‘Ÿ =I for atleast one r οƒŽ{1,2,…..n} and for each p οƒŽ{1,2,…..n} (12) Let the results of (12) equation exists for k=p (say) that is π‘†π΄π‘π‘˜ =π‘†π΅π‘˜π‘=I = [<(1,1),(0,0),(0,0)>] Then from (10), we get 𝑆𝐡𝑝𝑗 = =[<(0,0),(1,1),(1,1)>] for all iβ‰  j and Neutrosophic Sets and Systems, Vol. 97, 2026 702 P. Sheeba Maybell, M.M. Shanmugapriya, Eigen Neutrosophic ZSet and Neutrosophic ZRelation 𝑄3 =[<(0.8,0.7),(0.4,0.3),(0.2,0.1)> <(0.8,0.7),(0.4,0.3),(0.2,0.1)> <(0.8,0.7),(0.4,0.3),(0.2,0.1)>] Now, Q3=Q2 then Q2 is the desired GENZ set Next, algorithm I to Calculate LENZS calculate Q1 β€² 𝑄1β€² =[<(0.6,0.5),(0.6,0.4),(0.3,0.1)> <(0.5,0.6),(0.5,0.3),(0.4,0.3)> <(0.5,0.6),(0.6 ,0.7),(0.3,0.4)>] Next step for n=1, 𝑄2β€²= 𝑄1β€² βˆ™π»1 𝑄2β€² =[<(0.6,0.6),(0.5,0.3),(0.3,0.1)> <(0.5,0.6),(0.5,0.3),(0.3,0.3)> <(0.5,0.6),(0.6 ,0.4),(0.3,0.1)>] Now, find 𝑄3β€²= 𝑄2β€² βˆ™π»1 𝑄3β€² =[<(0.6,0.6),(0.5,0.3),(0.3,0.1)> <(0.5,0.6),(0.5,0.3),(0.3,0.3)> <(0.5,0.6),(0.6 ,0.4),(0.3,0.1)>] Now, 𝑄3β€²= 𝑄2β€² then 𝑄2β€² is the acquired LENZS. Then using (15), (16) and (17) find π‘†π΄π‘šπ‘Žπ‘₯ and π‘†π΄π‘šin. The effectiveness (E) and Uncertainty(U) can be found using average of max, min value and difference of max, min value divided by 2. Table 2: Result of Effectiveness and Uncertainty Table 2 depicts effectiveness E1 is higher and uncertainty U1 is lower which makes the ambiance is good. The highest uncertainty of U3 gives the feedback of monetary value can be considered in future. 7. Conclusion In this work, neutrosophic z-relation along with neutrosophic zmatrices and their certain connected properties and models are introduced. The algorithms for calculating two types of eigen neutrosophic z-set with analogous were shown. At last, a utilization of neutrosophic zset in choice strategy problem using eigen neutrosophic z-set were found. As, an extension of this work in future, Neutrosophic Z-relations and Z-matrices may be generalized to higher-order structures such as Neutrosophic Z-tensors, enabling the modeling of multi-dimensional and highly uncertain data. Parameters π‘†π΄π‘šπ‘Žπ‘₯ 0.8066 0.8066 0.8066 π‘†π΄π‘šin 0.7266 0.6866 0.6766 E 0.7666 0.7463 0.7416 U 0.04 0.06 0.065 Neutrosophic Sets and Systems, Vol. 97, 2026 703 P. Sheeba Maybell, M.M. Shanmugapriya, Eigen Neutrosophic ZSet and Neutrosophic ZRelation Eigen neutrosophic Z-set integration with machine learning, deep learning, and hybrid intelligent systems could open up new opportunities for uncertain data-driven decision making. References 1. Zadeh L A, A note on Znumbers, Information Sciences, Volume 181, Issue 14, 15 July 2011, Pages 29232932, https://doi.org/10.1016/j.ins.2011.02.022 2. Yager.R.R , On Z valuation using Zadeh’s Z-numbers, International Journal of Intelligent System.2012, 27(3), 259-278, https://doi.org/10.1002/int.21521 3. Smarandache .F, Neutrosophic set, A Generalization of Intuitionistic Fuzzy sets, International Journal of Pure and Applied Mathematics.2005,24 ,287-297. 4. Sanjib Mondal, Madhumangal pal, Similarity relations, Invertibility and Eigen values of Intuitionistic fuzzy matrix, Fuzzy Information and Engineering.2013, 5 (4), 431-443, https://doi.org/10.1007/s12543-013-0156-y 5. Kumar.S.R, Mary.S.A, Quadripartitioned Neutrosophic soft set, International Research journal on Advanced Science Hub. 2021, 3, 106-112, DOI: 10.47392/irjash.2021.048 6. R.Uma, P.Murugadas, S. Sriram, Fuzzy Neutrosophic Soft Matrices of Type -I and Type-II, Fuzzy Information and Engineering.2021,13, 211-222. DOI: 10.1080/16168658.2021.1923621 7. Somen Debnath, Fuzzy Quadripartitioned Neutrosophic Soft matrix theory and its Decision making, Journal of computational and Cognitive Engineering. 2022,1(2), 88-93. 10.47852/bonviewJCCE19522514205514. 8. Shigui Du,Jun Ye, Rui Yong, Fangwei shang, Some aggregation operators of Neutrosophic Znumbers and their multi criteria decision making method, Complex Intell. Syst., Springer. 2021,7, 429-438. 10.1007/s40747-020-00204-w 9. Ye J, Similarity measures based on the generalized distance of neutrosophic Z-number sets and their multiattribute decision making method. Soft Computing. 2021, 25,13975–13985. 10.1007/s00500-021-06199-x 10. Gardashova L.A., Z-number based TOPSIS method in multi-criteria decision making, Springer, Cham. 2019, 896. 10.1007/978-3-030-04164-9_10 11. Rituparna Chutia,Ranking of Znumber based on value and ambiguity at levels of decision making, International Journal of Intelligent System,Wiley. 2020, 1-19. https://doi.org/10.1002/int.22301 12. Farzam M, Kermani M A , Allahviranloo T, Belaghi M J S , A new method for ranking of Znumbers based on magnitude value, In progress in Intelligent Decision Science, Springer, cham. 2021, 841-850. DOI:10.1007/978-3-030-66501-2_68 13. Sanchez, E., Eigen Fuzzy Sets and fuzzy Relations, Journal of Mathematical Analysis and Applications. 1981,81, 399–421. https://doi.org/10.1016/0022-247X(81)90073-1. 14. Guleria A , Bajaj R.K, Eigen spherical fuzzy sets and its application in decision making problem, Scientia Iranica. Int. J. Sci. Technol.2019 29. 10.24200/sci.2018.50458.1738 15. Kifayat, U , Mahmood, T, Naeem, J , Similarity Measures for T-Spherical Fuzzy Sets with Applications in Pattern Recognition, symmetry.2018, 10, 193. 10.3390/sym10020193. 16. T. Harikrishnan, M. Anandhkumar, S. Prathap, S. Subramanian, D. Ramesh, M.Raji, Min(Max) – Min(Max) – Max(Min) (βˆ—): Compositions of Neutrosophic Fuzzy Matrices and its Application in Medical Diagnosis, Neutrosophic Sets and Systems, Vol. 86, 2025, https://digitalrepository.unm.edu/nss_journal/vol86/iss1/14 17. Kamran M., Abdalla M.E.M, Nadeem, M, Uzair, A.; Farman, M.; Ragoub, L.; Cangul, I.N. A Systematic Formulation into Neutrosophic Z Methodologies for Symmetrical and Asymmetrical Transportation Problem Challenges. Symmetry 2024, 16, 615. https://doi.org/10.3390/sym16050615. 18. Mishra P., Kumar, V. (2024). Algebraic properties of neutrosophic matrices with applications to decisionoriented systems. Applied Soft Computing, 125, 109–122. 10.1016/j.asoc.2023.109122. 19. Al-Faifi A., Al-Shehri, M., Smarandache, A. (2023). Multi-criteria decision-making using neutrosophic and plithogenic models for uncertain preference structures. Expert Systems with Applications, 226, 120–134. 10.1016/j.eswa.2023.120134. 20. Saha S., Abdel-Basset, M. (2023). Spectral measures of neutrosophic matrices and their application in network clustering. Knowledge-Based Systems, 268, 110–124. 10.1016/j.knosys.2023.110124. Received: June 4, 2025. Accepted: Nov 15, 2025