Permutation graphs in Fuzzy and Neutrosophic Graphs

Takaaki Fujita1,* ,

Abstract: Graph theory is a fundamental branch of mathematics that examines networks composed of
nodes (vertices) and connections (edges). This paper explores the concepts of permutation graphs within the
frameworks of fuzzy, intuitionistic fuzzy, neutrosophic, and Turiyam graphs, all of which handle uncertainty in
graph structures. We define permutation and bipartite permutation graphs in each context and investigate their
properties. While permutation graphs have been studied extensively in classical graph theory, there has been
limited exploration in fuzzy and neutrosophic settings.
Keywords: Neutrosophic graph, Permutation graphs, Fuzzy graph, Intersection graphs

1. Introduction
1.1 Permutation graphs
Graph theory is a fundamental branch of mathematics that examines networks composed of nodes (ver-
tices) and connections (edges), which are essential for analyzing the structure, paths, and properties of these
networks [58]. One important example in graph theory is the intersection graph, where vertices correspond to
sets, and edges are drawn between vertices if their corresponding sets intersect [89,144,172]. Many related graph
classes have been extensively researched, such as interval graphs [82, 94], proper interval graphs [41, 105, 109],
weighted interval graphs [26, 43, 206], semi-proper interval graphs [168], mixed interval graphs [106–108], unit
disk graphs [23, 42, 44, 129], circular arc graphs [88, 103, 199], and polygon-circle graphs [128].
In this paper, we focus on permutation graphs [24, 32, 68], a specific type of intersection graph that
has garnered significant attention due to its practical applications and importance in the study of various graph
classes. Permutation graphs are defined such that vertices represent elements of a permutation, and edges connect
pairs of vertices if their corresponding elements in the permutation are reversed in order.
The following properties and statements hold.
Theorem 1. The following are known classes of graphs recognized as permutation graphs:

• Comparability graphs[92, 96, 122, 145]: Graphs where the vertices represent elements and edges exist if
they are comparable in a partial order.
• chordal comparability graphs[115, 140]: Chordal graph for comparability graphs.
• Co-comparability graphs[1, 139]: Graphs where the complement is a comparability graph, meaning ver-
tices are non-adjacent if they are comparable.
• Trapezoid graphs[47, 71, 135]: Intersection graphs of trapezoids between two parallel lines, generalizing
interval graphs.

Theorem 2. The following are known as generalized or related graph classes of permutation graphs:

• Circular permutation graphs[114, 164]: Circular permutation graphs are intersection graphs derived
from circular permutation diagrams, where edges represent intersecting chords between two circles.
• Bipartite permutation graphs [191,192]: A bipartite permutation graph is both bipartite and a permutation
graph, offering efficient solutions for certain NP-complete problems.
• Random permutation graphs [29,104]: A random permutation graph is formed by connecting two vertices
if their permutation order and index difference have opposite signs.
• Functi graphs [40,67,70]: Functigraphs generalize permutation graphs by connecting two disjoint copies
of a graph with additional edges defined by a function between their vertices.
• Split permutation graphs [127, 155]: Split permutation graphs are graphs that belong to both split and
permutation graph classes, combining properties of both.

1
 • Probe permutation graphs [38]: Probe permutation graphs are permutation graphs where vertices are
partitioned into probes and nonprobes, with additional edges only between certain nonprobes.
• Polar permutation graphs [64, 65]: Polar permutation graphs are permutation graphs where the vertex
set can be partitioned into two: one part forms a complete multipartite graph, the other forms disjoint
complete graphs.
• Connected permutation graphs[126]: Connected graph of permutation graphs.
• Double-threshold permutation graphs[120]: Double-threshold graphs are defined by two thresholds,
where vertex adjacency is based on the sum of their ranks falling in a specific ”YES” region.
• cycle permutation graphs[130,160]: Cycle permutation graphs represent graphs formed by cyclic permu-
tations, where vertices correspond to elements, and edges represent a specific cyclic permutation of these
elements.
• weighted permutation graphs[19, 165]: Weighted version of permutation graphs.
• 𝜋-Permutation Graphs[12]: A 𝜋-permutation graph is formed by connecting two disjoint copies of a graph
via a matching determined by a permutation 𝜋.
• Balanced Permutation Graphs[169]: A balanced permutation graph is a graph where vertices 𝑖 and 𝑗 are
adjacent if and only if 𝑖 + 𝑗 = 𝜋(𝑖) + 𝜋( 𝑗), based on a given permutation 𝜋.
• Permutation hypergraphs[119]: Hypergraph version of Permutation hypergraphs.

1.2 Fuzzy Graphs and Neutrosophic Graphs

In this paper, we examine Fuzzy Graphs, Intuitionistic Fuzzy Graphs, Neutrosophic Graphs, and Turiyam
Graphs. These graph concepts were developed to address uncertainty in real-world applications.
A fuzzy graph assigns a membership value between 0 and 1 to each vertex and edge, reflecting the
degree of uncertainty or imprecision [9,10,150,163]. In essence, fuzzy graphs serve as graphical representations
of fuzzy sets [61, 133, 207, 208], and are frequently applied in areas such as social networks, decision-making,
and transportation systems, where relationships are often uncertain or ambiguous [148, 163].
Intuitionistic Fuzzy Graphs expand upon fuzzy graphs by introducing both membership and non-membership
degrees for vertices and edges, thus further capturing the uncertainty inherent in relationships [86,125,153,157].
Neutrosophic Graphs [5, 8, 35, 78–81, 101, 116, 123, 166, 183, 186], derived from neutrosophic set theory
[13, 190], extend classical and fuzzy logic by incorporating three components: truth, indeterminacy, and falsity,
providing a more flexible approach to managing uncertainty.
Turiyam Graphs, introduced as a further extension of neutrosophic and fuzzy graphs, assign four at-
tributes—truth, indeterminacy, falsity, and a liberal state—to each vertex and edge [83–85].
Despite substantial advancements in the study of fuzzy and neutrosophic graphs, including their inter-
section variants (e.g., fuzzy intersection graphs [46,91,143,158,170] and neutrosophic intersection graphs [33]),
there has been relatively little exploration of permutation graphs within the frameworks of fuzzy, neutrosophic,
and Turiyam graphs.

1.3 Our Contribution

As mentioned above, extensive research has been conducted on Fuzzy Graphs, Intuitionistic Fuzzy
Graphs, Neutrosophic Graphs, and Turiyam Graphs. Similarly, there has been considerable work on permu-
tation graphs in the context of classic graph theory. In this paper, we define permutation graphs and bipartite
permutation graphs within the frameworks of Fuzzy Graphs (cf. [159]), Intuitionistic Fuzzy Graphs, Neutro-
sophic Graphs, and Turiyam Graphs, and examine their properties and relationships.

1.4 The Structure of the Paper

The format of this paper is described below.
1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.1 Permutation graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.2 Fuzzy Graphs and Neutrosophic Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . 2
1.3 Our Contribution . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2
1.4 The Structure of the Paper . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2
2 Preliminaries and definitions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
2.1 Basic Graph Concepts . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
2.2 Intersection graph and permutation graphs . . . . . . . . . . . . . . . . . . . . . . . . . 4
2.3 Permutation graph in Fuzzy Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5
2.4 Permutation graph in Intuitionistic fuzzy Graphs . . . . . . . . . . . . . . . . . . . . . 6

2
 2.5 Permutation graph in Neutrosophic Graphs . . . . . . . . . . . . . . . . . . . . . . . . 8
2.6 Permutation graph in Turiyam Graph . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
3 Result in this paper . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11
3.1 Property of Neutrosophic Permutation graph . . . . . . . . . . . . . . . . . . . . . . . 11
3.2 Relation of Neutrosophic Bipartite Graphs . . . . . . . . . . . . . . . . . . . . . . . . . 13

2. Preliminaries and definitions

In this section, we present a brief overview of the definitions and notations used throughout this paper.
We will specifically cover fundamental concepts related to graphs, including fuzzy graphs, intuitionistic fuzzy
graphs, Turiyam graphs, neutrosophic graphs.

2.1 Basic Graph Concepts

Here are a few basic graph concepts listed below. For more foundational graph concepts and notations,
please refer to [56, 57, 57, 58, 100, 203].
Definition 3 (Graph). [58] A graph 𝐺 is a mathematical structure consisting of a set of vertices 𝑉 (𝐺) and a set
of edges 𝐸 (𝐺) that connect pairs of vertices, representing relationships or connections between them. Formally,
a graph is defined as 𝐺 = (𝑉, 𝐸), where 𝑉 is the vertex set and 𝐸 is the edge set.
Definition 4 (Degree). [58] Let 𝐺 = (𝑉, 𝐸) be a graph. The degree of a vertex 𝑣 ∈ 𝑉, denoted deg(𝑣), is the
number of edges incident to 𝑣. Formally, for undirected graphs:

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

In the case of directed graphs, the in-degree deg − (𝑣) is the number of edges directed into 𝑣, and the out-degree
deg+ (𝑣) is the number of edges directed out of 𝑣.
Definition 5 (Subgraph). [58] A subgraph of 𝐺 is a graph formed by selecting a subset of vertices and edges
from 𝐺.
Definition 6 (Induced subgraph). [113, 132] Let 𝐺 = (𝑉, 𝐸) be a graph, where 𝑉 is the set of vertices and 𝐸
is the set of edges. For a subset 𝑉 0 ⊆ 𝑉, the induced subgraph 𝐺 [𝑉 0 ] is the graph whose vertex set is 𝑉 0 and
whose edge set consists of all edges from 𝐸 that have both endpoints in 𝑉 0 . Formally, the induced subgraph
𝐺 [𝑉 0 ] = (𝑉 0 , 𝐸 0 ) is defined as follows:

𝐸 0 = {(𝑢, 𝑣) ∈ 𝐸 | 𝑢 ∈ 𝑉 0 , 𝑣 ∈ 𝑉 0 }.

In other words, 𝐺 [𝑉 0 ] is the subgraph of 𝐺 that contains all vertices in 𝑉 0 and all edges from 𝐺 whose endpoints
are both in 𝑉 0 .
Definition 7 (Complete Graph). (cf.[25, 60]) A complete graph is a graph 𝐺 = (𝑉, 𝐸) in which every pair of
distinct vertices is connected by a unique edge. Formally, a graph 𝐺 = (𝑉, 𝐸) is complete if for every pair of
vertices 𝑢, 𝑣 ∈ 𝑉 with 𝑢 ≠ 𝑣, there exists an edge {𝑢, 𝑣} ∈ 𝐸.
The complete graph on 𝑛 vertices is denoted by 𝐾 𝑛 , and it has the following properties:
• The number of vertices is |𝑉 | = 𝑛.

𝑛(𝑛− 1 )
• The number of edges is |𝐸 | = 𝑛2 = 2 .
• Each vertex has degree deg(𝑣) = 𝑛 − 1 for all 𝑣 ∈ 𝑉.
Definition 8 (Bipartite Graph). (cf.[20, 62]) A bipartite graph is a graph 𝐺 = (𝑉, 𝐸) whose vertex set 𝑉 can be
partitioned into two disjoint subsets 𝑉1 and 𝑉2 such that:
• 𝑉 = 𝑉1 ∪ 𝑉2 and 𝑉1 ∩ 𝑉2 = ∅.
• Every edge in 𝐸 connects a vertex from 𝑉1 to a vertex from 𝑉2 . In other words, there are no edges
connecting two vertices within the same subset 𝑉1 or 𝑉2 .
Formally, 𝐺 = (𝑉, 𝐸) is bipartite if there exists a partition (𝑉1 , 𝑉2 ) such that for every edge 𝑒 = {𝑢, 𝑣} ∈
𝐸, either 𝑢 ∈ 𝑉1 and 𝑣 ∈ 𝑉2 or 𝑢 ∈ 𝑉2 and 𝑣 ∈ 𝑉1 .
A graph 𝐺 is bipartite if and only if it contains no odd-length cycles.

3
Definition 9 (Complete Bipartite Graph). (cf.[66, 111, 134]) A complete bipartite graph is a graph 𝐺 = (𝑉, 𝐸)
whose vertex set 𝑉 can be partitioned into two disjoint subsets 𝑉1 and 𝑉2 such that:
• 𝑉 = 𝑉1 ∪ 𝑉2 and 𝑉1 ∩ 𝑉2 = ∅.
• There is an edge between every vertex in 𝑉1 and every vertex in 𝑉2 .
• There are no edges between vertices within the same subset 𝑉1 or 𝑉2 .
The complete bipartite graph with |𝑉1 | = 𝑚 and |𝑉2 | = 𝑛 is denoted by 𝐾 𝑚,𝑛 . It has the following
properties:
• The number of vertices is |𝑉 | = 𝑚 + 𝑛.
• The number of edges is |𝐸 | = 𝑚 × 𝑛.
• Each vertex in 𝑉1 has degree 𝑛, and each vertex in 𝑉2 has degree 𝑚.
Definition 10 (homomorphic). (cf.[30,59,69,112,204]) Two graphs 𝐺 = (𝑉, 𝐸) and 𝐻 = (𝑉 0 , 𝐸 0 ) are said to be
homomorphic if there exists a mapping 𝜙 : 𝑉 → 𝑉 0 such that for every edge (𝑢, 𝑣) ∈ 𝐸, the image (𝜙(𝑢), 𝜙(𝑣)) is
an edge in 𝐸 0 . In other words, there is a structure-preserving mapping from 𝐺 to 𝐻 that maintains the adjacency
relationships between vertices.

2.2 Intersection graph and permutation graphs

In this paper, we focus on permutation graphs, which are known as intersection graphs. Intersection
graphs have been extensively studied[37, 89, 95, 144, 146, 151, 172, 209]. The definition is provided below[89,
144, 172].
Definition 11 (Intersection graph). [89,144,172] A intersection graph is a graph that represents the intersection
relationships between sets. Formally, let S = {𝑆1 , 𝑆2 , . . . , 𝑆 𝑛 } be a collection of sets. The intersection graph
𝐺 = (𝑉, 𝐸) associated with S is a graph where:
• The vertex set 𝑉 corresponds to the sets in S, i.e., 𝑉 = {𝑣 1 , 𝑣 2 , . . . , 𝑣 𝑛 }, where each vertex 𝑣 𝑖 represents
the set 𝑆𝑖 ∈ S.
• There is an edge (𝑣 𝑖 , 𝑣 𝑗 ) ∈ 𝐸 if and only if the corresponding sets 𝑆𝑖 and 𝑆 𝑗 have a non-empty intersection,
i.e., 𝑆𝑖 ∩ 𝑆 𝑗 ≠ ∅.
The definitions of permutation graphs and bipartite permutation graphs are provided below. As men-
tioned in the introduction, extensive research has been conducted on these graphs [11, 51, 54, 97, 99, 110, 131,
138, 196].
Definition 12. [24, 32, 68] A graph 𝐺 = (𝑉, 𝐸) is called a permutation graph if there exists a permutation 𝜋
of the set {1, 2, . . . , 𝑛}, where 𝑛 = |𝑉 |, such that for any two distinct vertices 𝑢 and 𝑣 ∈ 𝑉, the edge (𝑢, 𝑣) ∈ 𝐸
exists if and only if the indices of 𝑢 and 𝑣 in 𝜋 are reversed in order. Formally, for a permutation 𝜋, if vertices
𝑢 = 𝑖 and 𝑣 = 𝑗 satisfy 𝑖 < 𝑗 and 𝜋(𝑖) > 𝜋( 𝑗), then there exists an edge (𝑢, 𝑣) ∈ 𝐺.
In other words, a permutation graph is the intersection graph of line segments joining pairs of points
on two parallel lines, where each vertex corresponds to a line segment, and two vertices are adjacent if their
corresponding line segments intersect.
Example 13. Consider the set 𝑉 = {1, 2, 3, 4} and the permutation 𝜋 = (3, 1, 4, 2), which maps the elements of
𝑉 as follows:
𝜋(1) = 3, 𝜋(2) = 1, 𝜋(3) = 4, 𝜋(4) = 2
The permutation graph 𝐺 = (𝑉, 𝐸) is formed by adding edges between vertices 𝑖 and 𝑗 if the indices are reversed
in 𝜋. That is, (𝑖, 𝑗) ∈ 𝐸 if 𝑖 < 𝑗 and 𝜋(𝑖) > 𝜋( 𝑗).
From the permutation 𝜋 = (3, 1, 4, 2), we add edges between the following vertices:
(1, 2) because 1 < 2 and 𝜋(1) = 3 > 𝜋(2) = 1,
(1, 4) because 1 < 4 and 𝜋(1) = 3 > 𝜋(4) = 2,
(3, 4) because 3 < 4 and 𝜋(3) = 4 > 𝜋(4) = 2.
Thus, the edge set 𝐸 is:
𝐸 = {(1, 2), (1, 4), (3, 4)}
The resulting graph is the permutation graph corresponding to 𝜋 = (3, 1, 4, 2).

4
Definition 14. [191, 192] A graph 𝐺 = (𝑉, 𝐸) is called a bipartite permutation graph if 𝐺 is both a bipartite
graph and a permutation graph. Specifically, 𝐺 is bipartite if its vertex set can be partitioned into two independent
sets 𝑉1 and 𝑉2 , where there are no edges between vertices within the same set. The edges of 𝐺 are defined based
on the adjacency condition of a permutation graph.
Formally, 𝐺 = (𝑉1 ∪𝑉2 , 𝐸) is a bipartite permutation graph if there exists a permutation 𝜋 of the vertices
in 𝑉1 ∪ 𝑉2 such that for any two vertices 𝑢 ∈ 𝑉1 and 𝑣 ∈ 𝑉2 , there is an edge (𝑢, 𝑣) ∈ 𝐸 if and only if 𝜋(𝑢)
and 𝜋(𝑣) intersect in the corresponding permutation diagram. Thus, bipartite permutation graphs combine the
structure of bipartite graphs with the properties of permutation graphs.
Example 15. Consider a bipartite graph 𝐺 = (𝑉1 ∪ 𝑉2 , 𝐸), where 𝑉1 = {1, 2} and 𝑉2 = {3, 4}. Let the
permutation 𝜋 = (4, 3, 2, 1) represent the mapping of the vertices 1, 2, 3, 4.
In this graph, edges are formed between the vertices in 𝑉1 and 𝑉2 based on the permutation condition
(𝑖, 𝑗) ∈ 𝐸 if 𝜋(𝑖) and 𝜋( 𝑗) are reversed. For 𝜋 = (4, 3, 2, 1):
(1, 3) because 𝜋(1) = 4 > 𝜋(3) = 2,
(2, 4) because 𝜋(2) = 3 > 𝜋(4) = 1.
Thus, the bipartite permutation graph has the edge set:
𝐸 = {(1, 3), (2, 4)}
This graph satisfies the bipartite and permutation graph conditions.

2.3 Permutation graph in Fuzzy Graphs

Now, we explore permutation graph and bipartite permutation graphs within the context of fuzzy graphs.
Fuzzy sets extend classical sets by allowing elements to have varying degrees of membership, represented
by values between 0 and 1, rather than a binary classification of membership or non-membership[207]. Similarly,
fuzzy graphs generalize classical graph theory by incorporating the principles of fuzzy sets [14,36,45,52,90,137,
197,205,207]. Due to their flexibility and practical utility, fuzzy graphs have been widely studied [28,31,50,74,
87, 93, 124, 147, 152, 162, 163, 193, 202]. They find applications in fields such as decision-making [6, 16, 39, 48],
Disaster management[98, 142, 171, 173, 198], and neural networks [102, 136, 156], among others.
The definition of a fuzzy graph is provided below.
Definition 16 (Fuzzy Graph). [163] A fuzzy graph 𝜓 = (𝑉, 𝜎, 𝜇) consists of:
• 𝑉 is a set of vertices.
• 𝜎 : 𝑉 → [0, 1] is a function that assigns a membership degree to each vertex 𝑣 ∈ 𝑉, representing the
degree of membership of 𝑣 in the fuzzy graph.
• 𝜇 : 𝑉 × 𝑉 → [0, 1] is a fuzzy relation that represents the strength of the connection between each pair of
vertices (𝑢, 𝑣) ∈ 𝑉 × 𝑉, such that 𝜇(𝑢, 𝑣) ≤ min{𝜎(𝑢), 𝜎(𝑣)}.
These functions satisfy the following conditions:
1. 𝜇(𝑢, 𝑣) ≤ min{𝜎(𝑢), 𝜎(𝑣)} for all 𝑢, 𝑣 ∈ 𝑉,
2. 𝜇(𝑢, 𝑣) = 𝜇(𝑣, 𝑢) for all 𝑢, 𝑣 ∈ 𝑉 (symmetry),
3. 𝜇(𝑣, 𝑣) = 0 for all 𝑣 ∈ 𝑉 (no self-loops).
The definitions of Fuzzy Permutation Graph and Fuzzy Bipartite Permutation Graph are provided below.
Definition 17 (Fuzzy Permutation Graph). (cf. [159]) Let 𝑉 = {1, 2, . . . , 𝑛} be a finite set of vertices, and let 𝜋
be a permutation of 𝑉. A fuzzy permutation graph 𝜓 = (𝑉, 𝜎, 𝜇) is a fuzzy graph where:
• 𝜎 : 𝑉 → (0, 1] assigns a positive membership degree to each vertex 𝑣 ∈ 𝑉.
• 𝜇 : 𝑉 × 𝑉 → [0, 1] is defined as:

min{𝜎(𝑢), 𝜎(𝑣)}, if 𝑢 < 𝑣 and 𝜋(𝑢) > 𝜋(𝑣),
𝜇(𝑢, 𝑣) =
0, otherwise.

The underlying crisp graph 𝐺 = (𝑉, 𝐸), where 𝐸 = {(𝑢, 𝑣) | 𝜇(𝑢, 𝑣) > 0}, is a permutation graph
corresponding to the permutation 𝜋.

5
Example 18. Consider 𝑉 = {1, 2, 3, 4}, permutation 𝜋 = (3, 1, 4, 2), and vertex membership degrees:

𝜎(1) = 0.8, 𝜎(2) = 0.6, 𝜎(3) = 0.9, 𝜎(4) = 0.7.

Compute 𝜇(𝑢, 𝑣):

• Edge (1, 2): 1 < 2 and 𝜋(1) = 3 > 𝜋(2) = 1, so 𝜇(1, 2) = min{0.8, 0.6} = 0.6.
• Edge (1, 4): 1 < 4 and 𝜋(1) = 3 > 𝜋(4) = 2, so 𝜇(1, 4) = min{0.8, 0.7} = 0.7.
• Edge (3, 4): 3 < 4 and 𝜋(3) = 4 > 𝜋(4) = 2, so 𝜇(3, 4) = min{0.9, 0.7} = 0.7.
Thus, the fuzzy permutation graph 𝜓 has edges 𝜇(1, 2) = 0.6, 𝜇(1, 4) = 0.7, and 𝜇(3, 4) = 0.7.
Definition 19 (Fuzzy Bipartite Permutation Graph). Let 𝑉 = 𝑉1 ∪ 𝑉2 be a finite set of vertices partitioned into
two disjoint independent sets 𝑉1 and 𝑉2 , and let 𝜋 be a permutation of 𝑉. A fuzzy bipartite permutation graph
𝜓 = (𝑉, 𝜎, 𝜇) is a fuzzy graph where:
• 𝜎 : 𝑉 → (0, 1] assigns positive membership degrees to each vertex 𝑣 ∈ 𝑉.
• 𝜇 : 𝑉 × 𝑉 → [0, 1] is defined as:

min{𝜎(𝑢), 𝜎(𝑣)}, if 𝑢 ∈ 𝑉1 , 𝑣 ∈ 𝑉2 , and 𝜋(𝑢) > 𝜋(𝑣),
𝜇(𝑢, 𝑣) =
0, otherwise.

The underlying crisp graph 𝐺 = (𝑉, 𝐸), where 𝐸 = {(𝑢, 𝑣) | 𝜇(𝑢, 𝑣) > 0}, is a bipartite permutation
graph corresponding to the permutation 𝜋.
Example 20. Let 𝑉1 = {1, 2}, 𝑉2 = {3, 4}, permutation 𝜋 = (4, 3, 2, 1), and vertex membership degrees:

𝜎(1) = 0.9, 𝜎(2) = 0.8, 𝜎(3) = 0.7, 𝜎(4) = 0.6.

Compute 𝜇(𝑢, 𝑣) for 𝑢 ∈ 𝑉1 and 𝑣 ∈ 𝑉2 :

• Edge (1, 3): 𝜋(1) = 4 > 𝜋(3) = 2, so 𝜇(1, 3) = min{0.9, 0.7} = 0.7.
• Edge (1, 4): 𝜋(1) = 4 > 𝜋(4) = 1, so 𝜇(1, 4) = min{0.9, 0.6} = 0.6.
• Edge (2, 3): 𝜋(2) = 3 > 𝜋(3) = 2, so 𝜇(2, 3) = min{0.8, 0.7} = 0.7.
• Edge (2, 4): 𝜋(2) = 3 > 𝜋(4) = 1, so 𝜇(2, 4) = min{0.8, 0.6} = 0.6.
Edges within 𝑉1 or within 𝑉2 have membership degree 0, as no edges exist between vertices of the same
partition.

2.4 Permutation graph in Intuitionistic fuzzy Graphs

Next, we examine permutation graphs within the framework of intuitionistic fuzzy graphs. Intuitionistic
fuzzy graphs are an extended form of fuzzy graphs and have been the focus of extensive research for over 15
years [86, 125, 153, 157]. They are closely related to the concept of intuitionistic fuzzy sets [21, 22, 63, 194].
Much like fuzzy-related concepts, the study of intuitionistic fuzzy graphs and their related ideas has also
seen significant progress [2–4, 27, 49, 50, 121, 149, 154, 167, 176, 195, 200, 210]. The definitions of intuitionistic
fuzzy graphs and intuitionistic fuzzy permutation graphs are presented below.
Definition 21 (Intuitionistic Fuzzy Graph (IFG)). [153] Let 𝐺 = (𝑉, 𝐸) be a classical graph where 𝑉 denotes the
set of vertices and 𝐸 denotes the set of edges. An Intuitionistic Fuzzy Graph (IFG) on 𝐺, denoted 𝐺 𝐼 𝐹 = ( 𝐴, 𝐵),
is defined as follows:

1. (𝜇 𝐴, 𝑣 𝐴) is an Intuitionistic Fuzzy Set (IFS) on the vertex set 𝑉. For each vertex 𝑥 ∈ 𝑉, the degree of
membership 𝜇 𝐴 (𝑥) ∈ [0, 1] and the degree of non-membership 𝑣 𝐴 (𝑥) ∈ [0, 1] satisfy:

𝜇 𝐴 (𝑥) + 𝑣 𝐴 (𝑥) ≤ 1

The value 1 − 𝜇 𝐴 (𝑥) − 𝑣 𝐴 (𝑥) represents the hesitancy or uncertainty regarding the membership of 𝑥 in the
set.

6
 2. (𝜇 𝐵 , 𝑣 𝐵 ) is an Intuitionistic Fuzzy Relation (IFR) on the edge set 𝐸. For each edge (𝑥, 𝑦) ∈ 𝐸, the degree
of membership 𝜇 𝐵 (𝑥, 𝑦) ∈ [0, 1] and the degree of non-membership 𝑣 𝐵 (𝑥, 𝑦) ∈ [0, 1] satisfy:

𝜇 𝐵 (𝑥, 𝑦) + 𝑣 𝐵 (𝑥, 𝑦) ≤ 1

Additionally, the following constraints must hold for all 𝑥, 𝑦 ∈ 𝑉:

𝜇 𝐵 (𝑥, 𝑦) ≤ 𝜇 𝐴 (𝑥) ∧ 𝜇 𝐴 (𝑦)

𝑣 𝐵 (𝑥, 𝑦) ≤ 𝑣 𝐴 (𝑥) ∨ 𝑣 𝐴 (𝑦)

In this definition:
• 𝜇 𝐴 (𝑥) and 𝑣 𝐴 (𝑥) represent the degree of membership and non-membership of the vertex 𝑥, respectively.
• 𝜇 𝐵 (𝑥, 𝑦) and 𝑣 𝐵 (𝑥, 𝑦) represent the degree of membership and non-membership of the edge (𝑥, 𝑦), respec-
tively.
• If 𝑣 𝐴 (𝑥) = 0 and 𝑣 𝐵 (𝑥, 𝑦) = 0 for all 𝑥 ∈ 𝑉 and (𝑥, 𝑦) ∈ 𝐸, then the Intuitionistic Fuzzy Graph reduces to
a Fuzzy Graph.
Next, we define the Intuitionistic Fuzzy Permutation Graph and Intuitionistic Fuzzy Bipartite Permutation
Graph.
Definition 22 (Intuitionistic Fuzzy Permutation Graph). An Intuitionistic Fuzzy Permutation Graph is an ex-
tension of the permutation graph into the intuitionistic fuzzy domain, where each vertex and edge is assigned
both a membership degree and a non-membership degree, representing the uncertainty of their presence. Let
𝐺 = (𝑉, 𝐸) be a classical permutation graph and 𝜋 be a permutation of the set {1, 2, . . . , 𝑛}, where 𝑛 = |𝑉 |. The
graph is defined as follows:

• 𝑉 is the set of vertices.

• For each vertex 𝑣 ∈ 𝑉, the degree of membership 𝜇𝑉 (𝑣) ∈ [0, 1] and the degree of non-membership
𝜈𝑉 (𝑣) ∈ [0, 1] satisfy:
𝜇𝑉 (𝑣) + 𝜈𝑉 (𝑣) ≤ 1
The value 1 − 𝜇𝑉 (𝑣) − 𝜈𝑉 (𝑣) represents the hesitancy or uncertainty regarding the membership of the
vertex 𝑣.
• For each pair of vertices 𝑢, 𝑣 ∈ 𝑉, the degree of membership 𝜇 𝐸 (𝑢, 𝑣) ∈ [0, 1] and the degree of non-
membership 𝜈 𝐸 (𝑢, 𝑣) ∈ [0, 1] for the edge (𝑢, 𝑣) satisfy:

𝜇 𝐸 (𝑢, 𝑣) + 𝜈 𝐸 (𝑢, 𝑣) ≤ 1

The edge membership degree 𝜇 𝐸 (𝑢, 𝑣) is determined as:


min(𝜇𝑉 (𝑢), 𝜇𝑉 (𝑣)), if 𝑢 < 𝑣 and 𝜋(𝑢) > 𝜋(𝑣),
𝜇 𝐸 (𝑢, 𝑣) =
0, otherwise.

Similarly, the non-membership degree 𝜈 𝐸 (𝑢, 𝑣) is:


max(𝜈𝑉 (𝑢), 𝜈𝑉 (𝑣)), if 𝑢 < 𝑣 and 𝜋(𝑢) > 𝜋(𝑣),
𝜈 𝐸 (𝑢, 𝑣) =
1, otherwise.

The underlying crisp graph corresponds to the permutation graph associated with the permutation 𝜋.
Definition 23 (Intuitionistic Fuzzy Bipartite Permutation Graph). An Intuitionistic Fuzzy Bipartite Permutation
Graph extends both the concepts of bipartite graphs and permutation graphs into the intuitionistic fuzzy frame-
work. Let 𝑉 = 𝑉1 ∪ 𝑉2 be a finite set of vertices, partitioned into two independent sets 𝑉1 and 𝑉2 , with 𝜋 as a
permutation on 𝑉1 ∪ 𝑉2 . The graph 𝐺 = (𝑉, 𝐸, 𝜇𝑉 , 𝜈𝑉 , 𝜇 𝐸 , 𝜈 𝐸 ) is defined as follows:

• 𝑉1 and 𝑉2 are independent sets of vertices.

7
 • For each vertex 𝑣 ∈ 𝑉, the degree of membership 𝜇𝑉 (𝑣) ∈ [0, 1] and the degree of non-membership
𝜈𝑉 (𝑣) ∈ [0, 1] satisfy:
𝜇𝑉 (𝑣) + 𝜈𝑉 (𝑣) ≤ 1
The value 1 − 𝜇𝑉 (𝑣) − 𝜈𝑉 (𝑣) represents the uncertainty regarding the membership of the vertex 𝑣.
• For each edge (𝑢, 𝑣) ∈ 𝑉1 × 𝑉2 , the degree of membership 𝜇 𝐸 (𝑢, 𝑣) ∈ [0, 1] and the degree of non-
membership 𝜈 𝐸 (𝑢, 𝑣) ∈ [0, 1] satisfy:
𝜇 𝐸 (𝑢, 𝑣) + 𝜈 𝐸 (𝑢, 𝑣) ≤ 1
The membership degree of the edge (𝑢, 𝑣) is:

min(𝜇𝑉 (𝑢), 𝜇𝑉 (𝑣)), if 𝑢 ∈ 𝑉1 , 𝑣 ∈ 𝑉2 and 𝜋(𝑢) > 𝜋(𝑣),
𝜇 𝐸 (𝑢, 𝑣) =
0, otherwise.

The non-membership degree 𝜈 𝐸 (𝑢, 𝑣) is:


max(𝜈𝑉 (𝑢), 𝜈𝑉 (𝑣)), if 𝑢 ∈ 𝑉1 , 𝑣 ∈ 𝑉2 and 𝜋(𝑢) > 𝜋(𝑣),
𝜈 𝐸 (𝑢, 𝑣) =
1, otherwise.

This definition ensures that the intuitionistic fuzzy bipartite permutation graph maintains both the bipar-
tite and permutation graph structures while incorporating intuitionistic fuzzy membership and non-membership
degrees.

2.5 Permutation graph in Neutrosophic Graphs

As noted in the introduction, neutrosophic graphs are an extension of fuzzy graphs and intuitionistic
fuzzy graphs. A neutrosophic graph assigns truth, indeterminacy, and falsity membership degrees to each vertex
and edge, representing uncertainty. Similar to fuzzy graphs, neutrosophic graphs have been extensively studied
[5, 8, 35, 72, 73, 75–78, 80, 81, 101, 116, 123, 166, 183, 186].
Neutrosophic graphs are closely linked to the concept of neutrosophic sets [15, 18, 34, 53, 141, 181, 182,
185, 187, 201].
Beyond graphs and sets, research on neutrosophic theory has paralleled the depth of studies on fuzzy
theory, with numerous contributions [5, 7, 17, 55, 117, 118, 123, 161, 180, 184, 188, 189].
The formal definition is provided below [78, 186]
Definition 24. [78, 186] A neutrosophic graph 𝐺 = (𝑉, 𝐸, 𝜎 = (𝜎𝑇 , 𝜎𝐼 , 𝜎𝐹 ), 𝜇 = (𝜇𝑇 , 𝜇 𝐼 , 𝜇 𝐹 )) is a graph
where:
• 𝜎 : 𝑉 → [0, 1] 3 assigns a triple (𝜎𝑇 (𝑣), 𝜎𝐼 (𝑣), 𝜎𝐹 (𝑣)) representing the truth, indeterminacy, and falsity
membership degrees to each vertex 𝑣 ∈ 𝑉.
• 𝜇 : 𝐸 → [0, 1] 3 assigns a triple (𝜇𝑇 (𝑒), 𝜇 𝐼 (𝑒), 𝜇 𝐹 (𝑒)) representing the truth, indeterminacy, and falsity
membership degrees to each edge 𝑒 ∈ 𝐸.
• For every edge 𝑒 = 𝑣 𝑖 𝑣 𝑗 ∈ 𝐸, the following condition holds:
𝜇𝑇 (𝑒) ≤ min(𝜎𝑇 (𝑣 𝑖 ), 𝜎𝑇 (𝑣 𝑗 )).

1. 𝜎 is called the neutrosophic vertex set.

2. 𝜇 is called the neutrosophic edge set.
3. The number of vertices |𝑉 | is the order of 𝐺, denoted by 𝑂 (𝐺).
Í
4. The sum of the truth values over all vertices, 𝑣 ∈𝑉 𝜎𝑇 (𝑣), is the neutrosophic order of 𝐺, denoted by
𝑂𝑛(𝐺).
5. The number of edges |𝐸 | is the size of 𝐺, denoted by 𝑆(𝐺).
Í
6. The sum of the truth values over all edges, 𝑒∈𝐸 𝜇𝑇 (𝑒), is the neutrosophic size of 𝐺, denoted by 𝑆𝑛(𝐺).
Next, we define the neutrosophic permutation graph and neutrosophic Bipartite Permutation Graph. The
neutrosophic permutation graph extends the structure of the permutation graph by degrees of truth, indeterminacy,
and falsity for each vertex and edge.

8
Definition 25 (Neutrosophic Permutation Graph). A Neutrosophic Permutation Graph is an extension of the
classical permutation graph into the neutrosophic domain, where each vertex and edge is assigned truth, indeter-
minacy, and falsity membership degrees. Let 𝐺 = (𝑉, 𝐸) be a permutation graph with a permutation 𝜋 of the set
{1, 2, . . . , 𝑛}, where 𝑛 = |𝑉 |. The neutrosophic permutation graph 𝐺 𝑁 = (𝑉, 𝐸, 𝜎, 𝜇) is defined as follows:

• 𝜎 : 𝑉 → [0, 1] 3 assigns to each vertex 𝑣 ∈ 𝑉 a triple (𝜎𝑇 (𝑣), 𝜎𝐼 (𝑣), 𝜎𝐹 (𝑣)) representing the truth,
indeterminacy, and falsity membership degrees, respectively.
• 𝜇 : 𝐸 → [0, 1] 3 assigns to each edge 𝑒 ∈ 𝐸 a triple (𝜇𝑇 (𝑒), 𝜇 𝐼 (𝑒), 𝜇 𝐹 (𝑒)), representing the truth,
indeterminacy, and falsity membership degrees, respectively.
• For each edge 𝑒 = (𝑢, 𝑣) ∈ 𝐸, the truth membership degree 𝜇𝑇 (𝑢, 𝑣) is determined as:

min(𝜎𝑇 (𝑢), 𝜎𝑇 (𝑣)), if 𝑢 < 𝑣 and 𝜋(𝑢) > 𝜋(𝑣),
𝜇𝑇 (𝑢, 𝑣) =
0, otherwise.

The indeterminacy 𝜇 𝐼 (𝑢, 𝑣) and falsity 𝜇 𝐹 (𝑢, 𝑣) degrees are defined similarly.

Definition 26 (Neutrosophic Bipartite Permutation Graph). A Neutrosophic Bipartite Permutation Graph is

an extension of the bipartite permutation graph into the neutrosophic domain, where truth, indeterminacy, and
falsity membership degrees are assigned to vertices and edges. Let 𝐺 = (𝑉1 ∪ 𝑉2 , 𝐸) be a bipartite permutation
graph with vertex sets 𝑉1 and 𝑉2 , and let 𝜋 be a permutation on 𝑉1 ∪ 𝑉2 . The neutrosophic bipartite permutation
graph 𝐺 𝑁 = (𝑉1 ∪ 𝑉2 , 𝐸, 𝜎, 𝜇) is defined as follows:

• 𝜎 : 𝑉 → [0, 1] 3 assigns to each vertex 𝑣 ∈ 𝑉1 ∪ 𝑉2 a triple (𝜎𝑇 (𝑣), 𝜎𝐼 (𝑣), 𝜎𝐹 (𝑣)) representing the truth,
indeterminacy, and falsity membership degrees, respectively.
• 𝜇 : 𝐸 → [0, 1] 3 assigns to each edge 𝑒 = (𝑢, 𝑣) ∈ 𝐸 a triple (𝜇𝑇 (𝑢, 𝑣), 𝜇 𝐼 (𝑢, 𝑣), 𝜇 𝐹 (𝑢, 𝑣)), representing
the truth, indeterminacy, and falsity membership degrees, respectively.
• The truth membership degree 𝜇𝑇 (𝑢, 𝑣) for each edge 𝑒 = (𝑢, 𝑣) is defined as:

min(𝜎𝑇 (𝑢), 𝜎𝑇 (𝑣)), if 𝑢 ∈ 𝑉1 , 𝑣 ∈ 𝑉2 and 𝜋(𝑢) > 𝜋(𝑣),
𝜇𝑇 (𝑢, 𝑣) =
0, otherwise.

The indeterminacy 𝜇 𝐼 (𝑢, 𝑣) and falsity 𝜇 𝐹 (𝑢, 𝑣) degrees are defined similarly.

2.6 Permutation graph in Turiyam Graph

We explore Permutation graphs within the context of Turiyam Graphs. Turiyam Graph extends classi-
cal graphs by assigning four values—truth, indeterminacy, falsity, and liberal state—to each vertex and edge.
Research on Turiyam Graphs, which introduce parameters to extend Neutrosophic Graphs, is actively ongoing
[83–85,179]. These graphs serve as graphical representations of the Turiyam Set [85,175,177,178]. The formal
definition is provided below.
Definition 27 (Turiyam Graph). [83–85, 174] Let 𝐺 = (𝑉, 𝐸) be a classical graph with a finite set of vertices
𝑉 = {𝑣 𝑖 : 𝑖 = 1, 2, . . . , 𝑛} and edges 𝐸 = {(𝑣 𝑖 , 𝑣 𝑗 ) : 𝑖, 𝑗 = 1, 2, . . . , 𝑛}. A Turiyam Graph of 𝐺, denoted
𝐺 𝑇 = (𝑉 𝑇 , 𝐸 𝑇 ), is defined as follows:

1. Turiyam Vertex Set: For each vertex 𝑣 𝑖 ∈ 𝑉, the Turiyam graph assigns the following mappings:

𝑡 (𝑣 𝑖 ), 𝑖𝑣(𝑣 𝑖 ), 𝑓 𝑣(𝑣 𝑖 ), 𝑙𝑣(𝑣 𝑖 ) : 𝑉 → [0, 1],

where:
• 𝑡 (𝑣 𝑖 ) is the truth value (tv) of the vertex 𝑣 𝑖 ,
• 𝑖𝑣(𝑣 𝑖 ) is the indeterminacy value (iv) of 𝑣 𝑖 ,
• 𝑓 𝑣(𝑣 𝑖 ) is the falsity value (fv) of 𝑣 𝑖 ,
• 𝑙𝑣(𝑣 𝑖 ) is the Turiyam state (or liberal value) (lv) of 𝑣 𝑖 ,
for all 𝑣 𝑖 ∈ 𝑉, such that the following condition holds for each vertex:

0 ≤ 𝑡 (𝑣 𝑖 ) + 𝑖𝑣(𝑣 𝑖 ) + 𝑓 𝑣(𝑣 𝑖 ) + 𝑙𝑣(𝑣 𝑖 ) ≤ 4.

9
 2. Turiyam Edge Set: For each edge (𝑣 𝑖 , 𝑣 𝑗 ) ∈ 𝐸, the Turiyam graph assigns the following mappings:

𝑡 (𝑣 𝑖 , 𝑣 𝑗 ), 𝑖𝑣(𝑣 𝑖 , 𝑣 𝑗 ), 𝑓 𝑣(𝑣 𝑖 , 𝑣 𝑗 ), 𝑙𝑣(𝑣 𝑖 , 𝑣 𝑗 ) : 𝐸 → [0, 1],

where:
• 𝑡 (𝑣 𝑖 , 𝑣 𝑗 ) is the truth value of the edge (𝑣 𝑖 , 𝑣 𝑗 ),
• 𝑖𝑣(𝑣 𝑖 , 𝑣 𝑗 ) is the indeterminacy value of (𝑣 𝑖 , 𝑣 𝑗 ),
• 𝑓 𝑣(𝑣 𝑖 , 𝑣 𝑗 ) is the falsity value of (𝑣 𝑖 , 𝑣 𝑗 ),
• 𝑙𝑣(𝑣 𝑖 , 𝑣 𝑗 ) is the Turiyam state (or liberal value) of (𝑣 𝑖 , 𝑣 𝑗 ),
for all (𝑣 𝑖 , 𝑣 𝑗 ) ∈ 𝐸, such that the following condition holds for each edge:

0 ≤ 𝑡 (𝑣 𝑖 , 𝑣 𝑗 ) + 𝑖𝑣(𝑣 𝑖 , 𝑣 𝑗 ) + 𝑓 𝑣(𝑣 𝑖 , 𝑣 𝑗 ) + 𝑙𝑣(𝑣 𝑖 , 𝑣 𝑗 ) ≤ 4.

In this case, 𝑉 𝑇 represents the Turiyam vertex set of the graph 𝐺 𝑇 , and 𝐸 𝑇 represents the Turiyam edge
set of 𝐺 𝑇 .
Next, we define the Turiyam Permutation Graph and Turiyam Bipartite Permutation Graph. The resulting
graph combines the structure of the permutation graph with the Turiyam values for truth, indeterminacy, falsity,
and liberal state.
Definition 28 (Turiyam Permutation Graph). A Turiyam Permutation Graph extends the classical permutation
graph into the Turiyam framework, where each vertex and edge is assigned four values: truth, indeterminacy,
falsity, and liberal state. Let 𝐺 = (𝑉, 𝐸) be a classical permutation graph and 𝜋 be a permutation of the set
{1, 2, . . . , 𝑛}, where 𝑛 = |𝑉 |. The Turiyam permutation graph 𝐺 𝑇 = (𝑉 𝑇 , 𝐸 𝑇 , 𝑡, 𝑖𝑣, 𝑓 𝑣, 𝑙𝑣) is defined as follows:

• For each vertex 𝑣 ∈ 𝑉, the Turiyam graph assigns the following values:

𝑡 (𝑣), 𝑖𝑣(𝑣), 𝑓 𝑣(𝑣), 𝑙𝑣(𝑣) : 𝑉 → [0, 1],

where 𝑡 (𝑣), 𝑖𝑣(𝑣), 𝑓 𝑣(𝑣), and 𝑙𝑣(𝑣) represent the truth value, indeterminacy value, falsity value, and liberal
value of the vertex 𝑣, respectively, satisfying:

0 ≤ 𝑡 (𝑣) + 𝑖𝑣(𝑣) + 𝑓 𝑣(𝑣) + 𝑙𝑣(𝑣) ≤ 4.

• For each edge 𝑒 = (𝑢, 𝑣) ∈ 𝐸, the Turiyam graph assigns the following values:

𝑡 (𝑢, 𝑣), 𝑖𝑣(𝑢, 𝑣), 𝑓 𝑣(𝑢, 𝑣), 𝑙𝑣(𝑢, 𝑣) : 𝐸 → [0, 1],

where 𝑡 (𝑢, 𝑣), 𝑖𝑣(𝑢, 𝑣), 𝑓 𝑣(𝑢, 𝑣), and 𝑙𝑣(𝑢, 𝑣) represent the truth value, indeterminacy value, falsity value,
and liberal value of the edge (𝑢, 𝑣), respectively, satisfying:

0 ≤ 𝑡 (𝑢, 𝑣) + 𝑖𝑣(𝑢, 𝑣) + 𝑓 𝑣(𝑢, 𝑣) + 𝑙𝑣(𝑢, 𝑣) ≤ 4.

• The edges in the graph are defined based on the permutation 𝜋. There is an edge between vertices 𝑢 and 𝑣
if 𝑢 < 𝑣 and 𝜋(𝑢) > 𝜋(𝑣).

Definition 29 (Turiyam Bipartite Permutation Graph). A Turiyam Bipartite Permutation Graph extends both
bipartite graphs and permutation graphs into the Turiyam framework, where vertices and edges are assigned
truth, indeterminacy, falsity, and liberal values. Let 𝐺 = (𝑉1 ∪ 𝑉2 , 𝐸) be a bipartite permutation graph, where
𝑉1 and 𝑉2 are independent sets, and 𝜋 is a permutation on 𝑉1 ∪ 𝑉2 . The Turiyam bipartite permutation graph
𝐺 𝑇 = (𝑉 𝑇 , 𝐸 𝑇 , 𝑡, 𝑖𝑣, 𝑓 𝑣, 𝑙𝑣) is defined as follows:

• For each vertex 𝑣 ∈ 𝑉1 ∪ 𝑉2 , the Turiyam graph assigns the following values:

𝑡 (𝑣), 𝑖𝑣(𝑣), 𝑓 𝑣(𝑣), 𝑙𝑣(𝑣) : 𝑉 → [0, 1],

where 𝑡 (𝑣), 𝑖𝑣(𝑣), 𝑓 𝑣(𝑣), and 𝑙𝑣(𝑣) represent the truth value, indeterminacy value, falsity value, and liberal
value of the vertex 𝑣, respectively, satisfying:

0 ≤ 𝑡 (𝑣) + 𝑖𝑣(𝑣) + 𝑓 𝑣(𝑣) + 𝑙𝑣(𝑣) ≤ 4.

10
 • For each edge 𝑒 = (𝑢, 𝑣) ∈ 𝐸, where 𝑢 ∈ 𝑉1 and 𝑣 ∈ 𝑉2 , the Turiyam graph assigns the following values:

𝑡 (𝑢, 𝑣), 𝑖𝑣(𝑢, 𝑣), 𝑓 𝑣(𝑢, 𝑣), 𝑙𝑣(𝑢, 𝑣) : 𝐸 → [0, 1],

where 𝑡 (𝑢, 𝑣), 𝑖𝑣(𝑢, 𝑣), 𝑓 𝑣(𝑢, 𝑣), and 𝑙𝑣(𝑢, 𝑣) represent the truth value, indeterminacy value, falsity value,
and liberal value of the edge (𝑢, 𝑣), respectively, satisfying:

0 ≤ 𝑡 (𝑢, 𝑣) + 𝑖𝑣(𝑢, 𝑣) + 𝑓 𝑣(𝑢, 𝑣) + 𝑙𝑣(𝑢, 𝑣) ≤ 4.

• The edges between 𝑉1 and 𝑉2 are defined based on the permutation 𝜋, such that there is an edge between
𝑢 ∈ 𝑉1 and 𝑣 ∈ 𝑉2 if 𝜋(𝑢) > 𝜋(𝑣).

3. Result in this paper

In this section, we present the results of this paper.

3.1 Property of Neutrosophic Permutation graph

We examine the properties of the Neutrosophic Permutation Graph. Similar properties are also observed
in the Fuzzy Permutation Graph, Intuitionistic Fuzzy Permutation Graph, and Turiyam Permutation Graph.
Theorem 30. A Neutrosophic Permutation Graph can be transformed into a classic Permutation Graph.

Proof. Obviously holds. ƒ

Corollary 31. A Neutrosophic Bipartite Permutation Graph can be transformed into a classic Bipartite Permu-
tation Graph.

Proof. Obviously holds. ƒ

Corollary 32. A Fuzzy Permutation Graph, Intuitionistic Fuzzy Permutation Graph, or Turiyam Permutation
Graph can be transformed into a classic Permutation Graph.

Proof. Obviously holds. ƒ

Corollary 33. A Fuzzy Bipartite Permutation Graph, Intuitionistic Fuzzy Bipartite Permutation Graph, or
Turiyam Bipartite Permutation Graph can be transformed into a classic Bipartite Permutation Graph.

Proof. Obviously holds. ƒ

Theorem 34. Neutrosophic Graph can be represented as a Neutrosophic Permutation Graph.

Proof. To prove that any Neutrosophic Graph can be represented as a Neutrosophic Permutation Graph, we
proceed as follows:

1. Permutation Representation: Let 𝑉 = {𝑣 1 , 𝑣 2 , . . . , 𝑣 𝑛 } be the set of vertices of the neutrosophic graph.

Define a permutation 𝜋 of the vertex set 𝑉 such that for any two vertices 𝑣 𝑖 , 𝑣 𝑗 ∈ 𝑉, the edge (𝑣 𝑖 , 𝑣 𝑗 ) exists
if their positions are reversed in the permutation, i.e., 𝑖 < 𝑗 and 𝜋(𝑖) > 𝜋( 𝑗).
2. Vertex Membership Mapping: For each vertex 𝑣 𝑖 ∈ 𝑉, assign the same truth, indeterminacy, and falsity
membership degrees as in the neutrosophic permutation graph:

𝜎(𝑣 𝑖 ) = (𝜎𝑇 (𝑣 𝑖 ), 𝜎𝐼 (𝑣 𝑖 ), 𝜎𝐹 (𝑣 𝑖 )).

3. Edge Membership Mapping: For each edge 𝑒 = (𝑣 𝑖 , 𝑣 𝑗 ) ∈ 𝐸, assign the same truth, indeterminacy, and
falsity membership degrees:
𝜇(𝑒) = (𝜇𝑇 (𝑒), 𝜇 𝐼 (𝑒), 𝜇 𝐹 (𝑒)).
The edge (𝑣 𝑖 , 𝑣 𝑗 ) exists if and only if 𝑖 < 𝑗 and 𝜋(𝑖) > 𝜋( 𝑗), consistent with the condition in the neutro-
sophic permutation graph.

11
 4. Satisfaction of Neutrosophic Graph Condition: In both the neutrosophic graph and neutrosophic per-
mutation graph, the following condition holds for every edge 𝑒 = (𝑣 𝑖 , 𝑣 𝑗 ) ∈ 𝐸:

𝜇𝑇 (𝑒) ≤ min(𝜎𝑇 (𝑣 𝑖 ), 𝜎𝑇 (𝑣 𝑗 )).

Hence, the transformation preserves the constraints of the neutrosophic graph.

Theorem 35. The complement of a neutrosophic permutation graph is also a neutrosophic permutation graph.
Proof. Let 𝐺 = (𝑉, 𝐸, 𝜎, 𝜇) be a neutrosophic permutation graph corresponding to the permutation 𝜋 of the
vertex set 𝑉 = {1, 2, . . . , 𝑛}. Each vertex 𝑣 ∈ 𝑉 has a truth, indeterminacy, and falsity membership degree
𝜎(𝑣) = (𝜎𝑇 (𝑣), 𝜎𝐼 (𝑣), 𝜎𝐹 (𝑣)), and each edge 𝑒 ∈ 𝐸 has the degrees 𝜇(𝑒) = (𝜇𝑇 (𝑒), 𝜇 𝐼 (𝑒), 𝜇 𝐹 (𝑒)).
The complement of the graph 𝐺 = (𝑉, 𝐸, 𝜎, 𝜇) has the same vertex set 𝑉, but the edge set 𝐸 consists of
all pairs (𝑢, 𝑣) ∈ 𝑉 × 𝑉 such that (𝑢, 𝑣) ∉ 𝐸. This means:

(𝑢, 𝑣) ∈ 𝐸 if and only if (𝑢, 𝑣) ∉ 𝐸.

We consider about Condition for Neutrosophic Permutation Graph Complements. In a neutrosophic

permutation graph, an edge (𝑢, 𝑣) ∈ 𝐸 exists if and only if 𝑢 < 𝑣 and 𝜋(𝑢) > 𝜋(𝑣), meaning the vertices are
ordered oppositely in the permutation 𝜋.
For the complement graph 𝐺, we must define an edge (𝑢, 𝑣) ∈ 𝐸. By the definition of a complement:

(𝑢, 𝑣) ∈ 𝐸 if and only if (𝑢, 𝑣) ∉ 𝐸.

Thus, (𝑢, 𝑣) ∈ 𝐸 if 𝑢 < 𝑣 and 𝜋(𝑢) < 𝜋(𝑣), i.e., the indices are not reversed in 𝜋.
We consider about verification of Neutrosophic Membership Degrees. To ensure that 𝐺 is a neutrosophic
permutation graph, we must assign neutrosophic membership degrees 𝜎(𝑣) = (𝜎𝑇 (𝑣), 𝜎 𝐼 (𝑣), 𝜎 𝐹 (𝑣)) to each
vertex and 𝜇(𝑒) = (𝜇𝑇 (𝑒), 𝜇 𝐼 (𝑒), 𝜇 𝐹 (𝑒)) to each edge.
For the vertices:

𝜎𝑇 (𝑣) = 𝜎𝑇 (𝑣), 𝜎 𝐼 (𝑣) = 𝜎𝐼 (𝑣), 𝜎 𝐹 (𝑣) = 𝜎𝐹 (𝑣),

since the complement operation does not change the membership degrees of the vertices.
For the edges:

min(𝜎𝑇 (𝑢), 𝜎𝑇 (𝑣)) if 𝑢 < 𝑣 and 𝜋(𝑢) < 𝜋(𝑣),
𝜇𝑇 (𝑢, 𝑣) =
0 otherwise,

with similar definitions for the indeterminacy and falsity degrees:


min(𝜎 𝐼 (𝑢), 𝜎 𝐼 (𝑣)) if 𝑢 < 𝑣 and 𝜋(𝑢) < 𝜋(𝑣),
𝜇 𝐼 (𝑢, 𝑣) =
0 otherwise,

and 
min(𝜎 𝐹 (𝑢), 𝜎 𝐹 (𝑣)) if 𝑢 < 𝑣 and 𝜋(𝑢) < 𝜋(𝑣),
𝜇 𝐹 (𝑢, 𝑣) =
0 otherwise.
The complement of a neutrosophic permutation graph satisfies the structural conditions of a neutrosophic
permutation graph, as the edge conditions reflect the complement’s permutation structure, and the truth, indeter-
minacy, and falsity membership degrees are preserved. Therefore, the complement of a neutrosophic permutation
graph is also a neutrosophic permutation graph. ƒ
Theorem 36. The disjoint union of two Neutrosophic Permutation Graphs is also a Neutrosophic Permutation
Graph.

12
Proof. Let 𝐺 1 = (𝑉1 , 𝐸 1 , 𝜎1 , 𝜇1 ) and 𝐺 2 = (𝑉2 , 𝐸 2 , 𝜎2 , 𝜇2 ) be two Neutrosophic Permutation Graphs, with
corresponding permutations 𝜋1 and 𝜋2 . Consider the disjoint union 𝐺 = 𝐺 1 t 𝐺 2 , where the vertex set is
𝑉 = 𝑉1 ∪ 𝑉2 and the edge set is 𝐸 = 𝐸 1 ∪ 𝐸 2 .
Define the permutation 𝜋 on 𝑉 as follows:

𝜋1 (𝑣) if 𝑣 ∈ 𝑉1 ,
𝜋(𝑣) =
𝜋2 (𝑣) + |𝑉1 | if 𝑣 ∈ 𝑉2 .

This permutation ensures that the vertices from 𝐺 1 and 𝐺 2 do not interact, preserving the disjoint structure. The
neutrosophic membership functions for vertices and edges remain unchanged in each respective subgraph.
Thus, the disjoint union of two Neutrosophic Permutation Graphs is also a Neutrosophic Permutation
Graph. ƒ

Theorem 37. Every subgraph of a Neutrosophic Permutation Graph is also a Neutrosophic Permutation Graph.
Proof. Let 𝐺 = (𝑉, 𝐸, 𝜎, 𝜇) be a Neutrosophic Permutation Graph, and let 𝐺 0 = (𝑉 0 , 𝐸 0 , 𝜎 0 , 𝜇0 ) be a subgraph
of 𝐺, where 𝑉 0 ⊆ 𝑉 and 𝐸 0 ⊆ 𝐸. The vertices in 𝑉 0 inherit the permutation order from 𝐺, and the edges in 𝐸 0
correspond to the pairs (𝑢, 𝑣) where 𝑢 < 𝑣 and 𝜋(𝑢) > 𝜋(𝑣) within the induced permutation on 𝑉 0 .
The neutrosophic membership values for the vertices and edges in 𝐺 0 are simply the restrictions of 𝜎
and 𝜇 to 𝑉 0 and 𝐸 0 . Therefore, 𝐺 0 retains the structure of a Neutrosophic Permutation Graph.
Thus, subgraphs of Neutrosophic Permutation Graphs are also Neutrosophic Permutation Graphs. ƒ

3.2 Relation of Neutrosophic Bipartite Graphs

Next, we examine the relationship between Neutrosophic Bipartite Graphs and Neutrosophic Bipartite
Permutation Graphs. The definition of Neutrosophic Bipartite Graph is provided below.
Definition 38 (Neutrosophic Bipartite Graph). A Neutrosophic Bipartite Graph is an extension of the classical
bipartite graph into the neutrosophic domain, where truth, indeterminacy, and falsity membership degrees are
assigned to each vertex and edge.
Let 𝐺 = (𝑉, 𝐸, 𝜎, 𝜇) be a neutrosophic graph. The graph 𝐺 is said to be a Neutrosophic Bipartite Graph
if there exists a partition of the vertex set 𝑉 into two disjoint sets 𝑉1 and 𝑉2 , such that:

𝑉 = 𝑉1 ∪ 𝑉2 and 𝑉1 ∩ 𝑉2 = ∅,

and for each edge 𝑒 = (𝑢, 𝑣) ∈ 𝐸, one vertex 𝑢 ∈ 𝑉1 and the other vertex 𝑣 ∈ 𝑉2 , i.e., every edge connects a
vertex in 𝑉1 to a vertex in 𝑉2 .
Furthermore, the following condition holds for each edge 𝑒 = (𝑢, 𝑣) ∈ 𝐸:

𝜇𝑇 (𝑒) ≤ min(𝜎𝑇 (𝑢), 𝜎𝑇 (𝑣)),

where 𝜎𝑇 (𝑢) and 𝜎𝑇 (𝑣) represent the truth membership degrees of vertices 𝑢 ∈ 𝑉1 and 𝑣 ∈ 𝑉2 , respectively.
Theorem 39. A Neutrosophic Bipartite Graph can be transformed into a Bipartite Graph.
Proof. Obviously holds. ƒ

Theorem 40. A Neutrosophic Bipartite Graph is Neutrosophic Graph.

Proof. Obviously holds. ƒ

Theorem 41. Neutrosophic Bipartite Permutation Graph is Neutrosophic Graph.

Proof. Obviously holds. ƒ

Theorem 42. Neutrosophic Bipartite Graph can be represented as a Neutrosophic Bipartite Permutation Graph.

Proof. To represent a Neutrosophic Bipartite Graph as a Neutrosophic Bipartite Permutation Graph, we perform
the following steps.
First, define a permutation 𝜋 on 𝑉1 ∪ 𝑉2 :
• Let 𝜋 be a permutation on the set 𝑉1 ∪𝑉2 such that for each edge 𝑒 = (𝑢, 𝑣) ∈ 𝐸, where 𝑢 ∈ 𝑉1 and 𝑣 ∈ 𝑉2 ,
the permutation satisfies 𝜋(𝑢) > 𝜋(𝑣).

13
 • This ensures that for each edge (𝑢, 𝑣), the permutation condition 𝜋(𝑢) > 𝜋(𝑣) holds, which aligns with the
definition of a Neutrosophic Bipartite Permutation Graph.
Next, assign neutrosophic membership degrees:
• For each vertex 𝑣 ∈ 𝑉1 ∪ 𝑉2 , retain the same truth, indeterminacy, and falsity membership degrees
𝜎𝑇 (𝑣), 𝜎𝐼 (𝑣), 𝜎𝐹 (𝑣) from the Neutrosophic Bipartite Graph.
• For each edge 𝑒 = (𝑢, 𝑣) ∈ 𝐸, where 𝑢 ∈ 𝑉1 and 𝑣 ∈ 𝑉2 , the edge membership degrees 𝜇𝑇 (𝑢, 𝑣), 𝜇 𝐼 (𝑢, 𝑣), 𝜇 𝐹 (𝑢, 𝑣)
are defined in the same way as in the Neutrosophic Bipartite Permutation Graph:

𝜇𝑇 (𝑢, 𝑣) = min(𝜎𝑇 (𝑢), 𝜎𝑇 (𝑣)).

So we conclude that any Neutrosophic Bipartite Graph can be represented as a Neutrosophic Bipartite
Permutation Graph. ƒ

Funding
This research received no external funding.

Acknowledgments
I humbly express my sincere gratitude to all those who have provided their invaluable support, enabling
me to successfully complete this paper. I would also like to extend my appreciation to all the readers who have
taken the time to read it.

Conflicts of interest
The authors declare that there are no conflicts of interest regarding the publication of this paper.

Disclaimer
Please note that preprints and early-stage research may not have undergone peer review. Additionally,
as I am an independent researcher, please understand. Sorry.
As research in this field continues to evolve, the findings and interpretations presented in this paper may
be subject to change. Readers are encouraged to consult future publications for the latest developments.
The authors have made every effort to accurately cite and reference all sources used in this paper. How-
ever, any discrepancies or omissions are unintentional, and the authors welcome any corrections.

References
[1] Moncef Abbas, Marc Pirlot, and Philippe Vincke. Preference structures and co�comparability graphs. Journal of
Multi-criteria Decision Analysis, 5:81–98, 1996.
[2] Muhammad Akram and Noura Omair Alshehri. Intuitionistic fuzzy cycles and intuitionistic fuzzy trees. The Scientific
World Journal, 2014(1):305836, 2014.
[3] Muhammad Akram, Bijan Davvaz, and Feng Feng. Intuitionistic fuzzy soft k-algebras. Mathematics in Computer
Science, 7:353–365, 2013.
[4] Muhammad Akram and Anam Luqman. Intuitionistic single-valued neutrosophic hypergraphs. Opsearch, 54:799–815,
2017.
[5] Muhammad Akram, Hafsa M Malik, Sundas Shahzadi, and Florentin Smarandache. Neutrosophic soft rough graphs
with application. Axioms, 7(1):14, 2018.
[6] Muhammad Akram, Danish Saleem, and Talal Al-Hawary. Spherical fuzzy graphs with application to decision-making.
Mathematical and Computational Applications, 25(1):8, 2020.
[7] Muhammad Akram, Sidra Sayed, and Florentin Smarandache. Neutrosophic incidence graphs with application. Axioms,
7(3):47, 2018.
[8] Muhammad Akram and Gulfam Shahzadi. Operations on single-valued neutrosophic graphs. Infinite Study, 2017.
[9] Talal Al-Hawary. Complete fuzzy graphs. International Journal of Mathematical Combinatorics, 4:26, 2011.
[10] TALAL Al-Hawary and Mohammed Hashim. Semi-fuzzy graphs. Bol. Da Socie. Paran. de Matem.
[11] Bogdan Alecu, Vadim V. Lozin, and Dmitriy S. Malyshev. Critical properties of bipartite permutation graphs. Journal
of Graph Theory, 105:34 – 60, 2020.

14
[12] Yaser Alizadeh, Emeric Deutsch, and Sandi Klavvzar. On the irregularity of 𝜋-permutation graphs, fibonacci cubes,
and trees. Bulletin of the Malaysian Mathematical Sciences Society, 2020.
[13] Shawkat Alkhazaleh. Neutrosophic vague set theory. Critical Review, 10:29–39, 2015.
[14] Claudi Alsina, Enric Trillas, and Llorenç Valverde. On some logical connectives for fuzzy sets theory. Journal of
Mathematical Analysis and Applications, 93(1):15–26, 1983.
[15] Adrián Alejandro Alvaracín Jarrín, David Santiago Proaño Tamayo, Salomón Alejandro Montecé Giler, Juan Carlos
Arandia Zambrano, and Dante Manuel Macazana. Neutrosophic statistics applied in social science. Neutrosophic Sets
and Systems, 44(1):1, 2021.
[16] Sk Amanathulla, G Muhiuddin, D Al-Kadi, and M Pal. Multiple attribute decision-making problem using picture fuzzy
graph. Mathematical Problems in Engineering, 2021(1):9937828, 2021.
[17] P Anitha and P Chitra Devi. Neutrosophic bipolar vague incidence graph. Gorteria UGC-CARE (Group-II) Journal,
34(8):13, 2021.
[18] Muhammad Arshad, Atiqe Ur Rahman, and Muhammad Saeed. An abstract approach to convex and concave sets under
refined neutrosophic set environment. Neutrosophic sets and systems, 53(1):17, 2023.
[19] K. Arvind and C. Pandu Regan. Connected domination and steiner set on weighted permutation graphs. Inf. Process.
Lett., 41:215–220, 1992.
[20] Armen S Asratian, Tristan MJ Denley, and Roland Häggkvist. Bipartite graphs and their applications, volume 131.
Cambridge university press, 1998.
[21] Krassimir T. Atanassov. Intuitionistic fuzzy sets - theory and applications. In Studies in Fuzziness and Soft Computing,
1999.
[22] Krassimir T. Atanassov. On intuitionistic fuzzy sets theory. In Studies in Fuzziness and Soft Computing, 2012.
[23] Aistis Atminas and Viktor Zamaraev. On forbidden induced subgraphs for unit disk graphs. Discrete & Computational
Geometry, 60(1):57–97, 2018.
[24] Camino Balbuena, Xavier Marcote, and Pedro García-Vázquez. On restricted connectivities of permutation graphs.
Networks: An International Journal, 45(3):113–118, 2005.
[25] Mehdi Behzad, Gary Chartrand, and John K Cooper Jr. The colour numbers of complete graphs. Journal of the London
Mathematical Society, 1(1):226–228, 1967.
[26] Alan A Bertossi and Alessandro Gori. Total domination and irredundance in weighted interval graphs. SIAM journal
on discrete mathematics, 1(3):317–327, 1988.
[27] T Bharathi, S Felixia, and S Leo. Intuitionistic felicitous fuzzy graphs.
[28] 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.
[29] Bhaswar B. Bhattacharya and Sumit Mukherjee. Degree sequence of random permutation graphs. arXiv: Probability,
2015.
[30] Christian Borgs, Jennifer Chayes, László Lovász, Vera T Sós, and Katalin Vesztergombi. Counting graph homomor-
phisms. In Topics in Discrete Mathematics: Dedicated to Jarik Nešetřil on the Occasion of his 60th Birthday, pages
315–371. Springer, 2006.
[31] Noor Branches and Iran Noor. Fuzzy defining number of the edge fuzzy graphs. In International Mathematical Forum,
volume 2, pages 893–904, 2007.
[32] Andreas Brandstädt and Dieter Kratsch. On the restriction of some NP-complete graph problems to permutation graphs.
Springer, 1985.
[33] Said Broumi, D Ajay, P Chellamani, Lathamaheswari Malayalan, Mohamed Talea, Assia Bakali, Philippe Schweizer,
and Saeid Jafari. Interval valued pentapartitioned neutrosophic graphs with an application to mcdm. Operational
Research in Engineering Sciences: Theory and Applications, 5(3):68–91, 2022.
[34] Said Broumi, Assia Bakali, and Ayoub Bahnasse. Neutrosophic sets: An overview. Infinite Study, 2018.
[35] Said Broumi, Mohamed Talea, Assia Bakali, and Florentin Smarandache. Interval valued neutrosophic graphs. Critical
Review, XII, 2016:5–33, 2016.
[36] Renato M Capocelli and Aldo De Luca. Fuzzy sets and decision theory. Information and control, 23(5):446–473, 1973.
[37] Ivy Chakrabarty, Shamik Ghosh, TK Mukherjee, and Malay K Sen. Intersection graphs of ideals of rings. Discrete
mathematics, 309(17):5381–5392, 2009.
[38] David B Chandler, Maw-Shang Chang, Antonius JJ Kloks, Jiping Liu, and Sheng-Lung Peng. On probe permutation
graphs. In International Conference on Theory and Applications of Models of Computation, pages 494–504. Springer,
2006.

15
[39] P Chellamani, D Ajay, Mohammed M Al-Shamiri, and Rashad Ismail. Pythagorean Neutrosophic Planar Graphs with
an Application in Decision-Making. Infinite Study, 2023.
[40] Andrew Chen, Daniela Ferrero, Ralucca Gera, and Eunjeong Yi. Functigraphs: An extension of permutation graphs.
Mathematica Bohemica, 136(1):27–37, 2011.
[41] Chiuyuan Chen, Chin-Chen Chang, and Gerard J Chang. Proper interval graphs and the guard problem. Discrete
Mathematics, 170(1-3):223–230, 1997.
[42] Jianer Chen, Anxiao Jiang, Iyad A Kanj, Ge Xia, and Fenghui Zhang. Separability and topology control of quasi unit
disk graphs. Wireless Networks, 17:53–67, 2011.
[43] Mingxia Chen, Jianbo Li, Jianping Li, Weidong Li, and Lusheng Wang. Some approximation algorithms for the clique
partition problem in weighted interval graphs. Theoretical computer science, 381(1-3):124–133, 2007.
[44] Brent N Clark, Charles J Colbourn, and David S Johnson. Unit disk graphs. Discrete mathematics, 86(1-3):165–177,
1990.
[45] Manuel J Cobo, Antonio Gabriel López-Herrera, Enrique Herrera-Viedma, and Francisco Herrera. An approach for
detecting, quantifying, and visualizing the evolution of a research field: A practical application to the fuzzy sets theory
field. Journal of informetrics, 5(1):146–166, 2011.
[46] WL Craine. Characterizations of fuzzy interval graphs. Fuzzy Sets and Systems, 68(2):181–193, 1994.
[47] Ido Dagan, Martin Charles Golumbic, and Ron Y. Pinter. Trapezoid graphs and their coloring. Discret. Appl. Math.,
21:35–46, 1988.
[48] Ajoy Kanti Das and Carlos Granados. Fp-intuitionistic multi fuzzy n-soft set and its induced fp-hesitant n soft set in
decision-making. Decision making: applications in management and engineering, 5(1):67–89, 2022.
[49] 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.
[50] Bijan Davvaz, Naeem Jan, Tahir Mahmood, and Kifayat Ullah. Intuitionistic fuzzy graphs of n th type with applications.
Journal of Intelligent & Fuzzy Systems, 36(4):3923–3932, 2019.
[51] Celina M. Herrera de Figueiredo, Alexsander Andrade de Melo, Fabiano de S. Oliveira, and Ana Paula Couto da Silva.
Maxcut on permutation graphs is np�complete. Journal of Graph Theory, 104:16 – 5, 2022.
[52] Aldo De Luca and Settimo Termini. A definition of a nonprobabilistic entropy in the setting of fuzzy sets theory. In
Readings in fuzzy sets for intelligent systems, pages 197–202. Elsevier, 1993.
[53] Irfan Deli. Refined neutrosophic sets and refined neutrosophic soft sets: theory and applications. In Handbook of
research on generalized and hybrid set structures and applications for soft computing, pages 321–343. IGI Global,
2016.
[54] Jan Derbisz. A polynomial kernel for vertex deletion into bipartite permutation graphs. ArXiv, abs/2111.14005, 2021.
[55] P Chitra Devi and P Anitha. Neutrosophic Bipolar Vague Line Graph. Infinite Study.
[56] Reinhard Diestel. Graduate texts in mathematics: Graph theory.
[57] Reinhard Diestel. Graph theory 3rd ed. Graduate texts in mathematics, 173(33):12, 2005.
[58] Reinhard Diestel. Graph theory. Springer (print edition); Reinhard Diestel (eBooks), 2024.
[59] GABRIEL ANDREW Dirac. Homomorphism theorems for graphs. Mathematische Annalen, 153(1):69–80, 1964.
[60] David P Dobkin, Steven J Friedman, and Kenneth J Supowit. Delaunay graphs are almost as good as complete graphs.
Discrete & Computational Geometry, 5:399–407, 1990.
[61] Didier Dubois and Henri Prade. Fundamentals of fuzzy sets, volume 7. Springer Science & Business Media, 2012.
[62] Andrew L Dulmage and Nathan S Mendelsohn. Coverings of bipartite graphs. Canadian Journal of Mathematics,
10:517–534, 1958.
[63] P. A. Ejegwa, S. O. Akowe, P. M. Otene, and J. M. Ikyule. An overview on intuitionistic fuzzy sets. International
Journal of Scientific & Technology Research, 3:142–145, 2014.
[64] Tınaz Ekim, Pinar Heggernes, and Daniel Meister. Polar permutation graphs. In International Workshop on Combina-
torial Algorithms, pages 218–229. Springer, 2009.
[65] Tnaz Ekim, Pinar Heggernes, and Daniel Meister. Polar permutation graphs are polynomial-time recognisable. Eur. J.
Comb., 34:576–592, 2013.
[66] Hikoe Enomoto, Tomoki Nakamigawa, and Katsuhiro Ota. On the pagenumber of complete bipartite graphs. journal
of combinatorial theory, Series B, 71(1):111–120, 1997.

16
[67] Linda Eroh, Ralucca Gera, Cong X. Kang, Craig E. Larson, and Eunjeong Yi. Domination in functigraphs. Discuss.
Math. Graph Theory, 32:299–319, 2011.
[68] Shimon Even, Amir Pnueli, and Abraham Lempel. Permutation graphs and transitive graphs. Journal of the ACM
(JACM), 19(3):400–410, 1972.
[69] Wenfei Fan, Jianzhong Li, Shuai Ma, Hongzhi Wang, and Yinghui Wu. Graph homomorphism revisited for graph
matching. Proceedings of the VLDB Endowment (PVLDB), 3(1):1161–1172, 2010.
[70] Muhammad Fazil, Muhammad Murtaza, Zafar Ullah, Usman Ali, and Imran Javaid. On the distinguishing number of
functigraphs. Symmetry, 10:332, 2016.
[71] Stefan Felsner, Rudolf Müller, and Lorenz Wernisch. Trapezoid graphs and generalizations, geometry and algorithms.
In Discrete Applied Mathematics, 1994.
[72] Takaaki Fujita. General, general weak, anti, balanced, and semi-neutrosophic graph.
[73] Takaaki Fujita. Smart, zero divisor, layered, weak, mild balanced intuitionistic, semigraph, and chemical graph for
neutrosophic graph.
[74] Takaaki Fujita. Fuzzy directed tree-width and fuzzy hypertree-width. ResearchGate(Preprint), 2024.
[75] Takaaki Fujita. A review of the hierarchy of plithogenic, neutrosophic, and fuzzy graphs: Survey and applications.
ResearchGate(Preprint), 2024.
[76] Takaaki Fujita. Short note of n-superhypertree-width. preprint (researchgate), 2024.
[77] Takaaki Fujita. Short study of t-neutrosophic tree-width, 2024. preprint (researchgate).
[78] Takaaki Fujita. Superhypertree-width and neutrosophictree-width. preprint(researchgate), 2024.
[79] Takaaki Fujita. Survey of planar and outerplanar graphs in fuzzy and neutrosophic graphs. ResearchGate, July 2024.
[80] Takaaki Fujita. Survey of trees, forests, and paths in fuzzy and neutrosophic graphs. July 2024.
[81] Takaaki Fujita. Various properties of various ultrafilters, various graph width parameters, and various connectivity
systems. arXiv preprint arXiv:2408.02299, 2024.
[82] Delbert Fulkerson and Oliver Gross. Incidence matrices and interval graphs. Pacific journal of mathematics,
15(3):835–855, 1965.
[83] GA Ganati, VNS Rao Repalle, MA Ashebo, and M Amini. Turiyam graphs and its applications. Information Sciences
Letters, 12(6):2423–2434, 2023.
[84] Gamachu Adugna Ganati, VN Srinivasa Rao Repalle, and Mamo Abebe Ashebo. Social network analysis by turiyam
graphs. BMC Research Notes, 16(1):170, 2023.
[85] 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.
[86] A. Nagoor Gani and S. Shajitha Begum. Perfect intuitionistic fuzzy graphs. Bulletin of Pure & Applied Sciences-
Mathematics and Statistics, pages 145–152, 2011.
[87] A Nagoor Gani and K Radha. On regular fuzzy graphs. 2008.
[88] Fanica Gavril. Algorithms on circular-arc graphs. Networks, 4(4):357–369, 1974.
[89] Fǎnicǎ Gavril. The intersection graphs of subtrees in trees are exactly the chordal graphs. Journal of Combinatorial
Theory, Series B, 16(1):47–56, 1974.
[90] Kamran Gholamizadeh, Esmaeil Zarei, Mohsen Omidvar, and Mohammad Yazdi. Fuzzy sets theory and human re-
liability: Review, applications, and contributions. Linguistic methods under fuzzy information in system safety and
reliability analysis, pages 91–137, 2022.
[91] Ganesh Ghorai and Madhumangal Pal. G. ghorai, m. pal: Applications of bipolar fuzzy sets in interval graphs. TWMS
Journal of Applied and Engineering Mathematics, 8(2):411–424, 2018.
[92] Paul C. Gilmore and Alan J. Hoffman. A characterization of comparability graphs and of interval graphs. Canadian
Journal of Mathematics, 16:539 – 548, 1964.
[93] 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.
[94] Martin Charles Golumbic. Interval graphs. In Annals of Discrete Mathematics, volume 57, pages 171–202. Elsevier,
2004.
[95] Martin Charles Golumbic and Robert E Jamison. The edge intersection graphs of paths in a tree. Journal of Combina-
torial Theory, Series B, 38(1):8–22, 1985.

17
[96] Martin Charles Golumbic, Doron Rotem, and Jorge Urrutia. Comparability graphs and intersection graphs. Discret.
Math., 43:37–46, 1983.
[97] Jan Gorzny. Computing imbalance-minimal orderings for bipartite permutation graphs and threshold graphs. In Inter-
national Conference on Combinatorial Optimization and Applications, 2020.
[98] Pabitra Kumar Gouri, Bharti Saxena, Kedarnath Navandar Rajesh, Prashant Mane Pranoti, Bhardwaj Ramakant, Ratna
Raja Kumar Jambi, Kisanrao Waghmare Surendra, and Kalampakas Antonios. Competitions on fuzzy mixed graph and
its application in countries for health and disaster. INTERNATIONAL JOURNAL of FUZZY LOGIC and INTELLIGENT
SYSTEMS, 2024.
[99] Marina Groshaus, André Luiz Pires Guedes, and Juan Pablo Puppo. Biclique graph of bipartite permutation graphs.
Electron. Notes Discret. Math., 62:33–38, 2017.
[100] Jonathan L Gross, Jay Yellen, and Mark Anderson. Graph theory and its applications. Chapman and Hall/CRC, 2018.
[101] 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.
[102] Xinyu Guo, Bingjie Tian, and Xuedong Tian. Hfgnn-proto: Hesitant fuzzy graph neural network-based prototypical
network for few-shot text classification. Electronics, 2022.
[103] Udaiprakash I Gupta, Der-Tsai Lee, and JY-T Leung. Efficient algorithms for interval graphs and circular-arc graphs.
Networks, 12(4):459–467, 1982.

[104] Oğuz Gürerk, Ümit Işlak, and Mehmet Akif Yıldız. A study on random permutation graphs. arXiv preprint
arXiv:1901.06678, 2019.
[105] Marisa Gutierrez and Lía Oubiña. Minimum proper interval graphs. Discrete mathematics, 142(1-3):77–85, 1995.
[106] Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Felix Klesen, Paweł Rzążewski, Alexander Wolff, and Johannes
Zink. Coloring and recognizing mixed interval graphs. 2023.
[107] Grzegorz Gutowski, Florian Mittelstädt, Ignaz Rutter, Joachim Spoerhase, Alexander Wolff, and Johannes Zink. Color-
ing mixed and directional interval graphs. In International Symposium on Graph Drawing and Network Visualization,
pages 418–431. Springer, 2022.

[108] Grzegorz Gutowski1 , Florian Mittelstädt, Ignaz Rutter, Joachim Spoerhase1 , Alexander Wolff, and Johannes Zink.
Check for updates coloring mixed and directional interval graphs. In Graph Drawing and Network Visualization: 30th
International Symposium, GD 2022, Tokyo, Japan, September 13–16, 2022, Revised Selected Papers, volume 13764,
page 418. Springer Nature, 2023.
[109] Pinar Heggernes, Daniel Meister, and Yngve Villanger. Induced subgraph isomorphism on interval and proper interval
graphs. In International Symposium on Algorithms and Computation, pages 399–409. Springer, 2010.
[110] Pinar Heggernes, Pim van ’t Hof, Daniel Meister, and Yngve Villanger. Induced subgraph isomorphism on proper
interval and bipartite permutation graphs. Theor. Comput. Sci., 562:252–269, 2015.
[111] Pavol Hell and David G Kirkpatrick. Packings by complete bipartite graphs. SIAM Journal on Algebraic Discrete
Methods, 7(2):199–209, 1986.
[112] Pavol Hell and Jaroslav Nesetril. Graphs and homomorphisms, volume 28. OUP Oxford, 2004.
[113] Robert Hickingbotham. Induced subgraphs and path decompositions. arXiv preprint arXiv:2206.15054, 2022.
[114] Hirotoshi Honma, Saki Honma, and Shigeru Masuyama. An optimal parallel algorithm for constructing a spanning
tree on circular permutation graphs. IEICE Trans. Inf. Syst., 92-D:141–148, 2009.
[115] Wen-Lian Hsu and Tze-Heng Ma. Fast and simple algorithms for recognizing chordal comparability graphs and interval
graphs. SIAM J. Comput., 28:1004–1020, 1999.
[116] 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.
[117] S Satham Hussain, R Jahir Hussain, and Ghulam Muhiuddin. Neutrosophic vague line graphs, volume 36. Infinite
Study, 2020.
[118] S Satham Hussain, R Jahir Hussain, and Florentin Smarandache. On neutrosophic vague graphs. Infinite Study, 2019.
[119] Neil Jami and Zoltán Szigeti. Edge-connectivity of permutation hypergraphs. Discret. Math., 312:2536–2539, 2012.
[120] Robert E Jamison and Alan P Sprague. Double-threshold permutation graphs. Journal of Algebraic Combinatorics,
56(1):23–41, 2022.
[121] 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.
[122] H.A Jung. On a class of posets and the corresponding comparability graphs. J. Comb. Theory B, 24:125–133, 1978.

18
[123] Vasantha Kandasamy, K Ilanthenral, and Florentin Smarandache. Neutrosophic graphs: a new dimension to graph
theory. Infinite Study, 2015.
[124] M. G. Karunambigai, R. Parvathi, and R. Buvaneswari. Arc in intuitionistic fuzzy graphs. Notes on Intuitionistic Fuzzy
Sets, 17:37–47, 2011.
[125] Murugan Kaviyarasu, Mohammed Alqahtani, Murugesan Rajeshwari, and Gopikumar Sudalaimuthu. Complex t-
intuitionistic fuzzy graph with applications of rubber industrial water wastes. Mathematics, 12(13):1950, 2024.
[126] Youngmee Koh and Sangwook Ree. Connected permutation graphs. Discrete Mathematics, 307(21):2628–2635, 2007.
[127] Nicholas Korpelainen, Vadim V Lozin, and Colin Mayhill. Split permutation graphs. Graphs and Combinatorics,
30(3):633–646, 2014.
[128] Alexandr Kostochka and Jan Kratochvíl. Covering and coloring polygon-circle graphs. Discrete Mathematics, 163(1-
3):299–305, 1997.
[129] Fabian Kuhn, Rogert Wattenhofer, and Aaron Zollinger. Ad-hoc networks beyond unit disk graphs. In Proceedings of
the 2003 joint workshop on Foundations of mobile computing, pages 69–78, 2003.
[130] Jin Ho Kwak and Jaeun Lee. Isomorphism classes of cycle permutation graphs. Discrete mathematics, 105(1-
3):131–142, 1992.
[131] Mohammed Lalou and Hamamache Kheddouci. A polynomial-time algorithm for finding critical nodes in bipartite
permutation graphs. Optimization Letters, 13:1345 – 1364, 2018.
[132] Benjamin Lévêque, David Y Lin, Frédéric Maffray, and Nicolas Trotignon. Detecting induced subgraphs. Discrete
Applied Mathematics, 157(17):3540–3551, 2009.
[133] Hongxing Li and Vincent C Yen. Fuzzy sets and fuzzy decision-making. CRC press, 1995.
[134] Shasha Li, Wei Li, and Xueliang Li. The generalized connectivity of complete bipartite graphs. arXiv preprint
arXiv:1012.5710, 2010.
[135] Y. Daniel Liang. Dominations in trapezoid graphs. Inf. Process. Lett., 52:309–315, 1994.
[136] Xiaofeng Liu, Yinglong Ma, Degang Chen, and Ling Liu. Towards embedding ambiguity-sensitive graph neural
network explainability. IEEE Transactions on Fuzzy Systems, 2024.
[137] Pasit Lorterapong and Osama Moselhi. Project-network analysis using fuzzy sets theory. Journal of Construction
Engineering and Management, 122(4):308–318, 1996.
[138] Vadim V. Lozin and Colin Mayhill. Canonical antichains of unit interval and bipartite permutation graphs. Order,
28:513–522, 2011.
[139] Felicia Lucke and Bernard Ries. On blockers and transversals of maximum independent sets in co-comparability graphs.
ArXiv, abs/2311.07219, 2023.
[140] Tze-Heng Ma and Jeremy P. Spinrad. Cycle-free partial orders and chordal comparability graphs. Order, 8:49–61,
1991.
[141] Pinaki Majumdar. Neutrosophic sets and its applications to decision making. In Computational Intelligence for Big
Data Analysis: Frontier Advances and Applications, pages 97–115. Springer, 2015.
[142] Sonia Mandal, Nupur Patra, and Madhumangal Pal. Covering problem on fuzzy graphs and its application in disaster
management system. Soft Computing, 25:2545 – 2557, 2020.
[143] MLN McAllister. Fuzzy intersection graphs. Computers & Mathematics with Applications, 15(10):871–886, 1988.
[144] Terry A McKee and Fred R McMorris. Topics in intersection graph theory. SIAM, 1999.
[145] Rolf H. Möhring. Algorithmic aspects of comparability graphs and interval graphs. 1985.
[146] Clyde L Monma and Victor K Wei. Intersection graphs of paths in a tree. Journal of Combinatorial Theory, Series B,
41(2):141–181, 1986.
[147] John N Mordeson and Sunil Mathew. Advanced topics in fuzzy graph theory, volume 375. Springer, 2019.
[148] John N Mordeson and Premchand S Nair. Fuzzy graphs and fuzzy hypergraphs, volume 46. Physica, 2012.
[149] Sunil MP and J Suresh Kumar. On intuitionistic hesitancy fuzzy graphs. 2024.
[150] TM Nishad, Talal Ali Al-Hawary, and B Mohamed Harif. General fuzzy graphs. Ratio Mathematica, 47, 2023.
[151] Madhumangal Pal. Intersection graphs: An introduction. arXiv preprint arXiv:1404.5468, 2014.
[152] Madhumangal Pal, Sovan Samanta, and Ganesh Ghorai. Modern trends in fuzzy graph theory. Springer, 2020.
[153] R Parvathi and MG Karunambigai. Intuitionistic fuzzy graphs. In Computational Intelligence, Theory and Applications:
International Conference 9th Fuzzy Days in Dortmund, Germany, Sept. 18–20, 2006 Proceedings, pages 139–150.
Springer, 2006.

19
[154] T PATHINATHAN and A KIRUPA. Intuitionistic k-partitioned fuzzy graph.
[155] Satyabrata Paul, Madhumangal Pal, and Anita Pal. L(2, 1)-labeling of permutation and bipartite permutation graphs.
Mathematics in Computer Science, 9:113–123, 2015.
[156] Pramod Kumar Poladi and K. Sagar. Reinforcement learning and neuro�fuzzy gnn�based vertical handover decision
on internet of vehicles. Concurrency and Computation: Practice and Experience, 35, 2023.
[157] Hossein Rashmanlou, Sovan Samanta, Madhumangal Pal, and Rajab Ali Borzooei. Intuitionistic fuzzy graphs with
categorical properties. Fuzzy information and Engineering, 7(3):317–334, 2015.
[158] Sreenanda Raut and Madhumangal Pal. Fuzzy intersection graph: a geometrical approach. Journal of Ambient Intelli-
gence and Humanized Computing, pages 1–25, 2022.
[159] Sreenanda Raut, Madhumangal Pal, and Ganesh Ghorai. Fuzzy permutation graph and its complements. J. Intell. Fuzzy
Syst., 35:2199–2213, 2018.
[160] Richard D. Ringeisen. On cycle permutation graphs. Discret. Math., 51:265–275, 1984.
[161] Umberto Rivieccio. Neutrosophic logics: Prospects and problems. Fuzzy sets and systems, 159(14):1860–1868, 2008.
[162] David W Roberts. Analysis of forest succession with fuzzy graph theory. Ecological Modelling, 45(4):261–274, 1989.
[163] Azriel Rosenfeld. Fuzzy graphs. In Fuzzy sets and their applications to cognitive and decision processes, pages 77–95.
Elsevier, 1975.
[164] Doron Rotem and Jorge Urrutia. Circular permutation graphs. Networks, 12(4):429–437, 1982.
[165] Anita Saha and Madhumangal Pal. Maximum weight k-independent set problem on permutation graphs. International
Journal of Computer Mathematics, 80:1477 – 1487, 2003.
[166] Rıdvan Şahin. An approach to neutrosophic graph theory with applications. Soft Computing, 23(2):569–581, 2019.
[167] Sankar Sahoo and Madhumangal Pal. Intuitionistic fuzzy labeling graphs. TWMS Journal of Applied and Engineering
Mathematics, 8(2):466–476, 2018.
[168] Robert Scheffler. Semi-proper interval graphs. Discrete Applied Mathematics, 360:22–41, 2025.
[169] T. M. Selvarajan and M. Anitha. Balanced permutation graphs. 2016.
[170] MK Sen, G Chowdhury, and DS Malik. Fuzzy intersection graphs of fuzzy semigroups. New Mathematics and Natural
Computation, 2(01):1–10, 2006.
[171] Xiaolong Shi, Saeed Kosari, Saira Hameed, Abdul Ghafar Shah, and Samee Ullah. Application of connectivity index
of cubic fuzzy graphs for identification of danger zones of tsunami threat. PLOS ONE, 19, 2024.
[172] Karen B Singer. Random intersection graphs. The Johns Hopkins University, 1996.
[173] P. N. P. Singh, Nitin Mishra, M. Kumar, Seema Saxena, and Vikramjeet Singh. Risk analysis of flood disaster based
on similarity measures in picture fuzzy environment. Afrika Matematika, 29:1019 – 1038, 2018.
[174] Prem Kumar Singh. Data with turiyam set for fourth dimension quantum information processing. Journal of Neutro-
sophic and Fuzzy Systems, 1(1):9–23, 2021.
[175] Prem Kumar Singh. Turiyam set a fourth dimension data representation. Journal of Applied Mathematics and Physics,
9(7):1821–1828, 2021.
[176] Prem Kumar Singh. Intuitionistic Plithogenic Graph. Infinite Study, 2022.
[177] Prem Kumar Singh. Turiyam set and its mathematical distinction from other sets. Galoitica: Journal of Mathematical
Structures and Applications, 8(1):08–19, 2023.
[178] Prem Kumar Singh et al. Non-euclidean data exploration using turiyam set and its complement. Full Length Article,
6(2):23–3, 2023.
[179] Prem Kumar Singh, Naveen Surathu, Ghattamaneni Surya Prakash, et al. Turiyam based four way unknown profile
characterization on social networks. Full Length Article, 10(2):27–7, 2024.
[180] Florentin Smarandache. Neutrosophic physics: More problems, more solutions. 2010.
[181] Florentin Smarandache. Neutrosophic Overset, Neutrosophic Underset, and Neutrosophic Offset. Similarly for Neu-
trosophic Over-/Under-/Off-Logic, Probability, and Statistics. Infinite Study, 2016.
[182] Florentin Smarandache. New types of neutrosophic set/logic/probability, neutrosophic over-/under-/off-set, neutro-
sophic refined set, and their extension to plithogenic set/logic/probability, with applications. MDPI, 2019.
[183] 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.

20
[184] Florentin Smarandache. NeutroGeometry & AntiGeometry are alternatives and generalizations of the Non-Euclidean
Geometries (revisited), volume 5. Infinite Study, 2021.
[185] Florentin Smarandache. Introduction to the multineutrosophic set. Infinite Study, 2023.
[186] Florentin Smarandache and Said Broumi. Neutrosophic graph theory and algorithms. IGI Global, 2019.
[187] Florentin Smarandache, Said Broumi, Prem Kumar Singh, Chun-fang Liu, V Venkateswara Rao, Hai-Long Yang, Ion
Patrascu, and Azeddine Elhassouny. Introduction to neutrosophy and neutrosophic environment. In Neutrosophic Set
in Medical Image Analysis, pages 3–29. Elsevier, 2019.
[188] Florentin Smarandache, Memet Şahin, Derya Bakbak, Vakkas Uluçay, and Abdullah Kargın. Neutrosophic SuperHy-
perAlgebra and New Types of Topologies. Infinite Study, 2023.
[189] Florentin Smarandache, Memet Şahin, Derya Bakbak, Vakkas Uluçay, and Abdullah Kargın. Neutrosophic SuperHy-
perAlgebra and New Types of Topologies. Infinite Study, 2023.
[190] Metawee Songsaeng and Aiyared Iampan. Neutrosophic set theory applied to UP-algebras. Infinite Study, 2019.
[191] Jeremy Spinrad, Andreas Brandstädt, and Lorna Stewart. Bipartite permutation graphs. Discrete Applied Mathematics,
18(3):279–292, 1987.
[192] Anand Srinivasan, K Madhukar, P Nagavamsi, C Pandu Rangan, and Maw-Shang Chang. Edge domination on bipartite
permutation graphs and cotriangulated graphs. Information Processing Letters, 56(3):165–171, 1995.
[193] A Sudha and P Sundararajan. Robust fuzzy graph. Ratio Mathematica, 46, 2023.
[194] Gaisi Takeuti and Satoko Titani. Intuitionistic fuzzy logic and intuitionistic fuzzy set theory. The journal of symbolic
logic, 49(3):851–866, 1984.
[195] AL-Hawary Talal and Bayan Hourani. On intuitionistic product fuzzy graphs. Italian Journal of Pure and Applied
Mathematics, page 113.
[196] Wen Chean Teh, Zhen Chuan Ng, Muhammad Javaid, and Zi Jing Chern. Parikh word representability of bipartite
permutation graphs. Discret. Appl. Math., 282:208–221, 2018.
[197] Dušan Teodorović. Fuzzy sets theory applications in traffic and transportation. European Journal of Operational
Research, 74(3):379–390, 1994.
[198] Chung-Hung Tsai, Cheng-Wu Chen, Wei ling Chiang, and Meng-Lung Lin. Application of geographic information
system to the allocation of disaster shelters via fuzzy models. Engineering Computations, 25:86–100, 2008.
[199] Alan Tucker. Characterizing circular-arc graphs. 1970.
[200] Vakkas Uluçay and Memet Şahin. Intuitionistic fuzzy soft expert graphs with application. Uncertainty discourse and
applications, 1(1):1–10, 2024.
[201] Haibin Wang, Florentin Smarandache, Yanqing Zhang, and Rajshekhar Sunderraman. Single valued neutrosophic sets.
Infinite study, 2010.
[202] 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.
[203] Douglas Brent West et al. Introduction to graph theory, volume 2. Prentice hall Upper Saddle River, 2001.
[204] Douglas R White and Karl P Reitz. Graph and semigroup homomorphisms on networks of relations. Social Networks,
5(2):193–234, 1983.
[205] Zeshui Xu. Hesitant fuzzy sets theory, volume 314. Springer, 2014.
[206] William CK Yen and CY Tang. An optimal algorithm for solving the searchlight guarding problem on weighted interval
graphs. Information sciences, 100(1-4):1–25, 1997.
[207] Lotfi A Zadeh. Fuzzy sets. Information and control, 8(3):338–353, 1965.
[208] Lotfi A Zadeh. Fuzzy logic, neural networks, and soft computing. In Fuzzy sets, fuzzy logic, and fuzzy systems: selected
papers by Lotfi A Zadeh, pages 775–782. World Scientific, 1996.
[209] Bohdan Zelinka. Intersection graphs of finite abelian groups. Czechoslovak Mathematical Journal, 25(2):171–174,
1975.
[210] Hua Zhao, Zeshui Xu, Shousheng Liu, and Zhong Wang. Intuitionistic fuzzy mst clustering algorithms. Computers &
Industrial Engineering, 62(4):1130–1140, 2012.

21