See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/385552651

A Comprehensive Discussion on Fuzzy Hypersoft Expert, Superhypersoft, and

IndetermSoft Graphs

Preprint · July 2024

DOI: 10.13140/RG.2.2.29852.30089

CITATIONS READS

0 32

1 author:

Takaaki Fujita

107 PUBLICATIONS 271 CITATIONS

SEE PROFILE

All content following this page was uploaded by Takaaki Fujita on 05 November 2024.

The user has requested enhancement of the downloaded file.

 A Comprehensive Discussion on Fuzzy Hypersoft Expert, Superhypersoft, and
IndetermSoft Graphs

Takaaki Fujita1,* ,

Abstract: Graph theory, a branch of mathematics, studies relationships among entities through vertices
and edges. To capture the inherent uncertainties in real-world networks, Uncertain Graph Theory has evolved
within this field. Soft Expert Graphs combine conventional graph theory with expert assessments, using fuzzy
sets for vertices and edges, while allowing expert opinions to shape the uncertainties and relationships within
the graph. Hypersoft Graphs extend this concept further by incorporating multi-attribute nodes that represent
multiple distinct attribute values, enabling the modeling of more complex, multi-dimensional relationships.
In this paper, we define the Hypersoft Expert Graph and explore its connections to other classes of graphs.
We also consider the SuperHypersoft Graph, TreeSoft Graph, and IndetermSoft Graph.
Keywords: Hypersoft Expert Graph, Fuzzy graph, Soft Graph, Hypersoft Graph, Soft Set

1. Introduction
1.1 Uncertain Graph Classes
Graph theory, a foundational area of mathematics, models relationships within network structures through
vertices (or nodes) and edges. Graphs serve as versatile tools for representing connections and interactions
between various elements, often referred to as concepts or sets. These foundational concepts were first in-
troduced in the 1700s, and since then, they have been extensively studied and developed up to the present
day[26, 30, 44, 123, 133, 185].
Mathematical concepts capable of handling real-world uncertainties, such as Fuzzy Sets [183] and Neu-
trosophic Sets [156, 157], have been proposed to address various ambiguous scenarios. This paper investi-
gates multiple models of uncertain graphs, which expand classical graph theory by adding layers of uncer-
tainty, enhancing the representation of complex, ambiguous relationships. These uncertain graph models have
proven highly applicable across real-world domains, leading to the development of numerous related graph
classes [47–60, 62–64, 64–73]. These uncertain graphs are especially useful in decision-making applications
[3, 10, 33–35, 111, 112, 154, 162, 184].
Given the extensive research and applications in this field, uncertain graphs have become a vital area of
study. For additional context and recent advancements, readers may refer to recent survey papers [61, 66, 67].

1.2 Soft Expert Graphs and Hypersoft Graphs

The concept of Soft Expert Sets extends into the domain of uncertain graphs, exploring their connections
with other graph classes. A Soft Expert Graph integrates classical graph theory with expert evaluations, asso-
ciating fuzzy sets with vertices and edges while using expert opinions to define uncertainties and relationships.
This approach aligns with the principles of Soft Set Theory [15,16,114,117,181] and Soft Graph Theory [8,92].
The framework includes models like Fuzzy Soft Expert Graphs [150], Intuitionistic Fuzzy Soft Expert
Graphs [175], and Neutrosophic Soft Expert Graphs [177], each of which has proven effective in multi-criteria
decision-making [21, 45, 140, 171, 174]. Extensive research has already been conducted on Soft Expert Sets and
their applications [13, 14, 17, 18, 134, 149].
A Hypersoft Graph further extends traditional graphs by incorporating multi-attribute nodes, allowing
each node to represent several distinct attribute values, which supports more complex, multi-dimensional re-
lationships[136, 144, 146–148]. In essence, it can be viewed as the graph-based concept of Hypersoft Sets
[1, 39, 115, 120, 121, 137, 153, 158, 182]. Additionally, Hypersoft Expert Sets have been introduced as exten-
sions of Hypersoft Sets [2, 99–106].

1
1.3 Our Contribution in This Paper
As noted above, while research on Soft Expert Graphs and related areas is progressing, studies on Hy-
persoft Expert Graphs remain limited. In this paper, we define the Hypersoft Expert Graph and analyze its
connections with other graph classes. Additionally, in the concluding section, we examine the SuperHypersoft
Graph, TreeSoft Graph, and IndetermSoft Graph. These are graph concepts based on extensions of the Soft
Set framework, specifically the SuperHypersoft Set[79, 116, 163, 167], TreeSoft Set[41, 126, 164, 165, 168], and
IndetermSoft Set[164, 165].

1.4 The Structure of the Paper

The format of this paper is described below.
1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.1 Uncertain Graph Classes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.2 Soft Expert Graphs and Hypersoft Graphs . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.3 Our Contribution in This Paper . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2
1.4 The Structure of the Paper . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2
2 Preliminaries and Definitions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2
2.1 Basic Graph Concepts . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2
2.2 Uncertain Graph . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2
2.3 Hypersoft Graph . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4
2.4 Fuzzy Soft Graph and Fuzzy Hypersoft Graph . . . . . . . . . . . . . . . . . . . . . . . 4
2.5 Fuzzy Soft Expert Graph . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5
2.6 Fuzzy Hypersoft Expert Graph . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5
3 Result:Fuzzy Hypersoft Expert Graph . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6
4 Future direction of this research . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7
4.1 Future tasks: Hypergraphs and Superhypergraphs . . . . . . . . . . . . . . . . . . . . . 7
4.2 Discussion: IndetermSoft Graphs, superhypersoft Graphs, and TreeSoft Graphs . . . . . 7

2. Preliminaries and Definitions

This section offers an overview of the fundamental definitions and notations used throughout the paper.
Additionally, some foundational concepts from set theory are applied in parts of this work. For further details,
please consult relevant references as needed [46, 91, 94, 108, 113].

2.1 Basic Graph Concepts

This section provides a concise overview of essential concepts in graph theory. For a more detailed study
and additional notational conventions, see [42–44, 86, 179].
Definition 1 (Graph). [44] A graph 𝐺 is a mathematical structure used to model pairwise relations between
objects. It is composed of a set of vertices 𝑉 (𝐺) and a set of edges 𝐸 (𝐺), where each edge represents a connection
between two vertices. Formally, a graph is denoted by 𝐺 = (𝑉, 𝐸), with 𝑉 as the set of vertices and 𝐸 as the set
of edges.
Definition 2 (Vertex Degree). [44] For a graph 𝐺 = (𝑉, 𝐸), the degree of a vertex 𝑣 ∈ 𝑉, denoted deg(𝑣), is
defined as the number of edges incident to 𝑣. For an undirected graph, this is expressed as:

deg(𝑣) = |{𝑒 ∈ 𝐸 | 𝑣 ∈ 𝑒}|.

This measure reflects the connectivity of 𝑣 within the graph.

2.2 Uncertain Graph

Approximately half a century has passed since the introduction of the Fuzzy Set, leading to the devel-
opment of various graph concepts designed to handle uncertainty. Here, we provide definitions for frameworks
including Fuzzy, Intuitionistic Fuzzy, Neutrosophic, Vague, Turiyam, and Single-Valued Pentapartitioned Neu-
trosophic.
Definition 3 (Unified Uncertain Graphs Framework). (cf.[66]) Let 𝐺 = (𝑉, 𝐸) be a classical graph with a set of
vertices 𝑉 and a set of edges 𝐸. Depending on the type of graph, each vertex 𝑣 ∈ 𝑉 and edge 𝑒 ∈ 𝐸 is assigned
membership values to represent various degrees of truth, indeterminacy, falsity, and other nuanced measures of
uncertainty.

1. Fuzzy Graph [25, 77, 80, 110, 118, 124, 141, 142, 170, 178]:

2
 • Each vertex 𝑣 ∈ 𝑉 is assigned a membership degree 𝜎(𝑣) ∈ [0, 1].
• Each edge 𝑒 = (𝑢, 𝑣) ∈ 𝐸 is assigned a membership degree 𝜇(𝑢, 𝑣) ∈ [0, 1].
2. Intuitionistic Fuzzy Graph (IFG) [4, 24, 37, 107, 119, 172, 176, 186]:
• Each vertex 𝑣 ∈ 𝑉 is assigned two values: 𝜇 𝐴 (𝑣) ∈ [0, 1] (degree of membership) and 𝜈 𝐴 (𝑣) ∈ [0, 1]
(degree of non-membership), such that 𝜇 𝐴 (𝑣) + 𝜈 𝐴 (𝑣) ≤ 1.
• Each edge 𝑒 = (𝑢, 𝑣) ∈ 𝐸 is assigned two values: 𝜇 𝐵 (𝑢, 𝑣) ∈ [0, 1] and 𝜈 𝐵 (𝑢, 𝑣) ∈ [0, 1], with
𝜇 𝐵 (𝑢, 𝑣) + 𝜈 𝐵 (𝑢, 𝑣) ≤ 1.
3. Neutrosophic Graph [7, 11, 32, 61, 68, 87, 95, 109, 151, 160, 169]:
• Each vertex 𝑣 ∈ 𝑉 is assigned a triplet 𝜎(𝑣) = (𝜎𝑇 (𝑣), 𝜎𝐼 (𝑣), 𝜎𝐹 (𝑣)), where 𝜎𝑇 (𝑣), 𝜎𝐼 (𝑣), 𝜎𝐹 (𝑣) ∈
[0, 1] and 𝜎𝑇 (𝑣) + 𝜎𝐼 (𝑣) + 𝜎𝐹 (𝑣) ≤ 3.
• Each edge 𝑒 = (𝑢, 𝑣) ∈ 𝐸 is assigned a triplet 𝜇(𝑒) = (𝜇𝑇 (𝑒), 𝜇 𝐼 (𝑒), 𝜇 𝐹 (𝑒)).
4. Turiyam Graph [74–76]:
• Each vertex 𝑣 ∈ 𝑉 is assigned a quadruple 𝜎(𝑣) = (𝑡 (𝑣), 𝑖𝑣(𝑣), 𝑓 𝑣(𝑣), 𝑙𝑣(𝑣)), where each component
is in [0, 1] and 𝑡 (𝑣) + 𝑖𝑣(𝑣) + 𝑓 𝑣(𝑣) + 𝑙𝑣(𝑣) ≤ 4.
• Each edge 𝑒 = (𝑢, 𝑣) ∈ 𝐸 is similarly assigned a quadruple.
5. Vague Graph [5, 6, 27–29, 138, 139, 152]:
• Each vertex 𝑣 ∈ 𝑉 is assigned a pair (𝜏(𝑣), 𝜙(𝑣)), where 𝜏(𝑣) ∈ [0, 1] is the degree of truth-
membership and 𝜙(𝑣) ∈ [0, 1] is the degree of false-membership, with 𝜏(𝑣) + 𝜙(𝑣) ≤ 1.
• The grade of membership is characterized by the interval [𝜏(𝑣), 1 − 𝜙(𝑣)].
• Each edge 𝑒 = (𝑢, 𝑣) ∈ 𝐸 is assigned a pair (𝜏(𝑒), 𝜙(𝑒)), satisfying:

𝜏(𝑒) ≤ min{𝜏(𝑢), 𝜏(𝑣)}, 𝜙(𝑒) ≥ max{𝜙(𝑢), 𝜙(𝑣)}.

6. Hesitant Fuzzy Graph [23, 81, 125, 127, 180]:

• Each vertex 𝑣 ∈ 𝑉 is assigned a hesitant fuzzy set 𝜎(𝑣), represented by a finite subset of [0, 1],
denoted 𝜎(𝑣) ⊆ [0, 1].
• Each edge 𝑒 = (𝑢, 𝑣) ∈ 𝐸 is assigned a hesitant fuzzy set 𝜇(𝑒) ⊆ [0, 1].
• Operations on hesitant fuzzy sets (e.g., intersection, union) are defined to handle the hesitation in
membership degrees.
7. Single-Valued Pentapartitioned Neutrosophic Graph [38, 97, 98, 135]:
• Each vertex 𝑣 ∈ 𝑉 is assigned a quintuple 𝜎(𝑣) = (𝑇 (𝑣), 𝐶 (𝑣), 𝑅(𝑣), 𝑈 (𝑣), 𝐹 (𝑣)), where:
– 𝑇 (𝑣) ∈ [0, 1] is the truth-membership degree.
– 𝐶 (𝑣) ∈ [0, 1] is the contradiction-membership degree.
– 𝑅(𝑣) ∈ [0, 1] is the ignorance-membership degree.
– 𝑈 (𝑣) ∈ [0, 1] is the unknown-membership degree.
– 𝐹 (𝑣) ∈ [0, 1] is the false-membership degree.
– 𝑇 (𝑣) + 𝐶 (𝑣) + 𝑅(𝑣) + 𝑈 (𝑣) + 𝐹 (𝑣) ≤ 5.
• Each edge 𝑒 = (𝑢, 𝑣) ∈ 𝐸 is assigned a quintuple 𝜇(𝑒) = (𝑇 (𝑒), 𝐶 (𝑒), 𝑅(𝑒), 𝑈 (𝑒), 𝐹 (𝑒)), satisfying:


 𝑇 (𝑒) ≤ min{𝑇 (𝑢), 𝑇 (𝑣)},

𝐶 (𝑒) ≤ min{𝐶 (𝑢), 𝐶 (𝑣)},




𝑅(𝑒) ≥ max{𝑅(𝑢), 𝑅(𝑣)},




 𝑈 (𝑒) ≥ max{𝑈 (𝑢), 𝑈 (𝑣)},
 𝐹 (𝑒) ≥ max{𝐹 (𝑢), 𝐹 (𝑣)}.



3
2.3 Hypersoft Graph
A HyperSoft Graph represents multi-attribute nodes where each node can hold distinct attribute values,
enabling complex, multi-dimensional relationships. The definition of a Hypersoft Graph is provided as follows
[136, 144, 146–148].
Definition 4 (Hypersoft Set). [158] Let 𝑋 be a non-empty finite universe, and let 𝑇1 , 𝑇2 , . . . , 𝑇𝑛 be 𝑛-distinct
attributes with corresponding disjoint sets 𝐽1 , 𝐽2 , . . . , 𝐽𝑛 . A pair (𝐹, 𝐽) is called a hypersoft set over the universal
set 𝑋, where 𝐹 is a mapping defined by
𝐹 : 𝐽 → P (𝑋),
with 𝐽 = 𝐽1 × 𝐽2 × · · · × 𝐽𝑛 .
Definition 5 (Hypersoft Graph). Let 𝐺 = (𝑉, 𝐸) be a simple connected graph, where 𝑉 is the set of vertices and
𝐸 is the set of edges. Consider 𝐽 = 𝐽1 × 𝐽2 × · · · × 𝐽𝑛 , where each 𝐽𝑖 ⊆ 𝑉 and 𝐽𝑖 ∩ 𝐽 𝑗 = ∅ for 𝑖 ≠ 𝑗. A Hypersoft
Graph (HS-Graph) of 𝐺 is defined as a hypersoft set (𝐹, 𝐽) over 𝑉 such that for each 𝑥 ∈ 𝐽, 𝐹 (𝑥) induces a
connected subgraph of 𝐺. The set of all HS-Graphs of 𝐺 is denoted by HsG(𝐺).

2.4 Fuzzy Soft Graph and Fuzzy Hypersoft Graph

A Fuzzy Soft Graph assigns fuzzy membership values to vertices and edges based on parameters, repre-
senting uncertainty in relationships [9,12,19,20,22,34,96,155]. And a Fuzzy Hypersoft Graph extends fuzzy soft
graphs by using multi-parameter combinations to assign fuzzy membership, capturing complex multi-attribute
relationships. The definitions of Fuzzy Soft Graph and Fuzzy Hypersoft Graph are presented as follows.
Definition 6 (Fuzzy Soft Graph). [9, 12] Let 𝑋 = {𝑥1 , 𝑥 2 , 𝑥 3 , . . . , 𝑥 𝑛 } be a non-empty set, and let 𝐴 ⊆ 𝐸, where
𝐸 is a set of parameters. A fuzzy soft graph is defined by two mappings:
• 𝜌 : 𝐴 → 𝐹 (𝑋), where 𝐹 (𝑋) is the collection of all fuzzy subsets in 𝑋. For each parameter 𝑒 ∈ 𝐴,
𝜌(𝑒) : 𝑋 → [0, 1]
assigns a membership degree 𝜌𝑒 (𝑥𝑖 ) to each element 𝑥𝑖 ∈ 𝑋. The pair ( 𝐴, 𝜌) represents the fuzzy soft
vertices.
• 𝛽 : 𝐴 → 𝐹 (𝑋 × 𝑋), where 𝐹 (𝑋 × 𝑋) is the collection of all fuzzy subsets in 𝑋 × 𝑋. For each parameter
𝑒 ∈ 𝐴,
𝛽(𝑒) : 𝑋 × 𝑋 → [0, 1]
assigns a membership degree 𝛽𝑒 (𝑥𝑖 , 𝑥 𝑗 ) to each pair (𝑥𝑖 , 𝑥 𝑗 ) ∈ 𝑋 × 𝑋. The pair ( 𝐴, 𝛽) represents the fuzzy
soft edges.
The structure (( 𝐴, 𝜌), ( 𝐴, 𝛽)) is called a fuzzy soft graph if
𝛽𝑒 (𝑥𝑖 , 𝑥 𝑗 ) ≤ 𝜌𝑒 (𝑥 𝑖 ) ∧ 𝜌𝑒 (𝑥 𝑗 )

for all 𝑒 ∈ 𝐴 and for all 𝑖, 𝑗 = 1, 2, . . . , 𝑛. This graph is denoted as 𝐺ˆ 𝐴,𝑋 .

Definition 7 (Fuzzy Hypersoft Graph). [143, 145] Let 𝑋 = {𝑥1 , 𝑥 2 , 𝑥 3 , . . . , 𝑥 𝑛 } be a universe of discourse, and
let 𝐸 be a set of parameters with subsets 𝐾𝑖 ⊆ 𝐸 for 𝑖 = 1, 2, . . . , 𝑛. Define 𝑀 = 𝐾1 × 𝐾2 × · · · × 𝐾 𝑛 , representing
combinations of parameter values. A fuzzy hypersoft graph is defined by:
• 𝜌 : 𝑀 → 𝐹 (𝑋), where 𝐹 (𝑋) is the collection of all fuzzy subsets in 𝑋. For each 𝑒 = (𝑘 1 , 𝑘 2 , . . . , 𝑘 𝑛 ) ∈ 𝑀,
𝜌(𝑒) : 𝑋 → [0, 1]
assigns a membership degree 𝜌𝑒 (𝑥𝑖 ) to each element 𝑥𝑖 ∈ 𝑋. The pair (𝑀, 𝜌) represents the fuzzy hyper-
soft vertices.
• 𝛽 : 𝑀 → 𝐹 (𝑋 × 𝑋), where 𝐹 (𝑋 × 𝑋) is the collection of all fuzzy subsets in 𝑋 × 𝑋. For each 𝑒 =
(𝑘 1 , 𝑘 2 , . . . , 𝑘 𝑛 ) ∈ 𝑀,
𝛽(𝑒) : 𝑋 × 𝑋 → [0, 1]
assigns a membership degree 𝛽𝑒 (𝑥𝑖 , 𝑥 𝑗 ) to each pair (𝑥𝑖 , 𝑥 𝑗 ) ∈ 𝑋 × 𝑋. The pair (𝑀, 𝛽) represents the
fuzzy hypersoft edges.
The structure ((𝑀, 𝜌), (𝑀, 𝛽)) is called a fuzzy hypersoft graph if
𝛽𝑒 (𝑥𝑖 , 𝑥 𝑗 ) ≤ 𝜌𝑒 (𝑥 𝑖 ) ∧ 𝜌𝑒 (𝑥 𝑗 )

for all 𝑒 ∈ 𝑀 and for all 𝑖, 𝑗 = 1, 2, . . . , 𝑛. This graph is denoted as 𝐺ˆ 𝑀,𝑋 .

4
2.5 Fuzzy Soft Expert Graph
A Fuzzy Soft Expert Graph combines fuzzy memberships for vertices and edges with expert opinions,
defining relationships with parameters and expert evaluations. The definition of a Fuzzy Soft Expert Graph is
provided as follows.
Definition 8 (Fuzzy Soft Expert Graph). [150] Let 𝑉 be a universe of discourse, 𝑌 a set of parameters, 𝑋 a set of
experts (agents), and 𝑆 = {1, 0} a set of opinions, where 1 represents agreement and 0 represents disagreement.
Define 𝑀 = 𝑌 × 𝑋 × 𝑆 as the space of all parameter-expert-opinion combinations, and let 𝐸 ⊆ 𝑀 × 𝑀 represent
the set of edges in the graph.
A fuzzy soft expert graph (FSEG) is defined as a 4-tuple 𝐺 = (𝐺 ∗ , 𝑌 , 𝜌, 𝛽), where:
• 𝐺 ∗ = (𝑉, 𝐸) is a simple graph.
• 𝜌 : 𝑌 → 𝐹 (𝑉) is a fuzzy soft expert vertex function, where for each 𝑦 ∈ 𝑌 ,

𝜌(𝑦) = h𝑥, 𝜌 𝑦 (𝑥)i : 𝑥 ∈ 𝑉

defines the membership degree 𝜌 𝑦 (𝑥) for each vertex 𝑥 ∈ 𝑉.

• 𝛽 : 𝑌 → 𝐹 (𝑉 × 𝑉) is a fuzzy soft expert edge function, where for each 𝑦 ∈ 𝑌 and edge (𝑥, 𝑥 0 ) ∈ 𝑉 × 𝑉,

𝛽(𝑦) = h(𝑥, 𝑥 0 ), 𝛽 𝑦 (𝑥, 𝑥 0 )i : (𝑥, 𝑥 0 ) ∈ 𝑉 × 𝑉

assigns a membership degree 𝛽 𝑦 (𝑥, 𝑥 0 ) for each edge.

The conditions required for 𝐺 to be a fuzzy soft expert graph are:

𝛽 𝑦 (𝑥, 𝑥 0 ) ≤ min{𝜌 𝑦 (𝑥), 𝜌 𝑦 (𝑥 0 )},

for all (𝑥, 𝑥 0 ) ∈ 𝑉 × 𝑉 and 𝑦 ∈ 𝑌 .

We can also represent a FSEG by 𝐺 = (𝐺 ∗ , 𝑌 , 𝜌, 𝛽) = {𝐺 (𝑦) : 𝑦 ∈ 𝑌 }, where each 𝐺 (𝑦) is a parameter-
ized fuzzy graph in 𝑉.

2.6 Fuzzy Hypersoft Expert Graph

The definition of the proposed Fuzzy Hypersoft Expert Graph in this paper is presented below. It extends
the concept of the Fuzzy Hypersoft Expert Set into a graph framework and, as will be shown in the following
theorem, is also an extension of the Fuzzy Soft Expert Graph.
Definition 9 (Fuzzy Hypersoft Expert Set). [99] Let 𝐴 = { 𝐴1 , 𝐴2 , . . . , 𝐴𝑛 } be a collection of non-overlapping
subsets of parameters corresponding to different attributes 𝑎 𝑖 for 𝑖 = 1, 2, . . . , 𝑛. Define the fuzzy parameterized
fuzzy hypersoft expert set (FPFHSE-set) over a universal set 𝑈 as a pair ( 𝑓 , 𝑆), where:
• 𝑄 = 𝐴1 × 𝐴2 × · · · × 𝐴𝑛 is the Cartesian product of parameter sets.
• 𝑃 = 𝑄 × 𝐼 × 𝑈 where 𝐼 is a set of experts (agents), and 𝑈 = {0, 1} denotes the set of opinions, with 1
representing agreement and 0 disagreement.
• 𝑆 ⊆ 𝐻 = {(𝜁 (𝑞)/𝑞, 𝑥, 𝑢) | (𝑞, 𝑥, 𝑢) ∈ 𝑃, 𝜁 (𝑞) ∈ [0, 1]} is the fuzzy hypersoft expert subset of possible
evaluations.
• 𝑓 : 𝑆 → FP(𝑈) is an approximate function mapping elements of 𝑆 to fuzzy subsets of 𝑈.
Thus, the FPFHSE-set ( 𝑓 , 𝑆) can be represented as:

( 𝑓 , 𝑆) = {((𝜁 (𝑞)/𝑞, 𝑥, 𝑢), 𝑓 ((𝜁 (𝑞)/𝑞, 𝑥, 𝑢))) | (𝜁 (𝑞)/𝑞, 𝑥, 𝑢) ∈ 𝑆} .

Definition 10 (Fuzzy Hypersoft Expert Graph). Let 𝑉 be a finite set of vertices, and 𝐸 a set of edges such that
𝐸 ⊆ 𝑉 × 𝑉. Let 𝐴 = { 𝐴1 , 𝐴2 , . . . , 𝐴𝑛 } be a collection of non-overlapping parameter subsets corresponding to
different attributes 𝑎 𝑖 , where each 𝐴𝑖 is associated with attribute 𝑎 𝑖 for 𝑖 = 1, 2, . . . , 𝑛. Define the parameter
space 𝑄 = 𝐴1 × 𝐴2 × · · · × 𝐴𝑛 .
Let 𝑋 be a set of experts, and let 𝑈 = {0, 1} be a set of opinions, where 1 represents agreement and 0
represents disagreement. Define the set 𝑀 = 𝑄 × 𝑋 × 𝑈, representing all combinations of parameters, experts,
and opinions.
Define two mappings:

5
 • The fuzzy hypersoft expert vertex function 𝜌 : 𝑀 → 𝐹 (𝑉), where 𝐹 (𝑉) denotes the set of all fuzzy subsets
of 𝑉. For each 𝑚 = (𝑞, 𝑥, 𝑢) ∈ 𝑀, the function 𝜌 𝑚 : 𝑉 → [0, 1] assigns a membership degree 𝜌 𝑚 (𝑣) to
each vertex 𝑣 ∈ 𝑉.
• The fuzzy hypersoft expert edge function 𝛽 : 𝑀 → 𝐹 (𝑉 × 𝑉), where 𝐹 (𝑉 × 𝑉) denotes the set of all fuzzy
subsets of 𝑉 × 𝑉. For each 𝑚 = (𝑞, 𝑥, 𝑢) ∈ 𝑀, the function 𝛽𝑚 : 𝑉 × 𝑉 → [0, 1] assigns a membership
degree 𝛽𝑚 (𝑢, 𝑣) to each edge (𝑢, 𝑣) ∈ 𝑉 × 𝑉.
The structure 𝐺 = ((𝑀, 𝜌), (𝑀, 𝛽)) is called a fuzzy hypersoft expert graph if for all 𝑚 ∈ 𝑀 and for all
𝑢, 𝑣 ∈ 𝑉, the following condition holds:
𝛽𝑚 (𝑢, 𝑣) ≤ 𝜌 𝑚 (𝑢) ∧ 𝜌 𝑚 (𝑣),
where ∧ denotes the minimum operator.

3. Result:Fuzzy Hypersoft Expert Graph

The relationship between the Fuzzy Hypersoft Expert Graph and other classes of graphs is described as
follows.
Theorem 11. The fuzzy hypersoft expert graph 𝐺 = ((𝑀, 𝜌), (𝑀, 𝛽)) can be transformed into a fuzzy soft
expert graph, a fuzzy hypersoft graph, and a fuzzy graph by appropriate reductions of parameters, experts, and
opinions.
Proof. We will show the transformations step by step.

Transformation to Fuzzy Soft Expert Graph Let us consider the fuzzy hypersoft expert graph 𝐺 = ((𝑀, 𝜌), (𝑀, 𝛽)).
To obtain a fuzzy soft expert graph, we proceed as follows:
• Fix the parameters by selecting a specific tuple 𝑞 ∈ 𝑄.
• The set 𝑀 reduces to 𝑀 0 = {(𝑞, 𝑥, 𝑢) | 𝑥 ∈ 𝑋, 𝑢 ∈ 𝑈}.
• The mappings 𝜌 and 𝛽 become functions over 𝑀 0 .
• The fuzzy hypersoft expert graph reduces to 𝐺 0 = ((𝑀 0 , 𝜌), (𝑀 0 , 𝛽)), which corresponds to a fuzzy soft
expert graph where the parameters are fixed.

Transformation to Fuzzy Hypersoft Graph To transform 𝐺 into a fuzzy hypersoft graph, we proceed by
aggregating over experts and opinions:
• Consider the set 𝑀 00 = 𝑄, eliminating the expert set 𝑋 and opinion set 𝑈.
• Define aggregated vertex and edge functions 𝜌 0 : 𝑄 → 𝐹 (𝑉) and 𝛽0 : 𝑄 → 𝐹 (𝑉 × 𝑉) by combining the
contributions from all experts and opinions.
• For each 𝑞 ∈ 𝑄, define:
𝜌𝑞0 (𝑣) = max 𝜌 (𝑞, 𝑥,𝑢) (𝑣),
( 𝑥,𝑢) ∈𝑋×𝑈

𝛽𝑞0 (𝑢, 𝑣) = max 𝛽 (𝑞, 𝑥,𝑢0 ) (𝑢, 𝑣).

( 𝑥,𝑢0 ) ∈𝑋×𝑈

• The structure 𝐺 00 = ((𝑄, 𝜌 0 ), (𝑄, 𝛽0 )) is a fuzzy hypersoft graph.

Transformation to Fuzzy Graph To reduce 𝐺 to a fuzzy graph, we fix both the parameters and the experts,
and consider the agreed opinions:
• Fix a specific parameter tuple 𝑞 ∈ 𝑄 and a specific expert 𝑥 ∈ 𝑋.
• Consider the set 𝑀 000 = {(𝑞, 𝑥, 1)}, where 𝑢 = 1 represents agreement.
• The vertex and edge functions become 𝜌 (𝑞,𝑥, 1 ) and 𝛽 (𝑞, 𝑥, 1 ) .
• The fuzzy graph is then 𝐺 000 = (𝜌 (𝑞,𝑥, 1 ) , 𝛽 (𝑞,𝑥, 1 ) ).
This proof is completed. ƒ

6
4. Future direction of this research
In this section, we briefly discuss the future direction of this research.

4.1 Future tasks: Hypergraphs and Superhypergraphs

As a future direction for this research, we are considering extending Soft Expert Graphs and Hypersoft
Expert Graphs to hypergraphs [31, 82–84, 84, 132] (creating Soft Expert Hypergraphs and Hypersoft Expert
Hypergraphs) and superhypergraphs [78, 88–90, 159–162, 166] (leading to Soft Expert Superhypergraphs and
Hypersoft Expert Superhypergraphs).
In the future, we hope to extend the concepts of Soft Expert Graphs and Hypersoft Expert Graphs by
incorporating the framework of Rough Graphs. Note that a Rough Set [85, 128–131] (or Rough Graph [36, 40,
93, 122, 173]) is a mathematical model that approximates uncertain or imprecise data using lower and upper
approximations to capture data boundaries. We also intend to explore extensions of Hypersoft Expert Graphs
into Neutrosophic Graphs and similar frameworks.
We also plan to explore real-world applications and mathematical properties of Soft Expert Graphs and
Hypersoft Expert Graphs in greater detail in the future.

4.2 Discussion: IndetermSoft Graphs, superhypersoft Graphs, and TreeSoft Graphs

Various derived forms of soft sets have been proposed, considering their potential applications and
mathematical significance. We aim to investigate the superhypersoft graph as an extension of superhyper-
soft sets [79, 116, 163, 167]. Superhypersoft sets generalize the concepts of both hypersoft sets and soft sets.
Additionally, we will explore IndetermSoft Sets[164, 165], IndetermHyperSoft Sets[164, 165], and TreeSoft
Sets[41, 126, 164, 165, 168].
The IndetermSoft Set is a Soft Set in which attribute values or subsets may contain indeterminate or
uncertain elements within their mappings. The IndetermHyperSoft Set is a HyperSoft Set that allows indetermi-
nacy in attributes, attribute values, or subset mappings, thus accommodating uncertainty. The TreeSoft Set is a
hierarchical Soft Set with multi-level attributes organized in a tree structure, facilitating mappings of complex
attribute relationships.
As an example, we consider the IndetermSoft Graph and TreeSoft Graph, which are graphical represen-
tations of IndetermSoft Sets and TreeSoft Sets, respectively. Although these concepts are still in the preliminary
stages, we present their definitions here and plan to explore their potential applications and mathematical prop-
erties in the future. Additionally, we aim to define concepts that incorporate the ideas of Soft Expert Graphs
and HyperSoft Expert Graphs. We intend to investigate their applications, mathematical properties, and related
algorithms.
Definition 12 (IndetermSoft Set). [165] Let 𝑈 be a universe of discourse, 𝐻 a non-empty subset of 𝑈, and
𝑃(𝐻) the powerset of 𝐻. Let 𝐴 be a set of attribute values associated with a specific attribute 𝑎. A function
𝐹 : 𝐴 → 𝑃(𝐻) is defined as an IndetermSoft Set if any of the following conditions hold:
1. The set 𝐴 possesses some level of indeterminacy.
2. The powerset 𝑃(𝐻) exhibits some indeterminacy.
3. There exists at least one attribute value 𝑣 ∈ 𝐴 such that 𝐹 (𝑣) is indeterminate, meaning unclear, uncertain,
or not unique.
4. Any combination of the above conditions holds.
The IndetermSoft Set (𝐹, 𝐻) has a certain degree of indeterminacy, and thus represents a specific case of a
NeutroFunction, which allows for a mix of determinate, indeterminate, and false components.
Definition 13 (IndetermSoft Graph). Let 𝑈 be a universe of discourse, and let 𝐻 be a non-empty subset of 𝑈,
representing the possible vertices of a graph. Let 𝑃(𝐻) denote the power set of 𝐻. Let 𝐴 be a set of attribute
values associated with a specific attribute 𝑎.
An IndetermSoft Graph is defined as a pair 𝐺 = ((𝐹𝑉 , 𝐻), (𝐹𝐸 , 𝐻 × 𝐻)), where:

1. IndetermSoft Vertex Function 𝐹𝑉 : 𝐴 → 𝑃(𝐻):

• 𝐹𝑉 maps each attribute value 𝑣 ∈ 𝐴 to a subset 𝐹𝑉 (𝑣) ⊆ 𝐻 of vertices.
• The function 𝐹𝑉 may exhibit indeterminacy according to the definition of an IndetermSoft Set; that
is, for some 𝑣 ∈ 𝐴, 𝐹𝑉 (𝑣) may be indeterminate (unclear, uncertain, or not unique).
2. IndetermSoft Edge Function 𝐹𝐸 : 𝐴 → 𝑃(𝐻 × 𝐻):

7
 • 𝐹𝐸 maps each attribute value 𝑣 ∈ 𝐴 to a subset 𝐹𝐸 (𝑣) ⊆ 𝐻 × 𝐻 of edges.
• Similar to 𝐹𝑉 , the function 𝐹𝐸 may also exhibit indeterminacy.

The IndetermSoft Graph 𝐺 = ((𝐹𝑉 , 𝐻), (𝐹𝐸 , 𝐻 × 𝐻)) incorporates indeterminacy in both its vertex and
edge sets, allowing for the representation of uncertain or ambiguous relationships within the graph.
Definition 14 (IndetermHyperSoft Set). [165] Let 𝑈 be a universe of discourse, 𝐻 a non-empty subset of 𝑈, and
𝑃(𝐻) the power set of 𝐻.
Let 𝑎 1 , 𝑎 2 , . . . , 𝑎 𝑛 for 𝑛 ≥ 1 be 𝑛 distinct attributes, whose corresponding attribute values are respectively
the sets 𝐴1 , 𝐴2 , . . . , 𝐴𝑛 , with 𝐴𝑖 ∩ 𝐴 𝑗 = ∅ for 𝑖 ≠ 𝑗, and 𝑖, 𝑗 ∈ {1, 2, . . . , 𝑛}.
Then, the pair (𝐹, 𝐴1 × 𝐴2 × · · · × 𝐴𝑛 ), where 𝐹 : 𝐴1 × 𝐴2 × · · · × 𝐴𝑛 → 𝑃(𝐻), is called an Indeter-
mHyperSoft Set over 𝑈 if at least one of the following conditions occurs:

1. At least one of the sets 𝐴1 , 𝐴2 , . . . , 𝐴𝑛 possesses some indeterminacy.

2. The set 𝐻 or the power set 𝑃(𝐻) possesses some indeterminacy.
3. There exists at least one 𝑛-tuple (𝑒 1 , 𝑒 2 , . . . , 𝑒 𝑛 ) ∈ 𝐴1 × 𝐴2 × · · · × 𝐴𝑛 such that 𝐹 (𝑒 1 , 𝑒 2 , . . . , 𝑒 𝑛 ) is
indeterminate (unclear, uncertain, conflicting, or not unique).

Thus, an IndetermHyperSoft Set is an extension of the HyperSoft Set when there is indeterminate data,
or indeterminate functions, or indeterminate sets.
Definition 15 (IndetermHyperSoft Graph). Let 𝐺 = (𝑉, 𝐸) be a graph, where 𝑉 is the set of vertices and 𝐸 is
the set of edges.
Let 𝑈 be a universe of discourse, and let 𝐻 be a non-empty subset of 𝑈, where 𝐻 ⊆ 𝑉 ∪ 𝐸, representing
possible vertices and edges.
Let 𝑎 1 , 𝑎 2 , . . . , 𝑎 𝑛 for 𝑛 ≥ 1 be 𝑛 distinct attributes, whose corresponding attribute values are respectively
the sets 𝐴1 , 𝐴2 , . . . , 𝐴𝑛 , with 𝐴𝑖 ∩ 𝐴 𝑗 = ∅ for 𝑖 ≠ 𝑗, and 𝑖, 𝑗 ∈ {1, 2, . . . , 𝑛}.
Then, the pair (𝐹, 𝐴1 × 𝐴2 × · · · × 𝐴𝑛 ), where 𝐹 : 𝐴1 × 𝐴2 × · · · × 𝐴𝑛 → 𝑃(𝐻), is called an Indeter-
mHyperSoft Graph over 𝐺 if at least one of the following conditions occurs:

1. At least one of the sets 𝐴1 , 𝐴2 , . . . , 𝐴𝑛 possesses some indeterminacy.

2. The set 𝐻 or the power set 𝑃(𝐻) possesses some indeterminacy.
3. There exists at least one 𝑛-tuple (𝑒 1 , 𝑒 2 , . . . , 𝑒 𝑛 ) ∈ 𝐴1 × 𝐴2 × · · · × 𝐴𝑛 such that 𝐹 (𝑒 1 , 𝑒 2 , . . . , 𝑒 𝑛 ) is
indeterminate (unclear, uncertain, conflicting, or not unique).

In this context, 𝐹 maps combinations of attribute values to subsets of 𝐻 (which could be vertices or
edges), incorporating indeterminacy in the attributes, the attribute values, the mapping 𝐹, or the set 𝐻.
Theorem 16. Every IndetermHyperSoft Graph can be transformed into an IndetermSoft Graph.

Proof. Let 𝐺 = (𝑉, 𝐸) be a graph, and let (𝐹, 𝐴1 × 𝐴2 × · · · × 𝐴𝑛 ) be an IndetermHyperSoft Graph over 𝐺,
where 𝐹 : 𝐴1 × 𝐴2 × · · · × 𝐴𝑛 → 𝑃(𝐻), and 𝐻 ⊆ 𝑉 ∪ 𝐸.
We can transform the IndetermHyperSoft Graph into an IndetermSoft Graph by combining the multiple
attributes into a single composite attribute.
Define a new attribute set 𝐴 as the Cartesian product:

𝐴 = 𝐴1 × 𝐴2 × · · · × 𝐴 𝑛 .

Consider the function 𝐹 as a mapping 𝐹 0 : 𝐴 → 𝑃(𝐻), where for each 𝑎 = (𝑒 1 , 𝑒 2 , . . . , 𝑒 𝑛 ) ∈ 𝐴, we

have 𝐹 0 (𝑎) = 𝐹 (𝑒 1 , 𝑒 2 , . . . , 𝑒 𝑛 ).
Now, (𝐹 0 , 𝐴) can be viewed as an IndetermSoft Graph, where:
• 𝐴 is the set of composite attribute values (each 𝑛-tuple is treated as a single attribute value).
• 𝐹 0 maps attribute values 𝑎 ∈ 𝐴 to subsets of 𝐻 (vertices or edges), possibly with indeterminacy.
Since the conditions of indeterminacy in the IndetermHyperSoft Graph (indeterminacy in 𝐴𝑖 , 𝐻, or 𝐹)
are preserved in the IndetermSoft Graph (indeterminacy in 𝐴, 𝐻, or 𝐹 0 ), the transformation is valid.
Thus, every IndetermHyperSoft Graph can be transformed into an IndetermSoft Graph. ƒ

8
Definition 17 (TreeSoft Set). [165] Let 𝑈 be a universe of discourse, and 𝐻 a non-empty subset of 𝑈, with 𝑃(𝐻)
representing the power set of 𝐻. Let 𝐴 = {𝐴1 , 𝐴2 , . . . , 𝐴𝑛 } be a set of attributes, where 𝑛 ≥ 1 is an integer and
each 𝐴𝑖 represents a first-level attribute. Each attribute 𝐴𝑖 can be further subdivided as follows:

𝐴1 = {𝐴1, 1 , 𝐴1, 2 , . . . }
𝐴2 = {𝐴2, 1 , 𝐴2, 2 , . . . }
..
.
𝐴𝑛 = { 𝐴𝑛, 1 , 𝐴𝑛, 2 , . . . }
where each 𝐴𝑖, 𝑗 represents a second-level sub-attribute. This hierarchical structure can continue further,
forming sub-sub-attributes, such as 𝐴𝑖, 𝑗,𝑘 , and so forth, up to the 𝑚-th level, denoted as 𝐴𝑖1 ,𝑖2 ,...,𝑖𝑚 . This
structure forms a graph-tree, denoted as Tree( 𝐴), rooted at 𝐴 (considered as level zero) and extending to nodes
at levels 1 through 𝑚.
A TreeSoft Set is a mapping defined as:

𝐹 : 𝑃(Tree( 𝐴)) → 𝑃(𝐻)

where Tree( 𝐴) is the set of all nodes and leaves (from level 1 to level 𝑚) of the graph-tree, and 𝑃(Tree( 𝐴))
is the power set of Tree( 𝐴).
The node sets of the TreeSoft Set of level 𝑚 are:

Tree( 𝐴) = { 𝐴𝑖1 | 𝑖1 = 1, 2, . . . }

If the graph-tree has only two levels (i.e., 𝑚 = 2), then the TreeSoft Set reduces to a MultiSoft Set.
Definition 18 (TreeSoft Graph). Let 𝑈 be a universe of discourse, and let 𝐻 be a non-empty subset of 𝑈,
representing the possible vertices of a graph. Let 𝑃(𝐻) denote the power set of 𝐻.
Let 𝐴 = { 𝐴1 , 𝐴2 , . . . , 𝐴𝑛 } be a set of attributes, where each 𝐴𝑖 is a first-level attribute. Each attribute
𝐴𝑖 can be further subdivided into sub-attributes, forming a hierarchical structure:

𝐴𝑖 = {𝐴𝑖, 1 , 𝐴𝑖, 2 , . . . } for 𝑖 = 1, 2, . . . , 𝑛

Each sub-attribute 𝐴𝑖, 𝑗 can be further divided into sub-sub-attributes 𝐴𝑖, 𝑗,𝑘 , and so on, up to level 𝑚.
This hierarchical structure forms a graph-tree, denoted as Tree( 𝐴), rooted at 𝐴 and extending to nodes at levels
1 through 𝑚.
A TreeSoft Graph is defined via two functions:

1. Vertex Function 𝐹𝑉 : 𝑃(Tree( 𝐴)) → 𝑃(𝐻):

• 𝐹𝑉 maps subsets of the attribute tree Tree( 𝐴) to subsets of 𝐻 (vertices).
2. Edge Function 𝐹𝐸 : 𝑃(Tree( 𝐴)) → 𝑃(𝐻 × 𝐻):
• 𝐹𝐸 maps subsets of the attribute tree Tree( 𝐴) to subsets of 𝐻 × 𝐻 (edges).

Thus, the TreeSoft Graph 𝐺 = (𝐹𝑉 , 𝐹𝐸 ) represents a graph whose vertices and edges are defined based
on hierarchical attributes, capturing complex relationships in a structured manner.
Definition 19 (SuperHyperSoft Set). [163] Let 𝑈 be a universe of discourse, and let 𝑃(𝑈) denote the power
set of 𝑈. Let 𝑎 1 , 𝑎 2 , . . . , 𝑎 𝑛 be 𝑛 distinct attributes, where 𝑛 ≥ 1. Each attribute 𝑎 𝑖 has a corresponding set of
attribute values 𝐴𝑖 , with the property that 𝐴𝑖 ∩ 𝐴 𝑗 = ∅ for all 𝑖 ≠ 𝑗.
Let 𝑃( 𝐴𝑖 ) denote the power set of 𝐴𝑖 for each 𝑖 = 1, 2, . . . , 𝑛.
Then, the pair (𝐹, 𝑃( 𝐴1 ) × 𝑃( 𝐴2 ) × · · · × 𝑃( 𝐴𝑛 )), where

𝐹 : 𝑃( 𝐴1 ) × 𝑃( 𝐴2 ) × · · · × 𝑃( 𝐴𝑛 ) → 𝑃(𝑈),

is called a SuperHyperSoft Set over 𝑈.

9
Definition 20 (SuperHyperSoft Graph). Let 𝐺 = (𝑉, 𝐸) be a graph, where 𝑉 is the set of vertices and 𝐸 is the
set of edges. Let 𝑈 = 𝑉 ∪ 𝐸, and let 𝑃(𝑈) denote the power set of 𝑈.
Let 𝑎 1 , 𝑎 2 , . . . , 𝑎 𝑛 be 𝑛 distinct attributes, each with a corresponding set of attribute values 𝐴𝑖 , such that
𝐴𝑖 ∩ 𝐴 𝑗 = ∅ for all 𝑖 ≠ 𝑗.
Let 𝑃( 𝐴𝑖 ) denote the power set of 𝐴𝑖 for each 𝑖 = 1, 2, . . . , 𝑛.
Define two functions:
1. Vertex Function:
𝐹𝑉 : 𝑃( 𝐴1 ) × 𝑃( 𝐴2 ) × · · · × 𝑃( 𝐴𝑛 ) → 𝑃(𝑉),
which maps combinations of attribute value subsets to subsets of vertices.
2. Edge Function:
𝐹𝐸 : 𝑃( 𝐴1 ) × 𝑃( 𝐴2 ) × · · · × 𝑃( 𝐴𝑛 ) → 𝑃(𝐸),
which maps combinations of attribute value subsets to subsets of edges.
Then, the pair (𝐹𝑉 , 𝐹𝐸 ) is called a SuperHyperSoft Graph over 𝐺.
Theorem 21. The SuperHyperSoft Graph generalizes both the HyperSoft Graph and the general Graph. Specif-
ically:
1. Every HyperSoft Graph is a special case of a SuperHyperSoft Graph.
2. Every general Graph can be represented as a SuperHyperSoft Graph.
Proof. We will prove the two aspects stated in the theorem in sequence.
1. SuperHyperSoft Graph generalizes the HyperSoft Graph:
Recall that in a HyperSoft Graph, the attribute functions are defined over the Cartesian product of attribute
value sets 𝐴1 × 𝐴2 × · · · × 𝐴𝑛 .
In the SuperHyperSoft Graph, the domain of the functions 𝐹𝑉 and 𝐹𝐸 is extended to the Cartesian product
of the power sets 𝑃( 𝐴1 ) × 𝑃( 𝐴2 ) × · · · × 𝑃( 𝐴𝑛 ).
Since each attribute value set 𝐴𝑖 is a subset of its power set 𝑃( 𝐴𝑖 ) (specifically, 𝐴𝑖 ⊆ 𝑃( 𝐴𝑖 )), any
function defined on 𝐴1 × 𝐴2 × · · · × 𝐴𝑛 can be considered as a function defined on 𝑃( 𝐴1 ) × 𝑃( 𝐴2 ) × 𝑃( 𝐴𝑛 ) by
restricting the domain to singleton subsets.
Therefore, every HyperSoft Graph is a SuperHyperSoft Graph where the functions 𝐹𝑉 and 𝐹𝐸 are defined
only on singleton subsets of attribute values.
2. SuperHyperSoft Graph generalizes the general Graph:
Any graph 𝐺 = (𝑉, 𝐸) can be represented as a SuperHyperSoft Graph by defining trivial attributes and
functions.
Let us consider the simplest case with a single attribute 𝑎 1 and a corresponding attribute value set 𝐴1 =
{∗}. Then, the power set 𝑃( 𝐴1 ) = {∅, {∗}}.
Define the functions:
• 𝐹𝑉 : 𝑃( 𝐴1 ) → 𝑃(𝑉) by:
– 𝐹𝑉 (∅) = ∅,
– 𝐹𝑉 ({∗}) = 𝑉.
• 𝐹𝐸 : 𝑃( 𝐴1 ) → 𝑃(𝐸) by:
– 𝐹𝐸 (∅) = ∅,
– 𝐹𝐸 ({∗}) = 𝐸.
Thus, the SuperHyperSoft Graph (𝐹𝑉 , 𝐹𝐸 ) represents the entire graph 𝐺. ƒ

Funding
This research did not receive any external funding.

Acknowledgments
I sincerely thank everyone who offered their invaluable support, making the completion of this paper
possible. I also extend my gratitude to the readers for their time and interest.

10
Data Availability
The datasets generated or analyzed during this study are not publicly accessible due to privacy concerns
but can be requested from the corresponding author, subject to reasonable conditions.

Ethical Approval
This article does not involve any studies with human participants or animals.

Conflicts of Interest
The authors declare no conflicts of interest related to the publication of this paper.

Disclaimer
Please note that this work is a preprint and has not undergone peer review. As I am an independent
researcher, I ask for your understanding.
The findings and interpretations in this paper are subject to change as the field continues to evolve.
Readers are encouraged to review future publications for the most up-to-date developments.
The authors have made every effort to accurately reference all sources used in this work. Any discrep-
ancies or omissions are unintentional, and the authors welcome corrections.

References
[1] Mujahid Abbas, Ghulam Murtaza, and Florentin Smarandache. Basic operations on hypersoft sets and hypersoft point.
Neutrosophic Sets and Systems, 35:407–421, 2020.
[2] Admin Admin and Abdalla I. Abdalla Musa. Automated credit card risk assessment using fuzzy parameterized neutro-
sophic hypersoft expert set. International Journal of Neutrosophic Science.
[3] Uzma Ahmad and Muhammad Sabir. Multicriteria decision-making based on the degree and distance-based indices of
fuzzy graphs. Granular Computing, 8(4):793–807, 2023.
[4] Muhammad Akram and Noura Omair Alshehri. Intuitionistic fuzzy cycles and intuitionistic fuzzy trees. The Scientific
World Journal, 2014(1):305836, 2014.
[5] Muhammad Akram, Feng Feng, Shahzad Sarwar, and Youne Bae Jun. Certain types of vague graphs. University
Politehnica of Bucharest Scientific Bulletin Series A, 76(1):141–154, 2014.
[6] Muhammad Akram, A Nagoor Gani, and A Borumand Saeid. Vague hypergraphs. Journal of Intelligent & Fuzzy
Systems, 26(2):647–653, 2014.
[7] Muhammad Akram, Hafsa M Malik, Sundas Shahzadi, and Florentin Smarandache. Neutrosophic soft rough graphs
with application. Axioms, 7(1):14, 2018.
[8] Muhammad Akram and Saira Nawaz. Operations on soft graphs. Fuzzy Information and Engineering, 7:423 – 449,
2015.
[9] Muhammad Akram and Saira Nawaz. Fuzzy soft graphs with applications. Journal of Intelligent & Fuzzy Systems,
30(6):3619–3632, 2016.
[10] Muhammad Akram, Danish Saleem, and Talal Al-Hawary. Spherical fuzzy graphs with application to decision-making.
Mathematical and Computational Applications, 25(1):8, 2020.
[11] Muhammad Akram and Gulfam Shahzadi. Operations on single-valued neutrosophic graphs. Infinite Study, 2017.
[12] Muhammad Akram, Fariha Zafar, Muhammad Akram, and Fariha Zafar. Fuzzy soft graphs. Hybrid Soft Computing
Models Applied to Graph Theory, pages 211–259, 2020.
[13] Yousef Al-Qudah and Nasruddin Hassan. Bipolar fuzzy soft expert set and its application in decision making. Int. J.
Appl. Decis. Sci., 10:175–191, 2017.
[14] Ashraf Al-Quran and Nasruddin Hassan. Neutrosophic vague soft expert set theory. J. Intell. Fuzzy Syst., 30:3691–3702,
2016.
[15] José Carlos R Alcantud, Azadeh Zahedi Khameneh, Gustavo Santos-García, and Muhammad Akram. A systematic
literature review of soft set theory. Neural Computing and Applications, 36(16):8951–8975, 2024.
[16] M Irfan Ali, Feng Feng, Xiaoyan Liu, Won Keun Min, and Muhammad Shabir. On some new operations in soft set
theory. Computers & Mathematics with Applications, 57(9):1547–1553, 2009.
[17] Shawkat Alkhazaleh and Abdul Razak Salleh. Soft expert sets. Adv. Decis. Sci., 2011:757868:1–757868:12, 2011.
[18] Shawkat Alkhazaleh and Abdul Razak Salleh. Fuzzy soft expert set and its application. Applied Mathematics-a Journal
of Chinese Universities Series B, 5:1349–1368, 2014.

11
[19] Umair Amin, Aliya Fahmi, Yaqoob Naveed, Aqsa Farid, and Muhammad Arshad Shehzad Hassan. Domination in
bipolar fuzzy soft graphs. J. Intell. Fuzzy Syst., 46:6369–6382, 2024.
[20] Shabana Anwar, Muhammad Azeem, and Muhammad Kamran Jamil. Topological numbers of fuzzy soft graphs and
their applications in globalizing the world by mutual trade. Appl. Soft Comput., 159:111642, 2024.
[21] Büra Ayan, Seda Abac?o?lu, and Márcio Pereira Basílio. A comprehensive review of the novel weighting methods for
multi-criteria decision-making. Inf., 14:285, 2023.
[22] Muhammad Azeem, Shabana Anwar, Muhammad Kamran Jamil, Muhammad Haris Saeed, and Muhammet Deveci.
Topological numbers of fuzzy soft graphs and their application. Inf. Sci., 667:120468, 2024.
[23] Wenhui Bai, Juanjuan Ding, and Chao Zhang. Dual hesitant fuzzy graphs with applications to multi-attribute decision
making. International Journal of Cognitive Computing in Engineering, 1:18–26, 2020.
[24] T Bharathi, S Felixia, and S Leo. Intuitionistic felicitous fuzzy graphs.
[25] Anushree Bhattacharya and Madhumangal Pal. A fuzzy graph theory approach to the facility location problem: A case
study in the indian banking system. Mathematics, 11(13):2992, 2023.
[26] John Adrian Bondy, Uppaluri Siva Ramachandra Murty, et al. Graph theory with applications, volume 290. Macmillan
London, 1976.
[27] RA Borzooei and HOSSEIN RASHMANLOU. Degree of vertices in vague graphs. Journal of applied mathematics
& informatics, 33(5_6):545–557, 2015.
[28] RA Borzooei and Hossein Rashmanlou. More results on vague graphs. UPB Sci. Bull. Ser. A, 78(1):109–122, 2016.
[29] Rajab Ali Borzooei, Hossein Rashmanlou, Sovan Samanta, and Madhumangal Pal. Regularity of vague graphs. Journal
of Intelligent & Fuzzy Systems, 30(6):3681–3689, 2016.
[30] Andreas Brandstädt, Van Bang Le, and Jeremy P Spinrad. Graph classes: a survey. SIAM, 1999.
[31] Alain Bretto. Hypergraph theory. An introduction. Mathematical Engineering. Cham: Springer, 1, 2013.
[32] Said Broumi, Mohamed Talea, Assia Bakali, and Florentin Smarandache. Interval valued neutrosophic graphs. Critical
Review, XII, 2016:5–33, 2016.
[33] P Chellamani, D Ajay, Mohammed M Al-Shamiri, and Rashad Ismail. Pythagorean Neutrosophic Planar Graphs with
an Application in Decision-Making. Infinite Study, 2023.
[34] P. Chellamani, D. Ajay, Said Broumi, and T. Antony Alphonnse Ligori. An approach to decision-making via picture
fuzzy soft graphs. Granular Computing, 7:527 – 548, 2021.
[35] P Chellamani, D Ajay, Said Broumi, and T Antony Alphonse Ligori. An approach to decision-making via picture fuzzy
soft graphs. Granular computing, pages 1–22, 2021.
[36] S Robinson Chellathurai and L Jesmalar. Core in rough graph and weighted rough graph. International Journal of
Contemporary Mathematical Sciences, 11(6):251–265, 2016.
[37] Sujit Das and Samarjit Kar. Intuitionistic multi fuzzy soft set and its application in decision making. In Pattern
Recognition and Machine Intelligence: 5th International Conference, PReMI 2013, Kolkata, India, December 10-14,
2013. Proceedings 5, pages 587–592. Springer, 2013.
[38] Suman Das, Rakhal Das, and Surapati Pramanik. Single valued pentapartitioned neutrosophic graphs. Neutrosophic
Sets and Systems, 50(1):225–238, 2022.
[39] Somen Debnath. Fuzzy hypersoft sets and its weightage operator for decision making. 2021.
[40] R Aruna Devi and K Anitha. Construction of rough graph to handle uncertain pattern from an information system.
arXiv preprint arXiv:2205.10127, 2022.
[41] G. Dhanalakshmi, S. Sandhiya, and Florentin Smarandache. Selection of the best process for desalination under a
treesoft set environment using the multi-criteria decision-making method. International Journal of Neutrosophic Sci-
ence, 2024.
[42] Reinhard Diestel. Graduate texts in mathematics: Graph theory.
[43] Reinhard Diestel. Graph theory 3rd ed. Graduate texts in mathematics, 173(33):12, 2005.
[44] Reinhard Diestel. Graph theory. Springer (print edition); Reinhard Diestel (eBooks), 2024.
[45] Umm e Habiba and Sohail Asghar. A survey on multi-criteria decision making approaches. 2009 International Con-
ference on Emerging Technologies, pages 321–325, 2009.
[46] Ronald C. Freiwald. An introduction to set theory and topology. 2014.
[47] Takaaki Fujita. Antipodal turiyam graphs.
[48] Takaaki Fujita. Neutrosophic circular-arc graphs and proper circular-arc graphs.

12
[49] Takaaki Fujita. Bipolar turiyam graph and interval-valued turiyam graph, June 2024.
[50] Takaaki Fujita. Bunch graph in fuzzy, neutrosophic, and plithogenic graphs, June 2024. Preprint, File available.
[51] Takaaki Fujita. Claw-free graph and at-free graph in fuzzy, neutrosophic, and plithogenic graphs, June 2024. License:
CC BY 4.0.
[52] Takaaki Fujita. Contact graphs in fuzzy and neutrosophic graphs. Preprint, May 2024, File available, 2024.
[53] Takaaki Fujita. Domination number and chromatic number in turiyam and plithogenic graphs, July 2024. License: CC
BY 4.0.
[54] Takaaki Fujita. Extension of bipolar, interval-valued, and complex neutrosophic soft expert graphs to general
plithogenic soft rough expert mixed graphs. July 2024.
[55] Takaaki Fujita. General plithogenic soft rough graphs and some related graph classes, June 2024. License: CC BY 4.0.
[56] Takaaki Fujita. Interval graphs and proper interval graphs in fuzzy and neutrosophic graphs. Preprint, July 2024, File
available, 2024.
[57] Takaaki Fujita. Mixed graph in fuzzy, neutrosophic, and plithogenic graphs. June 2024.
[58] Takaaki Fujita. Permutation graphs in fuzzy and neutrosophic graphs. Preprint, July 2024. File available.
[59] Takaaki Fujita. Plithogenic line graph, star graph, and regular graph. Journal of Graph Structures and Applications,
2024.
[60] Takaaki Fujita. Pythagorean, fermatean, and complex turiyam graphs: Relations with general plithogenic graphs, June
2024. License: CC BY 4.0.
[61] Takaaki Fujita. A review of the hierarchy of plithogenic, neutrosophic, and fuzzy graphs: Survey and applications.
ResearchGate(Preprint), 2024.
[62] Takaaki Fujita. Short note of even-hole-graph for uncertain graph. Uncertain Graph Theory Journal, 2024.
[63] Takaaki Fujita. Some graph classes for turiyam directed graphs and pentapartitioned neutrosophic directed graphs.
Journal of Advanced Graph Theory, 2024.
[64] Takaaki Fujita. Some graph structures in fuzzy, neutrosophic, and plithogenic graphs. 2024.
[65] Takaaki Fujita. Study for general plithogenic soft expert graphs. June 2024. License CC BY 4.0.
[66] Takaaki Fujita. Survey of intersection graphs, fuzzy graphs and neutrosophic graphs. ResearchGate, July 2024.
[67] Takaaki Fujita. Survey of planar and outerplanar graphs in fuzzy and neutrosophic graphs. ResearchGate, July 2024.
[68] Takaaki Fujita. Survey of trees, forests, and paths in fuzzy and neutrosophic graphs. July 2024.
[69] Takaaki Fujita. Uncertain automata and uncertain graph grammar, June 2024. License CC BY 4.0.
[70] Takaaki Fujita. Uncertain labeling graphs and uncertain graph classes (with survey for various uncertain sets). July
2024.
[71] Takaaki Fujita. Unit disk graphs in fuzzy and neutrosophic graphs. June 2024. Available under CC BY 4.0 license.
[72] Takaaki Fujita. Vague soft expert graph and complex fuzzy soft expert graph. ResearchGate, June 2024. License CC
BY 4.0.
[73] Takaaki Fujita. Various properties of various ultrafilters, various graph width parameters, and various connectivity
systems. arXiv preprint arXiv:2408.02299, 2024.
[74] GA Ganati, VNS Rao Repalle, MA Ashebo, and M Amini. Turiyam graphs and its applications. Information Sciences
Letters, 12(6):2423–2434, 2023.
[75] Gamachu Adugna Ganati, VN Srinivasa Rao Repalle, and Mamo Abebe Ashebo. Social network analysis by turiyam
graphs. BMC Research Notes, 16(1):170, 2023.
[76] Gamachu Adugna Ganati, VN Srinivasa Rao Repalle, and Mamo Abebe Ashebo. Relations in the context of turiyam
sets. BMC Research Notes, 16(1):49, 2023.
[77] A Nagoor Gani and K Radha. On regular fuzzy graphs. 2008.
[78] Masoud Ghods, Zahra Rostami, and Florentin Smarandache. Introduction to neutrosophic restricted superhypergraphs
and neutrosophic restricted superhypertrees and several of their properties. Neutrosophic Sets and Systems, 50:480–487,
2022.
[79] Daniela Gifu. Soft sets extensions: Innovating healthcare claims analysis. Applied Sciences, 14(19):8799, 2024.
[80] Puspendu Giri, Somnath Paul, and Bijoy Krishna Debnath. A fuzzy graph theory and matrix approach (fuzzy gtma) to
select the best renewable energy alternative in india. Applied Energy, 358:122582, 2024.

13
[81] Zengtai Gong and Junhu Wang. Hesitant fuzzy graphs, hesitant fuzzy hypergraphs and fuzzy graph decisions. Journal
of Intelligent & Fuzzy Systems, 40(1):865–875, 2021.
[82] Georg Gottlob, Nicola Leone, and Francesco Scarcello. Hypertree decompositions and tractable queries. In Proceedings
of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pages 21–32, 1999.
[83] Georg Gottlob, Nicola Leone, and Francesco Scarcello. Hypertree decompositions: A survey. In Mathematical Foun-
dations of Computer Science 2001: 26th International Symposium, MFCS 2001 Mariánské Lázne, Czech Republic,
August 27–31, 2001 Proceedings 26, pages 37–57. Springer, 2001.
[84] Georg Gottlob and Reinhard Pichler. Hypergraphs in model checking: Acyclicity and hypertree-width versus clique-
width. SIAM Journal on Computing, 33(2):351–378, 2004.
[85] Salvatore Greco, Benedetto Matarazzo, and Roman Slowinski. Rough sets theory for multicriteria decision analysis.
European journal of operational research, 129(1):1–47, 2001.
[86] Jonathan L Gross, Jay Yellen, and Mark Anderson. Graph theory and its applications. Chapman and Hall/CRC, 2018.
[87] Muhammad Gulistan, Naveed Yaqoob, Zunaira Rashid, Florentin Smarandache, and Hafiz Abdul Wahab. A study on
neutrosophic cubic graphs with real life applications in industries. Symmetry, 10(6):203, 2018.
[88] Mohammad Hamidi, Florentin Smarandache, and Elham Davneshvar. Spectrum of superhypergraphs via flows. Jour-
nal of Mathematics, 2022(1):9158912, 2022.
[89] Mohammad Hamidi, Florentin Smarandache, and Mohadeseh Taghinezhad. Decision Making Based on Valued Fuzzy
Superhypergraphs. Infinite Study, 2023.
[90] Mohammad Hamidi and Mohadeseh Taghinezhad. Application of Superhypergraphs-Based Domination Number in
Real World. Infinite Study, 2023.
[91] Felix Hausdorff. Set theory, volume 119. American Mathematical Soc., 2021.
[92] Khizar Hayat, Muhammad Irfan Ali, Bing yuan Cao, and Xiaopeng Yang. A new type-2 soft set: Type-2 soft graphs
and their applications. Adv. Fuzzy Syst., 2017:6162753:1–6162753:17, 2017.
[93] Tong He, Yong Chen, and Kaiquan Shi. Weighted rough graph and its application. In Sixth International Conference
on Intelligent Systems Design and Applications, volume 1, pages 486–491. IEEE, 2006.
[94] Karel Hrbacek and Thomas Jech. Introduction to set theory, revised and expanded. 2017.
[95] Liangsong Huang, Yu Hu, Yuxia Li, PK Kishore Kumar, Dipak Koley, and Arindam Dey. A study of regular and
irregular neutrosophic graphs with real life applications. Mathematics, 7(6):551, 2019.
[96] R. Jahir Hussain and M. S. Afya Farhana. Fuzzy chromatic number of fuzzy soft cycle and complete fuzzy soft graphs.
AIP Conference Proceedings, 2023.
[97] S Satham Hussain, N Durga, Muhammad Aslam, G Muhiuddin, and Ganesh Ghorai. New concepts on quadripartitioned
neutrosophic competition graph with application. International Journal of Applied and Computational Mathematics,
10(2):57, 2024.
[98] S Satham Hussain, Hossein Rashmonlou, R Jahir Hussain, Sankar Sahoo, Said Broumi, et al. Quadripartitioned neu-
trosophic graph structures. Neutrosophic Sets and Systems, 51(1):17, 2022.
[99] Muhammad Ihsan, Atiqe Ur Rahman, and Muhammad Haris Saeed. Fuzzy hypersoft expert set with application in
decision making for the best selection of product. 2021.
[100] Muhammad Ihsan, Atiqe Ur Rahman, and Muhammad Haris Saeed. Hypersoft expert set with application in decision
making for recruitment process. 2021.
[101] Muhammad Ihsan, Atiqe Ur Rahman, and Muhammad Haris Saeed. Single valued neutrosophic hypersoft expert set
with application in decision making. 2021.
[102] Muhammad Ihsan, Muhammad Haris Saeed, Agaeb Mahal Alanzi, and Hamiden Abd El-Wahed Khalifa. An algorith-
mic multiple attribute decision-making method for heart problem analysis under neutrosophic hypersoft expert set with
fuzzy parameterized degree-based setting. PeerJ Computer Science, 9, 2023.
[103] Muhammad Ihsan, Muhammad Haris Saeed, Alhanouf Alburaikan, and Hamiden A. Wahed Khalifa. Product evaluation
through multi-criteria decision making based on fuzzy parameterized pythagorean fuzzy hypersoft expert set. AIMS
Mathematics, 2022.
[104] Muhammad Ihsan, Muhammad Haris Saeed, and Atiqe Ur Rahman. An intuitionistic fuzzy hypersoft expert set-based
robust decision-support framework for human resource management integrated with modified topsis and correlation
coefficient. Neural Computing and Applications, pages 1–25, 2023.
[105] Muhammad Ihsan, Muhammad Haris Saeed, Atiqe Ur Rahman, Hüseyin Kamac, Nehad Ali Shah, and Wajaree Weera.
An madm-based fuzzy parameterized framework for solar panels evaluation in a fuzzy hypersoft expert set environment.
AIMS Mathematics, 2022.

14
[106] Muhammad Ihsan, Muhammad Haris Saeed, Atiqe Ur Rahman, Hamiden A. Wahed Khalifa, and Salwa El-Morsy. An
intelligent fuzzy parameterized multi-criteria decision-support system based on intuitionistic fuzzy hypersoft expert set
for automobile evaluation. Advances in Mechanical Engineering, 14, 2022.
[107] Chiranjibe Jana, Tapan Senapati, Monoranjan Bhowmik, and Madhumangal Pal. On intuitionistic fuzzy g-subalgebras
of g-algebras. Fuzzy Information and Engineering, 7(2):195–209, 2015.
[108] Thomas Jech. Set theory: The third millennium edition, revised and expanded. Springer, 2003.
[109] Vasantha Kandasamy, K Ilanthenral, and Florentin Smarandache. Neutrosophic graphs: a new dimension to graph
theory. Infinite Study, 2015.
[110] M. G. Karunambigai, R. Parvathi, and R. Buvaneswari. Arc in intuitionistic fuzzy graphs. Notes on Intuitionistic Fuzzy
Sets, 17:37–47, 2011.
[111] Waheed Ahmad Khan, Waqar Arif, Quoc Hung Nguyen, Thanh Trung Le, and Hai Van Pham. Picture fuzzy di-
rected hypergraphs with applications toward decision-making and managing hazardous chemicals. IEEE Access,
12:87816–87827, 2024.
[112] Ali NA Koam, Muhammad Akram, and Peide Liu. Decision-making analysis based on fuzzy graph structures. Math-
ematical Problems in Engineering, 2020(1):6846257, 2020.
[113] Azriel Levy. Basic set theory. Courier Corporation, 2012.
[114] Pradip Kumar Maji, Ranjit Biswas, and A Ranjan Roy. Soft set theory. Computers & mathematics with applications,
45(4-5):555–562, 2003.
[115] Nivetha Martin and Florentin Smarandache. Introduction to combined plithogenic hypersoft sets. Neutrosophic Sets
and Systems, 35:503–510, 2020.
[116] Mona Mohamed, Alaa Elmor, Florentin Smarandache, and Ahmed A Metwaly. An efficient superhypersoft framework
for evaluating llms-based secure blockchain platforms. Neutrosophic Sets and Systems, 72:1–21, 2024.
[117] Dmitriy Molodtsov. Soft set theory-first results. Computers & mathematics with applications, 37(4-5):19–31, 1999.
[118] John N Mordeson and Sunil Mathew. Advanced topics in fuzzy graph theory, volume 375. Springer, 2019.
[119] Sunil MP and J Suresh Kumar. On intuitionistic hesitancy fuzzy graphs. 2024.
[120] Sagvan Y. Musa and Baravan A. Asaad. Bipolar hypersoft sets. Mathematics, 2021.
[121] Sagvan Y. Musa and Baravan A. Asaad. Topological structures via bipolar hypersoft sets. Journal of Mathematics,
2022.
[122] R Noor, I Irshad, and I Javaid. Soft rough graphs. arXiv preprint arXiv:1707.05837, 2017.
[123] János Pach. Geometric graph theory. Handbook of Discrete and Computational Geometry, 2nd Ed., pages 219–238,
2004.
[124] Madhumangal Pal, Sovan Samanta, and Ganesh Ghorai. Modern trends in fuzzy graph theory. Springer, 2020.
[125] Sakshi Dev Pandey, AS Ranadive, and Sovan Samanta. Bipolar-valued hesitant fuzzy graph and its application. Social
Network Analysis and Mining, 12(1):14, 2022.
[126] Paolo Paolo. A study using treesoft set and neutrosophic sets on possible soil organic transformations in urban agricul-
ture systems. International Journal of Neutrosophic Science.
[127] T Pathinathan, J Jon Arockiaraj, and J Jesintha Rosline. Hesitancy fuzzy graphs. Indian Journal of Science and
Technology, 8(35):1–5, 2015.
[128] Vasile Patrascu. Rough sets on four-valued fuzzy approximation space. In 2007 IEEE International Fuzzy Systems
Conference, pages 1–5. IEEE, 2007.
[129] Zdzislaw Pawlak. Rough set theory and its applications to data analysis. Cybernetics & Systems, 29(7):661–688, 1998.
[130] Zdzislaw Pawlak, Lech Polkowski, and Andrzej Skowron. Rough set theory. KI, 15(3):38–39, 2001.
[131] Zdzisław Pawlak and Andrzej Skowron. Rudiments of rough sets. Information sciences, 177(1):3–27, 2007.
[132] Nicole Pearcy, Jonathan J Crofts, and Nadia Chuzhanova. Hypergraph models of metabolism. International Journal
of Biological, Veterinary, Agricultural and Food Engineering, 8(8):752–756, 2014.
[133] Sriram Pemmaraju and Steven Skiena. Computational discrete mathematics: Combinatorics and graph theory with
mathematica®. Cambridge university press, 2003.
[134] Surapati Pramanik, Partha Pratim Dey, and Bibhas Chandra Giri. Topsis for single valued neutrosophic soft expert set
based multi-attribute decision making problems. 2015.
[135] Shio Gai Quek, Ganeshsree Selvachandran, D Ajay, P Chellamani, David Taniar, Hamido Fujita, Phet Duong, Le Hoang
Son, and Nguyen Long Giang. New concepts of pentapartitioned neutrosophic graphs and applications for determining
safest paths and towns in response to covid-19. Computational and Applied Mathematics, 41(4):151, 2022.

15
[136] Atiqe Ur Rahman, Muhammad Haris Saeed, Ebenezer Bonyah, and Muhammad Arshad. Graphical exploration of gen-
eralized picture fuzzy hypersoft information with application in human resource management multiattribute decision-
making. Mathematical Problems in Engineering, 2022.
[137] Atiqe Ur Rahman, Muhammad Haris Saeed, and Florentin Smarandache. Convex and concave hypersoft sets with
some properties. 2020.
[138] Yongsheng Rao, Saeed Kosari, and Zehui Shao. Certain properties of vague graphs with a novel application. Mathe-
matics, 8(10):1647, 2020.
[139] Hossein Rashmanlou and Rajab Ali Borzooei. Vague graphs with application. Journal of Intelligent & Fuzzy Systems,
30(6):3291–3299, 2016.
[140] Jafar Rezaei. Best-worst multi-criteria decision-making method. Omega-international Journal of Management Science,
53:49–57, 2015.
[141] David W Roberts. Analysis of forest succession with fuzzy graph theory. Ecological Modelling, 45(4):261–274, 1989.
[142] Azriel Rosenfeld. Fuzzy graphs. In Fuzzy sets and their applications to cognitive and decision processes, pages 77–95.
Elsevier, 1975.
[143] Muhammad Saeed, Muhammad Imran Harl, Muhammad Haris Saeed, and Ibrahim Mekawy. Theoretical framework
for a decision support system for micro-enterprise supermarket investment risk assessment using novel picture fuzzy
hypersoft graph. Plos one, 18(3):e0273642, 2023.
[144] Muhammad Saeed, Atiqe Ur Rahman, and Muhammad Arshad. A study on some operations and products of neutro-
sophic hypersoft graphs. Journal of Applied Mathematics and Computing, 68(4):2187–2214, 2022.
[145] Muhammad Saeed, Muhammad Amad Sarwar, Atiqe Ur Rahman, and Sana Naz. Representation of fuzzy hypersoft
set in graphs. Palestine journal of mathematics, 12(1):836–847, 2023.
[146] Muhammad Saeed, Muhammad Khubab Siddique, Muhammad Ahsan, Muhammad Rayees Ahmad, and Atiqe Ur
Rahman. A novel approach to the rudiments of hypersoft graphs. Theory and Application of Hypersoft Set, Pons
Publication House, Brussel, pages 203–214, 2021.
[147] Muhammad Haris Saeed, Atiqe Ur Rahman, and Muhammad Arshad. A novel approach to neutrosophic hypersoft
graphs with properties. 2021.
[148] Muhammad Haris Saeed, Atiqe Ur Rahman, and Muhammad Arshad. A novel approach to neutrosophic hypersoft
graphs with properties. 2021.
[149] Mehmet Sahin, Shawkat Alkhazaleh, and Vakkas Ulucay. Neutrosophic soft expert sets. Applied Mathematics-a
Journal of Chinese Universities Series B, 06:116–127, 2015.
[150] Mehmet Sahin and Vakkas Ulucay. Fuzzy soft expert graphs with application. Asian Journal of Mathematics and
Computer Research, pages 216?229–216?229, 2019.
[151] Rıdvan Şahin. An approach to neutrosophic graph theory with applications. Soft Computing, 23(2):569–581, 2019.
[152] Sovan Samanta, Madhumangal Pal, Hossein Rashmanlou, and Rajab Ali Borzooei. Vague graphs and strengths. Journal
of Intelligent & Fuzzy Systems, 30(6):3675–3680, 2016.
[153] Muhammad Saqlain, Naveed Jafar, Sana Moin, Muhammad Farhan Saeed, and Said Broumi. Single and multi-valued
neutrosophic hypersoft set and tangent similarity measure of single valued neutrosophic hypersoft sets. Neutrosophic
Sets and Systems, 32:20, 2020.
[154] Sundas Shahzadi, Musavarah Sarwar, and Muhammad Akram. Decision-making approach with fuzzy type-2 soft
graphs. Journal of Mathematics, 2020(1):8872446, 2020.
[155] R. Sivasamy and M. Mohammed Jabarulla. Products on interval valued pythagorean fuzzy soft graphs. Journal of
Interdisciplinary Mathematics, 2024.
[156] Florentin Smarandache. A unifying field in logics: Neutrosophic logic. In Philosophy, pages 1–141. American Research
Press, 1999.
[157] Florentin Smarandache. Neutrosophic set-a generalization of the intuitionistic fuzzy set. International journal of pure
and applied mathematics, 24(3):287, 2005.
[158] Florentin Smarandache. Extension of soft set to hypersoft set, and then to plithogenic hypersoft set. Neutrosophic Sets
and Systems, 22:168–170, 2018.
[159] Florentin Smarandache. n-superhypergraph and plithogenic n-superhypergraph. Nidus Idearum, 7:107–113, 2019.
[160] Florentin Smarandache. Extension of HyperGraph to n-SuperHyperGraph and to Plithogenic n-SuperHyperGraph,
and Extension of HyperAlgebra to n-ary (Classical-/Neutro-/Anti-) HyperAlgebra. Infinite Study, 2020.
[161] Florentin Smarandache. Introduction to the n-SuperHyperGraph-the most general form of graph today. Infinite Study,
2022.
[162] Florentin Smarandache. Decision making based on valued fuzzy superhypergraphs. 2023.

16
 [163] Florentin Smarandache. Foundation of the superhypersoft set and the fuzzy extension superhypersoft set: A new vision.
Neutrosophic Systems with Applications, 11:48–51, 2023.
[164] Florentin Smarandache. New types of soft sets: Hypersoft set, indetermsoft set, indetermhypersoft set, and treesoft set.
International Journal of Neutrosophic Science, 2023.
[165] Florentin Smarandache. New types of soft sets” hypersoft set, indetermsoft set, indetermhypersoft set, and treesoft
set”: An improved version. Neutrosophic Systems with Applications, 2023.
[166] Florentin Smarandache. SuperHyperFunction, SuperHyperStructure, Neutrosophic SuperHyperFunction and Neutro-
sophic SuperHyperStructure: Current understanding and future directions. Infinite Study, 2023.
[167] Florentin Smarandache. Foundation of superhyperstructure & neutrosophic superhyperstructure. Neutrosophic Sets
and Systems, 63(1):21, 2024.
[168] Florentin Smarandache. Treesoft set vs. hypersoft set and fuzzy-extensions of treesoft sets. HyperSoft Set Methods in
Engineering, 2024.
[169] Florentin Smarandache and Said Broumi. Neutrosophic graph theory and algorithms. IGI Global, 2019.
[170] A Sudha and P Sundararajan. Robust fuzzy graph. Ratio Mathematica, 46, 2023.
[171] Hamed Taherdoost and Mitra Madanchian. Multi-criteria decision making (mcdm) methods and concepts. Encyclope-
dia, 2023.
[172] AL-Hawary Talal and Bayan Hourani. On intuitionistic product fuzzy graphs. Italian Journal of Pure and Applied
Mathematics, page 113.
[173] He Tong, Xue Peijun, and Shi Kaiquan. Application of rough graph in relationship mining. Journal of Systems
Engineering and Electronics, 19(4):742–747, 2008.
[174] Evangelos Triantaphyllou. Multi-criteria decision making methods: A comparative study. 2000.
[175] Vakkas Ulucay and Memet ahin. Intuitionistic fuzzy soft expert graphs with application. Uncertainty Discourse and
Applications, 1(1):1–10, 2024.
[176] Vakkas Uluçay and Memet Şahin. Intuitionistic fuzzy soft expert graphs with application. Uncertainty discourse and
applications, 1(1):1–10, 2024.
[177] Vakkas Uluçay, Mehmet Sahin, Said Broumi, Assia Bakali, Mohamed Talea, and Florentin Smarandache. Decision-
making method based on neutrosophic soft expert graphs. viXra, pages 33–76, 2016.
[178] Tong Wei, Junlin Hou, and Rui Feng. Fuzzy graph neural network for few-shot learning. In 2020 International joint
conference on neural networks (IJCNN), pages 1–8. IEEE, 2020.
[179] Douglas Brent West et al. Introduction to graph theory, volume 2. Prentice hall Upper Saddle River, 2001.
[180] Zeshui Xu. Hesitant fuzzy sets theory, volume 314. Springer, 2014.
[181] Xibei Yang, Dongjun Yu, Jingyu Yang, and Chen Wu. Generalization of soft set theory: from crisp to fuzzy case. In
Fuzzy Information and Engineering: Proceedings of the Second International Conference of Fuzzy Information and
Engineering (ICFIE), pages 345–354. Springer, 2007.
[182] Adem Yolcu, Florentin Smarandache, and Taha Yasin Ozturk. Intuitionistic fuzzy hypersoft sets. 2021.
[183] Lotfi A Zadeh. Fuzzy sets. Information and control, 8(3):338–353, 1965.
[184] Shouzhen Zeng, Muhammad Shoaib, Shahbaz Ali, Qamar Abbas, and Muhammad Shahzad Nadeem. Complex vague
graphs and their application in decision-making problems. IEEE access, 8:174094–174104, 2020.
[185] Ping Zhang and Gary Chartrand. Introduction to graph theory. Tata McGraw-Hill, 2:2–1, 2006.
[186] Hua Zhao, Zeshui Xu, Shousheng Liu, and Zhong Wang. Intuitionistic fuzzy mst clustering algorithms. Computers &
Industrial Engineering, 62(4):1130–1140, 2012.

17

View publication stats