Neutrosophic Path-Coloring

Neutrosophic
Path-Coloring
Ideas | Approaches | Accessibility | Availability
Dr. Henry Garrett

Report | Exposition | References | Research #22 2022
Abstract
In this book, some notions are introduced about “Neutrosophic Path-Coloring”.

Three chapters are devised as “Initial Notions”, “Modified Notions” and “Exten-
ded Notions”. Three manuscripts are cited as the references of these chapters
which are my 76th, 77th, and 78th manuscripts. I’ve used my 76th, 77th, and
78th manuscripts to write this book.
In first chapter, there are some points as follow. New setting is introduced to
study path-coloring number and neutrosophic path-coloring number arising
from different types of paths based on shared edges amid them in neutrosophic
graphs assigned to neutrosophic graphs. Consider two vertices. Minimum num-
ber of shared edges based on those vertices in the formations of all paths with
those vertices as their starts and their ends to compare with other paths, is a
number which is representative based on those vertices. Minimum neutrosophic
number of shared edges amid neutrosophic cardinality of all sets of shared edges
is called neutrosophic path-coloring number. Forming sets from special paths
to figure out different types of number of paths having smallest number of
colors from shared edges from two vertices are given in the terms of minimum
number of paths to get minimum number to assign to neutrosophic graphs is
key type of approach to have these notions namely path-coloring number and
neutrosophic path-coloring number arising from different types of paths based
on shared edges amid them in neutrosophic graphs assigned to neutrosophic
graphs. Two numbers and one set are assigned to a neutrosophic graph, are
obtained but now both settings lead to approach is on demand which is to
compute and to find representatives of paths having smallest number of colors
from shared edges from two vertices are given forming different types of sets of
paths in the terms of minimum number and minimum neutrosophic number
forming it to get minimum number to assign to a neutrosophic graph. Let
N T G : (V, E, σ, µ) be a neutrosophic graph. Then for given two vertices, x
and y, there are some paths from x to y. If two paths from x to y share one
edge, then they’re assigned to different colors. The set of colors in this process
is called path-coloring set from x to y. The minimum cardinality between all
path-coloring sets from two given vertices is called path-coloring number and
it’s denoted by L(N T G); for given two vertices, x and y, there are some paths
from x to y. If two paths from x to y share one edge, then they’re assigned to
different colors. The set S of shared edges in this process is called
P path-coloring
P3
set from x to y. The minimum neutrosophic cardinality, e∈S i=1 µi (e),
between all path-coloring sets, Ss, is called neutrosophic path-coloring number
and it’s denoted by Ln (N T G). As concluding results, there are some state-
i
Abstract
ments, remarks, examples and clarifications about some classes of neutrosophic

graphs namely path-neutrosophic graphs, cycle-neutrosophic graphs, complete-
neutrosophic graphs, star-neutrosophic graphs, complete-bipartite-neutrosophic
graphs, complete-t-partite-neutrosophic graphs and wheel-neutrosophic graphs.
The clarifications are also presented in both sections “Setting of path-coloring
number,” and “Setting of neutrosophic path-coloring number,” for introduced
results and used classes. This approach facilitates identifying paths which form
path-coloring number and neutrosophic path-coloring number arising from
different types of paths based on shared edges amid them in neutrosophic graphs
assigned to neutrosophic graphs. In both settings, some classes of well-known
neutrosophic graphs are studied. Some clarifications for each result and each
definition are provided. The cardinality of set of shared edges and neutrosophic
cardinality of set of shared edges have eligibility to define path-coloring number
and neutrosophic path-coloring number but different types of shared edges have
eligibility to define path-coloring sets. Some results get more frameworks and
perspective about these definitions. The way in that, different types of shared
edges having smallest number from all paths from two vertices are given forming
different types of sets in the terms of minimum number of shared edges having
smallest number of different paths from two vertices are given and smallest
number of shared edges having smallest number of paths from two vertices are
given forming it to get minimum number to assign to neutrosophic graphs or in
other words, the way in that, consider two vertices. Minimum number of shared
edges based on those vertices in the formations of all paths with those vertices
as their starts and their ends to compare with other paths, is a number which
is representative based on those vertices; Minimum neutrosophic number of
shared edges amid neutrosophic cardinality of all sets of shared edges is called
neutrosophic path-coloring number, opens the way to do some approaches.
These notions are applied into neutrosophic graphs as individuals but not family
of them as drawbacks for these notions. Finding special neutrosophic graphs
which are well-known, is an open way to pursue this study. Neutrosophic
path-coloring notion is applied to different settings and classes of neutrosophic
graphs. Some problems are proposed to pursue this study. Basic familiarities
with graph theory and neutrosophic graph theory are proposed for this chapter.
In second chapter, there are some points as follow. New setting is introduced
to study dominating path-coloring number and neutrosophic dominating path-
coloring number arising from different types of paths based on shared edges
amid them in neutrosophic graphs assigned to neutrosophic graphs. Consider
two vertices. Minimum number of shared edges based on those vertices in the
formations of all paths with those vertices as their starts and their ends to
compare with other paths, is a number which is representative based on those
vertices. Minimum neutrosophic number of shared edges amid neutrosophic
cardinality of all sets of shared edges is called neutrosophic dominating path-
coloring number. Forming sets from special paths to figure out different types of
number of paths having smallest number of colors from shared edges from two
vertices are given in the terms of minimum number of paths to get minimum
number to assign to neutrosophic graphs is key type of approach to have these
notions namely dominating path-coloring number and neutrosophic dominating
path-coloring number arising from different types of paths based on shared
edges amid them in neutrosophic graphs assigned to neutrosophic graphs. Two
numbers and one set are assigned to a neutrosophic graph, are obtained but
ii
now both settings lead to approach is on demand which is to compute and
to find representatives of paths having smallest number of colors from shared
edges from two vertices are given forming different types of sets of paths in the
terms of minimum number and minimum neutrosophic number forming it to get
minimum number to assign to a neutrosophic graph. Let N T G : (V, E, σ, µ) be
a neutrosophic graph. Then for given two vertices, x and y, there are some paths
different colors. The set of different colors, S, in this process is called dominating
path-coloring set from x to y if for every edge outside there’s at least one edge
inside which they’ve common vertex. The minimum cardinality between all
dominating path-coloring sets from two given vertices is called dominating
path-coloring number and it’s denoted by Q(N T G); for given two vertices, x
and y, there are some paths from x to y. If two paths from x to y share one
edge, then they’re assigned to different colors. The set S of different colors
in this process is called dominating path-coloring set from x to y if for every
edge outside there’s at least one edgeP insideP which they’ve common vertex. The
3
minimum neutrosophic cardinality, e∈S i=1 µi (e), between all dominating
path-coloring sets, Ss, is called neutrosophic dominating path-coloring number
and it’s denoted by Qn (N T G). As concluding results, there are some state-
ments, remarks, examples and clarifications about some classes of neutrosophic
The clarifications are also presented in both sections “Setting of dominating
path-coloring number,” and “Setting of neutrosophic dominating path-coloring
number,” for introduced results and used classes. This approach facilitates
identifying paths which form dominating path-coloring number and neutrosophic
dominating path-coloring number arising from different types of paths based
graphs. In both settings, some classes of well-known neutrosophic graphs are
studied. Some clarifications for each result and each definition are provided.
The cardinality of set of shared edges and neutrosophic cardinality of set of
shared edges have eligibility to define dominating path-coloring number and
neutrosophic dominating path-coloring number but different types of shared
edges have eligibility to define dominating path-coloring sets. Some results get
more frameworks and perspective about these definitions. The way in that,
different types of shared edges having smallest number from all paths from
two vertices are given forming different types of sets in the terms of minimum
number of shared edges having smallest number of different paths from two
vertices are given and smallest number of shared edges having smallest number
of paths from two vertices are given forming it to get minimum number to assign
to neutrosophic graphs or in other words, the way in that, consider two vertices.
Minimum number of shared edges based on those vertices in the formations of
all paths with those vertices as their starts and their ends to compare with other
paths, is a number which is representative based on those vertices; Minimum
neutrosophic number of shared edges amid neutrosophic cardinality of all sets of
shared edges is called neutrosophic dominating path-coloring number, opens the
way to do some approaches. These notions are applied into neutrosophic graphs
as individuals but not family of them as drawbacks for these notions. Finding
special neutrosophic graphs which are well-known, is an open way to pursue
iii
Abstract
this study. Neutrosophic dominating path-coloring notion is applied to different

settings and classes of neutrosophic graphs. Some problems are proposed to
pursue this study. Basic familiarities with graph theory and neutrosophic graph
theory are proposed for this chapter.
In third chapter, there are some points as follow. New setting is introduced to
study path-coloring number and neutrosophic path-coloring number arising from
different types of paths based on shared endpoints amid them in neutrosophic
graphs assigned to neutrosophic graphs. Consider two vertices. Minimum
number of shared endpoints based on those vertices in the formations of all
paths with those vertices as their starts and their ends to compare with other
paths, is a number which is representative based on those vertices. Minimum
neutrosophic number of latter endpoints corresponded to path-coloring set
amid neutrosophic cardinality of all sets of latter endpoints corresponded to
path-coloring set is called neutrosophic path-coloring number. Forming sets
from special paths to figure out different types of number of paths having
smallest number of colors from shared endpoints from two vertices are given
in the terms of minimum number of paths to get minimum number to assign
to neutrosophic graphs is key type of approach to have these notions namely
path-coloring number and neutrosophic path-coloring number arising from
different types of paths based on shared endpoints amid them in neutrosophic
graphs assigned to neutrosophic graphs. Two numbers and one set are assigned
to a neutrosophic graph, are obtained but now both settings lead to approach
is on demand which is to compute and to find representatives of paths having
smallest number of colors from shared endpoints from two vertices are given
forming different types of sets of paths in the terms of minimum number and
minimum neutrosophic number forming it to get minimum number to assign to
a neutrosophic graph. Let N T G : (V, E, σ, µ) be a neutrosophic graph. Then
for given two vertices, x and y, there are some paths from x to y. If two paths
from x to y share an endpoint, then they’re assigned to different colors. The
set of different colors, S, in this process is called path-coloring set from x to
y. The minimum cardinality between all path-coloring sets from two given
vertices is called path-coloring number and it’s denoted by V(N T G); for given
two vertices, x and y, there are some paths from x to y. If two paths from
x to y share an endpoint, then they’re assigned to different colors. The set
S of different colors in this process is P called Ppath-coloring set from x to y.
3
The minimum neutrosophic cardinality, x∈Z i=1 σi (x), between all sets Zs
including the latter endpoints corresponded to path-coloring set Ss, is called
neutrosophic path-coloring number and it’s denoted by Vn (N T G). As conclud-
ing results, there are some statements, remarks, examples and clarifications
about some classes of neutrosophic graphs namely path-neutrosophic graphs,
cycle-neutrosophic graphs, complete-neutrosophic graphs, star-neutrosophic
graphs, complete-bipartite-neutrosophic graphs, complete-t-partite-neutrosophic
graphs, and wheel-neutrosophic graphs. The clarifications are also presented
in both sections “Setting of path-coloring number,” and “Setting of neutro-
sophic path-coloring number,” for introduced results and used classes. This
approach facilitates identifying paths which form path-coloring number and
on shared endpoints amid them in neutrosophic graphs assigned to neutrosophic
graphs. In both settings, some classes of well-known neutrosophic graphs are
studied. Some clarifications for each result and each definition are provided.
iv
The cardinality of set of shared endpoints and neutrosophic cardinality of
latter endpoints corresponded to path-coloring set have eligibility to define
path-coloring number and neutrosophic path-coloring number but different
types of shared endpoints have eligibility to define path-coloring sets. Some
results get more frameworks and perspective about these definitions. The way
in that, different types of shared endpoints having smallest number from all
paths from two vertices are given forming different types of sets in the terms
of minimum number of shared endpoints having smallest number of different
paths from two vertices are given and smallest number of shared endpoints
having smallest number of paths from two vertices are given forming it to get
minimum number to assign to neutrosophic graphs or in other words, the way
in that, consider two vertices, minimum number of shared endpoints based on
those vertices in the formations of all paths with those vertices as their starts
and their ends to compare with other paths, is a number which is representative
based on those vertices; minimum neutrosophic number of latter endpoints
corresponded to path-coloring set amid neutrosophic cardinality of all sets
of latter endpoints corresponded to path-coloring set is called neutrosophic
path-coloring number, opens the way to do some approaches. These notions
are applied into neutrosophic graphs as individuals but not family of them as
drawbacks for these notions. Finding special neutrosophic graphs which are
well-known, is an open way to pursue this study. Neutrosophic path-coloring
notion is applied to different settings and classes of neutrosophic graphs. Some
problems are proposed to pursue this study. Basic familiarities with graph
theory and neutrosophic graph theory are proposed for this chapter.
The following references are cited by chapters.
[Ref1] Henry Garrett, “Path Coloring Numbers of Neutrosophic Graphs
Based on Shared Edges and Neutrosophic Cardinality of Edges With
Some Applications from Real-World Problems”, ResearchGate 2022 (doi:
10.13140/RG.2.2.30105.70244).
[Ref2] Henry Garrett, “Neutrosophic Dominating Path-Coloring Numbers in
New Visions of Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.32151.65445).
[Ref3] Henry Garrett, “Neutrosophic Path-Coloring Numbers Based
On Endpoints In Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.27990.11845).
Three chapters are devised as “Initial Notions”, “Modified Notions” and “Extended
Notions”.
v
Acknowledgements
The author is going to express his gratitude and his appreciation about the
brains and their hands which are showing the importance of words in the
framework of every wisdom, knowledge, arts, and emotions which are streaming
in the lines from the words, notions, ideas and approaches to have the material The words of mind and the
and the contents which are only the way to flourish the minds, to grow the minds of words, are too
eligible to be in the stage
notions, to advance the ways and to make the stable ways to be amid events of acknowledgements
and storms of minds for surviving from them and making the outstanding
experiences about the tools and the ideas to be on the star lines of words and
shining like stars, forever.
vii
Contents
Abstract i
Acknowledgements vii
Contents ix
List of Figures xi
List of Tables xv
1 Initial Notions 1
1.1 Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.2 Background . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
1.3 Motivation and Contributions . . . . . . . . . . . . . . . . . . 3
1.4 Preliminaries . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4
1.5 Setting of path-coloring number . . . . . . . . . . . . . . . . . 8
1.6 Setting of neutrosophic path-coloring number . . . . . . . . . 22
1.7 Applications in Time Table and Scheduling . . . . . . . . . . . 36
1.8 Case 1: Complete-t-partite Model alongside its path-coloring
number and its neutrosophic path-coloring number . . . . . . 38
1.9 Case 2: Complete Model alongside its A Neutrosophic Graph in
the Viewpoint of its path-coloring number and its neutrosophic
path-coloring number . . . . . . . . . . . . . . . . . . . . . . . 39
1.10 Open Problems . . . . . . . . . . . . . . . . . . . . . . . . . . 41
1.11 Conclusion and Closing Remarks . . . . . . . . . . . . . . . . 41
Bibliography 43
2 Modified Notions 45
2.1 Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 45
2.2 Background . . . . . . . . . . . . . . . . . . . . . . . . . . . . 47
2.4 Preliminaries . . . . . . . . . . . . . . . . . . . . . . . . . . . . 48
2.5 Setting of dominating path-coloring number . . . . . . . . . . 52
2.6 Setting of neutrosophic dominating path-coloring number . . . 66
ix
Contents
2.8 Case 1: Complete-t-partite Model alongside its dominating

path-coloring number and its neutrosophic dominating path-
coloring number . . . . . . . . . . . . . . . . . . . . . . . . . . 82
2.9 Case 2: Complete Model alongside its A Neutrosophic Graph
in the Viewpoint of its dominating path-coloring number and
its neutrosophic dominating path-coloring number . . . . . . . 83
2.10 Open Problems . . . . . . . . . . . . . . . . . . . . . . . . . . 85
Bibliography 87
3 Extended Notions 89
3.1 Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 89
3.2 Background . . . . . . . . . . . . . . . . . . . . . . . . . . . . 91
3.4 Preliminaries . . . . . . . . . . . . . . . . . . . . . . . . . . . . 93
3.5 Setting of path-coloring number . . . . . . . . . . . . . . . . . 96
3.6 Setting of neutrosophic path-coloring number . . . . . . . . . 114
3.8 Case 1: Complete-t-partite Model alongside its path-coloring
number and its neutrosophic path-coloring number . . . . . . 136
3.9 Case 2: Complete Model alongside its A Neutrosophic Graph in
the Viewpoint of its path-coloring number and its neutrosophic
path-coloring number . . . . . . . . . . . . . . . . . . . . . . . 138
3.10 Open Problems . . . . . . . . . . . . . . . . . . . . . . . . . . 140
Bibliography 143
x
List of Figures
1.1 A Neutrosophic Graph in the Viewpoint of its path-coloring number

and its neutrosophic path-coloring number. . . . . . . . . . . . . . 8
xi
List of Figures

and its neutrosophic path-coloring number . . . . . . . . . . . . . . 38
2.1 A Neutrosophic Graph in the Viewpoint of its dominating path-

coloring number and its neutrosophic dominating path-coloring
number. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 52
number. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 54
number. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 57
number. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 57
number. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 59
number. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 59
number. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 61
number. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 62
number. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 64
number. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 66
number. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 68
number. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 71
number. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 71
xii
List of Figures

number. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 73
number. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 74
number. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 75
number. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 77
number. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 78
number. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 81
number . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 82
number . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 84

xiii
List of Figures

xiv
List of Tables
1.1 Scheduling concerns its Subjects and its Connections as a neutro-

sophic graph in a Model. . . . . . . . . . . . . . . . . . . . . . . . . 37
1.2 A Brief Overview about Advantages and Limitations of this Study 42


xv
CHAPTER 1
Initial Notions
The following sections are cited as follows, which is my 76th manuscript and I
use prefix 76 as number before any labelling for items.
[Ref1] Henry Garrett, “Path Coloring Numbers of Neutrosophic Graphs

Based on Shared Edges and Neutrosophic Cardinality of Edges With
Some Applications from Real-World Problems”, ResearchGate 2022 (doi:
10.13140/RG.2.2.30105.70244).
Path Coloring Numbers of Neutrosophic Graphs Based on

Shared Edges and Neutrosophic Cardinality of Edges With Some
Applications from Real-World Problems
1.1 Abstract
New setting is introduced to study path-coloring number and neutrosophic
path-coloring number arising from different types of paths based on shared edges
amid them in neutrosophic graphs assigned to neutrosophic graphs. Consider
two vertices. Minimum number of shared edges based on those vertices in the
formations of all paths with those vertices as their starts and their ends to
compare with other paths, is a number which is representative based on those
vertices. Minimum neutrosophic number of shared edges amid neutrosophic
cardinality of all sets of shared edges is called neutrosophic path-coloring number.
Forming sets from special paths to figure out different types of number of paths
having smallest number of colors from shared edges from two vertices are given
in the terms of minimum number of paths to get minimum number to assign to
neutrosophic graphs is key type of approach to have these notions namely path-
coloring number and neutrosophic path-coloring number arising from different
types of paths based on shared edges amid them in neutrosophic graphs assigned
to neutrosophic graphs. Two numbers and one set are assigned to a neutrosophic
graph, are obtained but now both settings lead to approach is on demand which
is to compute and to find representatives of paths having smallest number of
colors from shared edges from two vertices are given forming different types
of sets of paths in the terms of minimum number and minimum neutrosophic
number forming it to get minimum number to assign to a neutrosophic graph.
Let N T G : (V, E, σ, µ) be a neutrosophic graph. Then for given two vertices, x
and y, there are some paths from x to y. If two paths from x to y share one edge,
then they’re assigned to different colors. The set of colors in this process is called
1
1. Initial Notions
path-coloring set from x to y. The minimum cardinality between all path-coloring

sets from two given vertices is called path-coloring number and it’s denoted by
L(N T G); for given two vertices, x and y, there are some paths from x to y. If
two paths from x to y share one edge, then they’re assigned to different colors.
The set S of shared edges in this process isPcalledPpath-coloring set from x to
3
y. The minimum neutrosophic cardinality, e∈S i=1 µi (e), between all path-
coloring sets, Ss, is called neutrosophic path-coloring number and it’s denoted by
Ln (N T G). As concluding results, there are some statements, remarks, examples
and clarifications about some classes of neutrosophic graphs namely path-
neutrosophic graphs, cycle-neutrosophic graphs, complete-neutrosophic graphs,
star-neutrosophic graphs, complete-bipartite-neutrosophic graphs, complete-t-
partite-neutrosophic graphs and wheel-neutrosophic graphs. The clarifications
are also presented in both sections “Setting of path-coloring number,” and
“Setting of neutrosophic path-coloring number,” for introduced results and used
classes. This approach facilitates identifying paths which form path-coloring
number and neutrosophic path-coloring number arising from different types of
paths based on shared edges amid them in neutrosophic graphs assigned to
neutrosophic graphs. In both settings, some classes of well-known neutrosophic
graphs are studied. Some clarifications for each result and each definition are
provided. The cardinality of set of shared edges and neutrosophic cardinality
of set of shared edges have eligibility to define path-coloring number and
neutrosophic path-coloring number but different types of shared edges have
eligibility to define path-coloring sets. Some results get more frameworks and
perspective about these definitions. The way in that, different types of shared
edges having smallest number from all paths from two vertices are given forming
different types of sets in the terms of minimum number of shared edges having
smallest number of different paths from two vertices are given and smallest
number of shared edges having smallest number of paths from two vertices are
given forming it to get minimum number to assign to neutrosophic graphs or
in other words, the way in that, consider two vertices. Minimum number of
shared edges based on those vertices in the formations of all paths with those
vertices as their starts and their ends to compare with other paths, is a number
which is representative based on those vertices; Minimum neutrosophic number
of shared edges amid neutrosophic cardinality of all sets of shared edges is
called neutrosophic path-coloring number, opens the way to do some approaches.
These notions are applied into neutrosophic graphs as individuals but not family
of them as drawbacks for these notions. Finding special neutrosophic graphs
which are well-known, is an open way to pursue this study. Neutrosophic
path-coloring notion is applied to different settings and classes of neutrosophic
graphs. Some problems are proposed to pursue this study. Basic familiarities
with graph theory and neutrosophic graph theory are proposed for this article.
Keywords: Path-Coloring Number, Neutrosophic Path-Coloring number,
Classes of Neutrosophic Graphs

AMS Subject Classification: 05C17, 05C22, 05E45
2
1.2. Background
1.2 Background
Fuzzy set in Ref. [Ref17], intuitionistic fuzzy sets in Ref. [Ref2], a first
step to a theory of the intuitionistic fuzzy graphs in Ref. [Ref14], a unifying
field in logics neutrosophy: neutrosophic probability, set and logic, rehoboth
in Ref. [Ref15], single-valued neutrosophic graphs in Ref. [Ref3], operations
on single-valued neutrosophic graphs in Ref. [Ref1], neutrosophic soft graphs
in Ref. [Ref13], the complexity of path coloring and call scheduling in
Ref. [Ref7], collision-free path coloring with application to minimum-delay
gathering in sensor networks in Ref. [Ref8], pack: path coloring based k-
connectivity detection algorithm for wireless sensor networks in Ref. [Ref5], a
2-approximation algorithm for path coloring on a restricted class of trees of rings
in Ref. [Ref6], the permutation-path coloring problem on trees in Ref. [Ref4],
dimension and coloring alongside domination in neutrosophic hypergraphs in
Ref. [Ref10], three types of neutrosophic alliances based on connectedness
and (strong) edges in Ref. [Ref12], properties of SuperHyperGraph and
neutrosophic SuperHyperGraph in Ref. [Ref11], are studied. Also, some
studies and researches about neutrosophic graphs, are proposed as a book in
Ref. [Ref9].
In this section, I use two subsections to illustrate a perspective about the
background of this study.
1.3 Motivation and Contributions

In this study, there’s an idea which could be considered as a motivation.
Question 1.3.1. Is it possible to use mixed versions of ideas concerning “path-
coloring number”, “neutrosophic path-coloring number” and “Neutrosophic
Graph” to define some notions which are applied to neutrosophic graphs?
It’s motivation to find notions to use in any classes of neutrosophic graphs.
Real-world applications about time table and scheduling are another thoughts
which lead to be considered as motivation. Having connection amid two paths
have key roles to assign path-coloring number and neutrosophic path-coloring
number arising from different types of paths based on shared edges amid them
in neutrosophic graphs assigned to neutrosophic graphs. Thus they’re used to
define new ideas which conclude to the structure of path-coloring number and
graphs. The concept of having smallest number of paths with shared edge
from two vertices are given inspires us to study the behavior of all paths in
the way that, some types of numbers, path-coloring number and neutrosophic
edges amid them in neutrosophic graphs assigned to neutrosophic graphs, are
the cases of study in the setting of individuals. In both settings, a corresponded
numbers concludes the discussion. Also, there are some avenues to extend these
notions.
The framework of this study is as follows. In the beginning, I introduce
basic definitions to clarify about preliminaries. In subsection “Preliminaries”,
new notions of path-coloring number and neutrosophic path-coloring number
3
1. Initial Notions
arising from different types of paths based on shared edges amid them in
neutrosophic graphs assigned to neutrosophic graphs, are highlighted, are
introduced and are clarified as individuals. In section “Preliminaries”, different
types of paths and minimum numbers of shared edges amid them from two
vertices are neighbors forming different types of sets in the terms of minimum
numbers and minimal sets forming it to get minimum number to assign to
neutrosophic graphs, have the key role in this way. General results are obtained
and also, the results about the basic notions of path-coloring number and
graphs, are elicited. Some classes of neutrosophic graphs are studied in
the terms of path-coloring number and neutrosophic path-coloring number
arising from different types of paths based on shared edges amid them in
neutrosophic graphs assigned to neutrosophic graphs, in section “Setting of
path-coloring number,” as individuals. In section “Setting of path-coloring
number,” path-coloring number is applied into individuals. As concluding
results, there are some statements, remarks, examples and clarifications about
some classes of neutrosophic graphs namely path-neutrosophic graphs, cycle-
neutrosophic graphs, complete-neutrosophic graphs, star-neutrosophic graphs,
complete-bipartite-neutrosophic graphs, complete-t-partite-neutrosophic graphs
and wheel-neutrosophic graphs. The clarifications are also presented in both
sections “Setting of path-coloring number,” and “Setting of neutrosophic
path-coloring number,” for introduced results and used classes. In section
“Applications in Time Table and Scheduling”, two applications are posed for
quasi-complete and complete notions, namely complete-neutrosophic graphs and
complete-t-partite-neutrosophic graphs concerning time table and scheduling
when the suspicions are about choosing some subjects and the mentioned models
are considered as individual. In section “Open Problems”, some problems and
questions for further studies are proposed. In section “Conclusion and Closing
Remarks”, gentle discussion about results and applications is featured. In section
“Conclusion and Closing Remarks”, a brief overview concerning advantages and
limitations of this study alongside conclusions is formed.
1.4 Preliminaries
In this subsection, basic material which is used in this article, is presented.
Also, new ideas and their clarifications are elicited.
Basic idea is about the model which is used. First definition introduces basic
model.
Definition 1.4.1. (Graph).
G = (V, E) is called a graph if V is a set of objects and E is a subset of V × V
(E is a set of 2-subsets of V ) where V is called vertex set and E is called
edge set. Every two vertices have been corresponded to at most one edge.
Neutrosophic graph is the foundation of results in this paper which is defined
as follows. Also, some related notions are demonstrated.
Definition 1.4.2. (Neutrosophic Graph And Its Special Case).
N T G = (V, E, σ = (σ1 , σ2 , σ3 ), µ = (µ1 , µ2 , µ3 )) is called a neutrosophic
graph if it’s graph, σi : V → [0, 1], and µi : E → [0, 1]. We add one condition
4
1.4. Preliminaries
on it and we use special case of neutrosophic graph but with same name. The
added condition is as follows, for every vi vj ∈ E,
µ(vi vj ) ≤ σ(vi ) ∧ σ(vj ).
(i) : σ is called neutrosophic vertex set.
(ii) : µ is called neutrosophic edge set.
(iii) : |V | is called order of NTG and it’s denoted by O(N T G).

P
(iv) : v∈V σ(v) is called neutrosophic order of NTG and it’s denoted by
On (N T G).
(v) : |E| is called size of NTG and it’s denoted by L(N T G).
P P3
(vi) : e∈E i=1 µi (e) is called neutrosophic size of NTG and it’s denoted
by Sn (N T G).
Some classes of well-known neutrosophic graphs are defined. These classes

of neutrosophic graphs are used to form this study and the most results are
about them.
Definition 1.4.3. Let N T G : (V, E, σ, µ) be a neutrosophic graph. Then
(i) : a sequence of consecutive vertices P : x0 , x1 , · · · , xO(N T G) is called path

where xi xi+1 ∈ E, i = 0, 1, · · · , O(N T G) − 1;
V
(ii) : strength of path P : x0 , x1 , · · · , xO(N T G) is i=0,··· ,O(N T G)−1 µ(xi xi+1 );
(iii) : connectedness amid vertices x0 and xt is

_ ^
µ∞ (x0 , xt ) = µ(xi xi+1 );
P :x0 ,x1 ,··· ,xt i=0,··· ,t−1
(iv) : a sequence of consecutive vertices P : x0 , x1 , · · · , xO(N T G) , x0 is called

cycle where xi xi+1 ∈ E, i = 0, 1, · · · , O(N T G) − 1, xO(N T G) x0 ∈ E
V there are two edges xy and uv such that µ(xy) = µ(uv) =
and
i=0,1,··· ,n−1 µ(vi vi+1 );
(v) : it’s t-partite where V is partitioned to t parts, V1s1 , V2s2 , · · · , Vtst and
s
the edge xy implies x ∈ Visi and y ∈ Vj j where i 6= j. If it’s complete,
then it’s denoted by Kσ1 ,σ2 ,··· ,σt where σi is σ on Visi instead V which
mean x 6∈ Vi induces σi (x) = 0. Also, |Vjsi | = si ;
(vi) : t-partite is complete bipartite if t = 2, and it’s denoted by Kσ1 ,σ2 ;
(vii) : complete bipartite is star if |V1 | = 1, and it’s denoted by S1,σ2 ;
(viii) : a vertex in V is center if the vertex joins to all vertices of a cycle. Then
it’s wheel and it’s denoted by W1,σ2 ;
(ix) : it’s complete where ∀uv ∈ V, µ(uv) = σ(u) ∧ σ(v);
(x) : it’s strong where ∀uv ∈ E, µ(uv) = σ(u) ∧ σ(v).
5
1. Initial Notions
To make them concrete, I bring preliminaries of this article in two upcoming

definitions in other ways.
µ(vi vj ) ≤ σ(vi ) ∧ σ(vj ).
|V | is called order of NTG and it’s denoted by O(N T G). Σv∈V σ(v) is called
neutrosophic order of NTG and it’s denoted by On (N T G).
Definition 1.4.5. Let N T G : (V, E, σ, µ) be a neutrosophic graph. Then it’s
complete and denoted by CM T σ if ∀x, y ∈ V,xy ∈ E and µ(xy) = σ(x) ∧ σ(y);
a sequence of consecutive vertices P : x0 , x1 , · · · , xO(N T G) is called path and
it’s denoted by P T H where xi xi+1 ∈ E, i = 0, 1, · · · , n − 1; a sequence of
consecutive vertices P : x0 , x1 , · · · , xO(N T G) , x0 is called cycle and denoted by
CY C where xi xi+1 ∈ E, i = 0, 1, · · · , n − 1, xO(N VT G) x0 ∈ E and there are
two edges xy and uv such that µ(xy) = µ(uv) = i=0,1,··· ,n−1 µ(vi vi+1 ); it’s
t-partite where V is partitioned to t parts, V1s1 , V2s2 , · · · , Vtst and the edge xy
s
implies x ∈ Visi and y ∈ Vj j where i 6= j. If it’s complete, then it’s denoted
by CM T σ1 ,σ2 ,··· ,σt where σi is σ on Visi instead V which mean x 6∈ Vi induces
σi (x) = 0. Also, |Vjsi | = si ; t-partite is complete bipartite if t = 2, and it’s
denoted by CM T σ1 ,σ2 ; complete bipartite is star if |V1 | = 1, and it’s denoted
by ST R1,σ2 ; a vertex in V is center if the vertex joins to all vertices of a cycle.
Then it’s wheel and it’s denoted by W HL1,σ2 .
Remark 1.4.6. Using notations which is mixed with literatures, are reviewed.
1.4.6.1. N T G = (V, E, σ = (σ1 , σ2 , σ3 ), µ = (µ1 , µ2 , µ3 )), O(N T G), and

On (N T G);
1.4.6.2. CM T σ , P T H, CY C, ST R1,σ2 , CM T σ1 ,σ2 , CM T σ1 ,σ2 ,··· ,σt , and

W HL1,σ2 .
Definition 1.4.7. (path-coloring numbers).

Let N T G : (V, E, σ, µ) be a neutrosophic graph. Then
(i) for given two vertices, x and y, there are some paths from x to y. If two
paths from x to y share one edge, then they’re assigned to different colors.
The set of colors in this process is called path-coloring set from x to y.
The minimum cardinality between all path-coloring sets from two given
vertices is called path-coloring number and it’s denoted by L(N T G);
(ii) for given two vertices, x and y, there are some paths from x to y. If two
paths from x to y share one edge, then they’re assigned to different colors.
The set S of shared edges in this process is called path-coloring
P P3 set
from x to y. The minimum neutrosophic cardinality, e∈S i=1 µi (e),
between all path-coloring sets, Ss, is called neutrosophic path-coloring
number and it’s denoted by Ln (N T G).
6
1.4. Preliminaries
For convenient usages, the word neutrosophic which is used in previous

definition, won’t be used, usually.
In next part, clarifications about main definition are given. To avoid confusion
and for convenient usages, examples are usually used after every part and names
are used in the way that, abbreviation, simplicity, and summarization are the
matters of mind.
Example 1.4.8. In Figure (1.1), a complete-neutrosophic graph is illustrated.
Some points are represented in follow-up items as follows. New viewpoint
implies different kinds of definitions to get more scrutiny and more discernment.
(i) Consider two vertices n1 and n2 . All paths are as follow:
P1 : n1 , n2 → red
P2 : n1 , n3 , n2 → red
P3 : n1 , n4 , n2 → red
P4 : n1 , n3 , n4 , n2 → blue
P5 : n1 , n4 , n3 , n2 → yellow
The paths P1 , P2 and P3 has no shared edge so they’ve been colored

the same as red. The path P4 has shared edge n1 n3 with P2 and shared
edge n4 n2 with P3 thus it’s been colored the different color as blue in
comparison to them. The path P5 has shared edge n1 n4 with P3 and
shared edge n3 n4 with P4 thus it’s been colored the different color as
yellow in comparison to different paths in the terms of different colors.
Thus S = {red, blue, yellow} is path-coloring set and its cardinality, 3, is
path-coloring number. To sum them up, for given two vertices, x and
y, there are some paths from x to y. If two paths from x to y share
one edge, then they’re assigned to different colors. The set of colors,
S = {red, blue, yellow}, in this process is called path-coloring set from
x to y. The minimum cardinality between all path-coloring sets from
two given vertices, 3, is called path-coloring number and it’s denoted by
L(N T G) = 3;
(ii) all vertices have same positions in the matter of creating paths. So for
every two given vertices, the number and the behaviors of paths are the
same;
(iii) there are three different paths which have no shared edges. So they’ve
been assigned to same color;
(iv) shared edges form a set of representatives of colors. Each color is
corresponded to an edge which has minimum neutrosophic cardinality;
(v) every color in S is corresponded to an edge has minimum neutrosophic
cardinality. Minimum neutrosophic cardinality is obtained in this way but
other way is to use all shared edges to form S and after that minimum
neutrosophic cardinality is optimal;
(vi) two edges n1 n3 and n4 n2 are shared with P4 by P3 and P2 . The minimum
neutrosophic cardinality is 0.6 corresponded to n4 n2 . Other corresponded
color has only one shared edge n3 n4 and minimum neutrosophic cardinality
7
1. Initial Notions
Figure 1.1: A Neutrosophic Graph in the Viewpoint of its path-coloring number

and its neutrosophic path-coloring number. 76NTG1
is 0.9. Thus minimum neutrosophic cardinality is 1.5. And corresponded

set is S = {n4 n2 , n3 n4 }. To sum them up, for given two vertices, x and
y, there are some paths from x to y. If two paths from x to y share one
edge, then they’re assigned to different colors. The set S = {n4 n2 , n3 n4 }
of shared edges in this process is called path-coloring
P P3 set from x to y.
The minimum neutrosophic cardinality, e∈S i=1 µi (e), between all
path-coloring sets, Ss, is called neutrosophic path-coloring number and
it’s denoted by Ln (N T G) = 1.5.
1.5 Setting of path-coloring number

In this section, I provide some results in the setting of path-coloring number.
Some classes of neutrosophic graphs are chosen. Complete-neutrosophic
graph, path-neutrosophic graph, cycle-neutrosophic graph, star-neutrosophic
graph, bipartite-neutrosophic graph, t-partite-neutrosophic graph, and wheel-
neutrosophic graph, are both of cases of study and classes which the results are
about them.
Proposition 1.5.1. Let N T G : (V, E, σ, µ) be a complete-neutrosophic graph.
Then
L(CM T σ ) = min |S|.

S
Proof. Suppose CM T σ : (V, E, σ, µ) is a complete-neutrosophic graph. By

CM T σ : (V, E, σ, µ) is a complete-neutrosophic graph, all vertices are connected
to each other. So there’s one edge between two vertices. The number of vertices
is O(CM T σ ). For given two vertices, x and y, there are some paths from x to
y. If two paths from x to y share one edge, then they’re assigned to different
colors. The set of colors in this process is called path-coloring set from x to y.
The minimum cardinality between all path-coloring sets from two given vertices
is called path-coloring number and it’s denoted by L(CM T σ ). Thus
L(CM T σ ) = min |S|.

S
8
1.5. Setting of path-coloring number
The clarifications about results are in progress as follows. A complete-

neutrosophic graph is related to previous result and it’s studied to apply the
definitions on it. To make it more clear, next part gives one special case to
apply definitions and results on it. Some items are devised to make more sense
about new notions. A complete-neutrosophic graph is related to previous result
and it’s studied to apply the definitions on it, too.
P1 : n1 , n2 → red
P2 : n1 , n3 , n2 → red
P3 : n1 , n4 , n2 → red
P4 : n1 , n3 , n4 , n2 → blue
P5 : n1 , n4 , n3 , n2 → yellow

L(CM T σ ) = 3;
same;
9
1. Initial Notions


it’s denoted by Ln (CM T σ ) = 1.5.
Another class of neutrosophic graphs is addressed to path-neutrosophic

graph.
Proposition 1.5.3. Let N T G : (V, E, σ, µ) be a path-neutrosophic graph. Then
L(P T H) = 1.
Proof. Suppose P T H : (V, E, σ, µ) is a path-neutrosophic graph. Let

x1 , x2 , · · · , xO(P T H) be a path-neutrosophic graph. For given two vertices,
x and y, there’s one paths from x to y. If two paths from x to y share one edge,
then they’re assigned to different colors but there’s only one path with certain
start and end. The set of colors,{red}, in this process is called path-coloring set
from x to y. The minimum cardinality between all path-coloring sets, 1, from
two given vertices is called path-coloring number and it’s denoted by L(P T H).
Thus
L(P T H) = 1.

Example 1.5.4. There are two sections for clarifications.
(a) In Figure (1.3), an odd-path-neutrosophic graph is illustrated. Some

points are represented in follow-up items as follows. New viewpoint implies
different kinds of definitions to get more scrutiny and more discernment.
(i) All paths are as follows.
n1 , n2 → red
n1 , n2 , n3 → blue
10
n1 , n2 , n3 , n4 → yellow
n1 , n2 , n3 , n4 , n5 → green
n2 , n3 → red
n2 , n3 , n4 → pink
n2 , n3 , n4 , n5 → brown
n3 , n4 → red
n3 , n4 , n5 → blue
n4 , n5 → red
The number is 6;
(ii) 1-paths have same color;
(iii) L(P T H) = 6;
(iv) the position of given vertices could be different in the terms of

creating path and the behaviors in path;
(v) every color is corresponded to some shared edges. Minimum

neutrosophic cardinality of edges corresponded to specific color is
a representative for that color. Thus every color is corresponded
one neutrosophic cardinality of some edges since edges could have
same neutrosophic cardinality with exception of initial color. So the
summation of 5 numbers is neutrosophic path-coloring number. every
color is compared with its previous color. The way is a consecutive
procedure;
(vi) all paths are as follows.
n1 , n2 → red
n1 , n2 , n3 → blue → n1 n2 → 0.8
n1 , n2 , n3 , n4 → yellow → n1 n2 , n2 n3 → 1.3
n1 , n2 , n3 , n4 , n5 → green → n1 n2 , n2 n3 , n3 n4 → 2
n2 , n3 → red
n2 , n3 , n4 → pink → n2 n3 , n3 n4 → 1.3
n2 , n3 , n4 , n5 → brown → n2 n3 , n3 n4 → 1.3
n3 , n4 → red
n3 , n4 , n5 → blue → n3 n4 → 0.7
n4 , n5 → red
Ln (P T H) is 5.6.
(b) In Figure (1.4), an even-path-neutrosophic graph is illustrated. Some

points are represented in follow-up items as follows. New definition is
applied in this section.
11
1. Initial Notions
n1 , n2 → red
n1 , n2 , n3 → red
n1 , n2 , n3 , n4 → red
n1 , n2 , n3 , n4 , n5 → red
n1 , n2 , n3 , n4 , n5 , n6 → red
n2 , n3 → red
n2 , n3 , n4 → red
n2 , n3 , n4 , n5 → red
n2 , n3 , n4 , n5 , n6 → red
n3 , n4 → red
n3 , n4 , n5 → red
n4 , n5 → red
The number is 1;

(iii) L(P T H) = 1;
(v) there’s only one path. It implies that there’s no shared edge;
n1 , n2 → red
n1 , n2 , n3 → red → no shared edge → 0
n1 , n2 , n3 , n4 → red → no shared edge → 0
n1 , n2 , n3 , n4 , n5 → red → no shared edge → 0
n2 , n3 → red
n3 , n4 → red
n4 , n5 → red
Ln (P T H) is 0.
Proposition 1.5.5. Let N T G : (V, E, σ, µ) be a cycle-neutrosophic graph where

O(CY C) ≥ 3. Then
L(CY C) = 1.
Proof. Suppose CY C : (V, E, σ, µ) is a cycle-neutrosophic graph. For given two

vertices, x and y, there are only two paths from x to y. If two paths from x to
y share one edge, then they’re assigned to different colors but these two paths
don’t share one edge. The set of colors, {red}, in this process is called path-
coloring set from x to y. The minimum cardinality between all path-coloring
12


sets from two given vertices, 1, is called path-coloring number and it’s denoted
by L(CY C). Thus
L(CY C) = 1.
The clarifications about results are in progress as follows. An odd-cycle-

about new notions. An even-cycle-neutrosophic graph is related to previous
result and it’s studied to apply the definitions on it, too.
(a) In Figure (1.5), an even-cycle-neutrosophic graph is illustrated. Some

points are represented in follow-up items as follows.
13
1. Initial Notions

P1 : n1 , n2 & P2 : n1 , n6 , n5 , n4 , n3 , n2 → red
P1 : n1 , n2 , n3 & P2 : n1 , n6 , n5 , n4 , n3 → red
P1 : n1 , n2 , n3 , n4 & P2 : n1 , n6 , n5 , n4 → red
P1 : n1 , n2 , n3 , n4 , n5 & P2 : n1 , n6 , n5 → red
P1 : n1 , n2 , n3 , n4 , n5 , n6 & P2 : n1 , n6 → red
The number is 1;

(iii) L(CY C) = 1;
(v) there are only two paths but there’s no shared edge;
P1 : n1 , n2 & P2 : n1 , n6 , n5 , n4 , n3 , n2 → red → no shared edge → 0
P1 : n1 , n2 , n3 & P2 : n1 , n6 , n5 , n4 , n3 → red → no shared edge → 0
P1 : n1 , n2 , n3 , n4 & P2 : n1 , n6 , n5 , n4 → red → no shared edge → 0
P1 : n1 , n2 , n3 , n4 , n5 & P2 : n1 , n6 , n5 → red → no shared edge → 0
P1 : n1 , n2 , n3 , n4 , n5 , n6 & P2 : n1 , n6 → red → no shared edge → 0
Ln (CY C) is 0.
(b) In Figure (1.6), an odd-cycle-neutrosophic graph is illustrated. Some

P1 : n1 , n2 & P2 : n1 , n5 , n4 , n3 , n2 → red
P1 : n1 , n2 , n3 & P2 : n1 , n5 , n4 , n3 → red
P1 : n1 , n2 , n3 , n4 & P2 : n1 n5 , n4 → red
P1 : n1 , n2 , n3 , n4 , n5 & P2 : n1 , n5 → red
The number is 1;

(iii) L(CY C) = 1;
P1 : n1 , n2 & P2 : n1 , n5 , n4 , n3 , n2 → red → no shared edge → 0
P1 : n1 , n2 , n3 & P2 : n1 , n5 , n4 , n3 → red → no shared edge → 0
P1 : n1 , n2 , n3 , n4 & P2 : n1 , n5 , n4 → red → no shared edge → 0
P1 : n1 , n2 , n3 , n4 , n5 & P2 : n1 , n5 → red → no shared edge → 0
Ln (CY C) is 0.
14


Proposition 1.5.7. Let N T G : (V, E, σ, µ) be a star-neutrosophic graph with

center c. Then
L(ST R1,σ2 ) = 1.
Proof. Suppose ST R1,σ2 : (V, E, σ, µ) is a star-neutrosophic graph. An edge

always has center as one of its endpoints. All paths have one as their lengths,
forever. So for given vertex, y, there’s only one path from center to y. If two
paths from center to y share one edge, then they’re assigned to different colors
but there’s only one path and indeed, there’s only one edge. The set of colors,
{red}, in this process is called path-coloring set from x to y. The minimum
cardinality between all path-coloring sets from two given vertices, 1, is called
path-coloring number and it’s denoted by L(ST R1,σ2 ). Thus
L(ST R1,σ2 ) = 1.
The clarifications about results are in progress as follows. A star-neutrosophic

graph is related to previous result and it’s studied to apply the definitions on it.
15
1. Initial Notions
To make it more clear, next part gives one special case to apply definitions and
results on it. Some items are devised to make more sense about new notions. A
star-neutrosophic graph is related to previous result and it’s studied to apply
the definitions on it, too.
Example 1.5.8. There is one section for clarifications. In Figure (1.7), a star-
neutrosophic graph is illustrated. Some points are represented in follow-up
items as follows.
P : n1 , n2 → red
P : n1 , n3 → red
P : n1 , n4 → red
P : n1 , n5 → red
The number is 1;
(iii) L(ST R1,σ2 ) = 1;
(iv) the position of given vertices are the same with only exception the center
n1 ;
(v) there’s only one path between the vertex n1 and other vertices. There’s
no shared edge;
P : n1 , n2 → red → no shared edge → 0

Ln (ST R1,σ2 ) is 0.
Proposition 1.5.9. Let N T G : (V, E, σ, µ) be a complete-bipartite-neutrosophic

graph. Then
L(CM Cσ1 ,σ2 ) = min |S|.
S
Proof. Suppose CM Cσ1 ,σ2 : (V, E, σ, µ) is a complete-bipartite-neutrosophic

graph. For given two vertices, x and y, there are some paths from x to y. If
The set of colors in this process is called path-coloring set from x to y. The
minimum cardinality between all path-coloring sets from two given vertices is
called path-coloring number and it’s denoted by L(CM Cσ1 ,σ2 ). Thus
L(CM Cσ1 ,σ2 ) = min |S|.

S
16


bipartite-neutrosophic graph is related to previous result and it’s studied to
apply the definitions on it. To make it more clear, next part gives one special
case to apply definitions and results on it. Some items are devised to make
more senses about new notions. A complete-bipartite-neutrosophic graph is
related to previous result and it’s studied to apply the definitions on it, too.
Example 1.5.10. There is one section for clarifications. In Figure (1.8),

a complete-bipartite-neutrosophic graph is illustrated. Some points are
represented in follow-up items as follows.
P1 : n1 , n2 & P2 : n1 , n3 , n4 , n2 → red
P1 : n1 , n3 & P2 : n1 , n2 , n4 , n3 → red
P1 : n1 , n3 , n4 & P2 : n1 , n2 , n4 → red
P1 : n2 , n4 , n3 & P2 : n2 , n1 , n3 → red
P1 : n2 , n4 & P2 : n2 , n1 , n3 , n4 → red
P1 : n3 , n4 & P2 : n3 , n1 , n2 , n4 → red
The number is 1;
(iii) L(CM Cσ1 ,σ2 ) = 1;
(iv) the position of given vertices could be different in the terms of creating
path and the behaviors in path;
17
1. Initial Notions


P1 : n1 , n2 & P2 : n1 , n3 , n4 , n2 → red → no shared edge → 0
P1 : n1 , n3 , n4 & P2 : n1 , n2 , n4 → red → no shared edge → 0
Ln (CM Cσ1 ,σ2 ) is 0.
Proposition 1.5.11. Let N T G : (V, E, σ, µ) be a complete-t-partite-neutrosophic

graph where t ≥ 3. Then
L(CM Cσ1 ,σ2 ,··· ,σt ) = min |S|.
S
Proof. Suppose CM Cσ1 ,σ2 ,··· ,σt : (V, E, σ, µ) is a complete-t-partite-

neutrosophic graph. For given two vertices, x and y, there are some paths
different colors. The set of colors in this process is called path-coloring set from
x to y. The minimum cardinality between all path-coloring sets from two given
vertices is called path-coloring number and it’s denoted by L(CM Cσ1 ,σ2 ,··· ,σt ).
Thus
L(CM Cσ1 ,σ2 ,··· ,σt ) = min |S|.
S

The clarifications about results are in progress as follows. A complete-t-
partite-neutrosophic graph is related to previous result and it’s studied to apply
the definitions on it. To make it more clear, next part gives one special case
to apply definitions and results on it. Some items are devised to make more
sense about new notions. A complete-t-partite-neutrosophic graph is related to
previous result and it’s studied to apply the definitions on it, too.
18
Example 1.5.12. There is one section for clarifications. In Figure (1.9), a

complete-t-partite-neutrosophic graph is illustrated. Some points are represented
in follow-up items as follows.
P1 : n1 , n2 & P2 : n1 , n3 , n4 , n2 & P3 : n1 , n5 , n4 , n2 → red&blue

P1 : n1 , n3 , n4 & P2 : n1 , n2 , n4 & P3 : n1 , n5 , n4 → red
The number is 1;
(iii) L(CM Cσ1 ,σ2 ,··· ,σt ) = 1;
P1 : n1 , n2 & P2 : n1 , n3 , n4 , n2 & P3 : n1 , n5 , n4 , n2 → shared edge:n4 n2 → 0.8

P1 : n1 , n3 , n4 & P2 : n1 , n2 , n4 & P3 : n1 , n5 , n4 → no shared edge → 0
P1 : n3 , n4 & P2 : n3 , n1 , n2 , n4 & P3 : n3 , n1 , n5 , n4 → shared edge:n3 n1 → 1
Ln (CM Cσ1 ,σ2 ,··· ,σt ) is 0.
Proposition 1.5.13. Let N T G : (V, E, σ, µ) be a wheel-neutrosophic graph.

Then
L(W HL1,σ2 ) = min |S|.
S
Proof. Suppose W HL1,σ2 : (V, E, σ, µ) is a wheel-neutrosophic graph. The

argument is elementary. All vertices of a cycle join to one vertex. For given
two vertices, x and y, there are some paths from x to y. If two paths from x to
y share one edge, then they’re assigned to different colors. The set of colors in
this process is called path-coloring set from x to y. The minimum cardinality
between all path-coloring sets from two given vertices is called path-coloring
number and it’s denoted by L(W HL1,σ2 ). Thus
L(W HL1,σ2 ) = min |S|.

S
19
1. Initial Notions

The clarifications about results are in progress as follows. A wheel-

neutrosophic graph is related to previous result and it’s studied to apply
the definitions on it. To make it more clear, next part gives one special case to
about new notions. A wheel-neutrosophic graph is related to previous result
wheel-neutrosophic graph is illustrated. Some points are represented in follow-
up items as follows.
P1 : n1 , n2 & P2 : n1 , n3 , n2 & P3 : n1 , n4 , n3 , n2 & P4 : n1 , n4 , n5 , n2
& P5 : n1 , n5 , n2 → red&blue
& P5 : n1 , n4 , n3 → red&blue
& P5 : n1 , n5 , n4 → red&blue
& P5 : n1 , n4 , n5 → red&blue
P1 : n2 , n3 & P2 : n2 , n1 , n3 & P3 : n2 , n1 , n4 , n3 & P4 : n2 , n1 , n5 , n4 , n3
& P5 : n2 , n5 , n1 , n3 & P6 : n2 , n5 , n1 , n4 , n3 & P7 : n2 , n5 , n4 , n3
→ red&blue&pink&purple
P1 : n2 , n1 , n4 & P2 : n2 , n1 , n3 , n4 & P3 : n2 , n1 , n5 , n4 & P4 : n2 , n3 , n4
& P5 : n2 , n3 , n1 , n4 & P6 : n2 , n3 , n1 , n5 , n4 & P7 : n2 , n5 , n4
& P8 : n2 , n5 , n1 , n4 & P9 : n2 , n5 , n1 , n3 , n4 → red&blue&pink&purple
20

The number is 2;
(iii) L(W HL1,σ2 ) = 2;
(iv) the position of given vertices are different in the terms of creating path
and the behaviors in path. There are three different cases in the terms of
paths;
(v) there are either five or seven paths but there are two or four shared edge;

& P5 : n1 , n5 , n2 → shared edges: n3 n2 , n1 n4 → 1.6;
→ shared edges: n4 n3 , n2 n5 , n2 n1 → 2.5;
& P8 : n2 , n5 , n1 , n4 & P9 : n2 , n5 , n1 , n3 , n4
→ shared edges: n2 n1 , n2 n3 , n3 n1 , n4 n5 → 3.4;
21
1. Initial Notions


& P8 : n3 , n4 , n1 , n5 & P9 : n3 , n4 , n1 , n2 , n5
Ln (W HL1,σ2 ) is 1.6.
1.6 Setting of neutrosophic path-coloring number

In this section, I provide some results in the setting of neutrosophic path-coloring
number. Some classes of neutrosophic graphs are chosen. Complete-neutrosophic
about them.
Then
3
XX
Ln (CM T σ ) = min µi (e).
S
e∈S i=1

22
1.6. Setting of neutrosophic path-coloring number
colors. The set S of shared edges in this process is Pcalled
P3path-coloring set
from x to y. The minimum neutrosophic cardinality, e∈S i=1 µi (e), between
all path-coloring sets, Ss, is called neutrosophic path-coloring number and it’s
denoted by Ln (CM T σ ).Thus
3
XX
Ln (CM T σ ) = min µi (e).
S
e∈S i=1

P1 : n1 , n2 → red
P2 : n1 , n3 , n2 → red
P3 : n1 , n4 , n2 → red
P4 : n1 , n3 , n4 , n2 → blue
P5 : n1 , n4 , n3 , n2 → yellow

L(CM T σ ) = 3;
same;
23
1. Initial Notions



it’s denoted by Ln (CM T σ ) = 1.5.

graph.
3
X
Ln (P T H) = min µi (e).
e∈S
i=1

x1 , x2 , · · · , xO(P T H) be a path-neutrosophic graph. For given two vertices, x
and y, there’s only one path from x to y. If two paths from x to y share one edge,
start and end. The set S of shared edges in this process is called
P path-coloring
P3
24

and it’s denoted by Ln (P T H). Thus
3
X
Ln (P T H) = min µi (e).
e∈S
i=1

n1 , n2 → red
n1 , n2 , n3 → blue
n1 , n2 , n3 , n4 → yellow
n1 , n2 , n3 , n4 , n5 → green
n2 , n3 → red
n2 , n3 , n4 → pink
n2 , n3 , n4 , n5 → brown
n3 , n4 → red
n3 , n4 , n5 → blue
n4 , n5 → red
The number is 6;
(iii) L(P T H) = 6;


summation of 5 numbers is neutrosophic path-coloring number. every
color is compared with its previous color. The way is a consecutive
procedure;
25
1. Initial Notions
n1 , n2 → red
n1 , n2 , n3 → blue → n1 n2 → 0.8
n1 , n2 , n3 , n4 → yellow → n1 n2 , n2 n3 → 1.3
n2 , n3 → red
n2 , n3 , n4 → pink → n2 n3 , n3 n4 → 1.3
n2 , n3 , n4 , n5 → brown → n2 n3 , n3 n4 → 1.3
n3 , n4 → red
n3 , n4 , n5 → blue → n3 n4 → 0.7
n4 , n5 → red
Ln (P T H) is 5.6.

n1 , n2 → red
n1 , n2 , n3 → red
n1 , n2 , n3 , n4 → red
n1 , n2 , n3 , n4 , n5 → red
n1 , n2 , n3 , n4 , n5 , n6 → red
n2 , n3 → red
n2 , n3 , n4 → red
n2 , n3 , n4 , n5 → red
n2 , n3 , n4 , n5 , n6 → red
n3 , n4 → red
n3 , n4 , n5 → red
n4 , n5 → red
The number is 1;

(iii) L(P T H) = 1;
n1 , n2 → red
26



n2 , n3 → red
n3 , n4 → red
n4 , n5 → red
Ln (P T H) is 0.

O(CY C) ≥ 3. Then
X 3
Ln (CY C) = min µi (e).
e∈S
i=1
Proof. Suppose CY C : (V, E, σ, µ) is a cycle-neutrosophic graph. For given

two vertices, x and y, there are only two paths from x to y. If two paths
27
1. Initial Notions
from x to y share one edge, then they’re assigned to different colors but these
two paths don’t share one edge. The set S of shared edges in this process is
called path-coloring set from x to y. The minimum neutrosophic cardinality,
P P 3
e∈S i=1 µi (e), between all path-coloring sets, Ss, is called neutrosophic
path-coloring number and it’s denoted by
3
X
Ln (CY C) = min µi (e).
e∈S
i=1

P1 : n1 , n2 & P2 : n1 , n6 , n5 , n4 , n3 , n2 → red
P1 : n1 , n2 , n3 & P2 : n1 , n6 , n5 , n4 , n3 → red
P1 : n1 , n2 , n3 , n4 & P2 : n1 , n6 , n5 , n4 → red
P1 : n1 , n2 , n3 , n4 , n5 & P2 : n1 , n6 , n5 → red
P1 : n1 , n2 , n3 , n4 , n5 , n6 & P2 : n1 , n6 → red
The number is 1;

(iii) L(CY C) = 1;

Ln (CY C) is 0.

28

P1 : n1 , n2 & P2 : n1 , n5 , n4 , n3 , n2 → red
P1 : n1 , n2 , n3 & P2 : n1 , n5 , n4 , n3 → red
P1 : n1 , n2 , n3 , n4 & P2 : n1 n5 , n4 → red
P1 : n1 , n2 , n3 , n4 , n5 & P2 : n1 , n5 → red
The number is 1;

(iii) L(CY C) = 1;

Ln (CY C) is 0.

center c. Then
X3
Ln (ST R1,σ2 ) = min µi (e).
e∈S
i=1

29
1. Initial Notions

but there’s only one path and indeed, there’s only one edge. The set S of shared
edges in this process is called
P path-coloring
P3 set from x to y. The minimum
neutrosophic cardinality, e∈S i=1 µi (e), between all path-coloring sets, Ss,
is called neutrosophic path-coloring number and it’s denoted by Ln (ST R1,σ2 ).
Thus
X3
Ln (ST R1,σ2 ) = min µi (e).
e∈S
i=1

items as follows.
P : n1 , n2 → red
P : n1 , n3 → red
P : n1 , n4 → red
P : n1 , n5 → red
The number is 1;
(iii) L(ST R1,σ2 ) = 1;
n1 ;
30

no shared edge;

Ln (ST R1,σ2 ) is 0.

graph. Then
XX 3
Ln (CM Cσ1 ,σ2 ) = min µi (e).
S
e∈S i=1

The set S of shared edges in this process is called
P path-coloring
P3 set from x
to y. The minimum neutrosophic cardinality, e∈S i=1 µi (e), between all
path-coloring sets, Ss, is called neutrosophic path-coloring number and it’s
denoted by Ln (CM Cσ1 ,σ2 ). Thus
3
XX
Ln (CM Cσ1 ,σ2 ) = min µi (e).
S
e∈S i=1

31
1. Initial Notions

P1 : n1 , n2 & P2 : n1 , n3 , n4 , n2 → red
P1 : n1 , n3 & P2 : n1 , n2 , n4 , n3 → red
P1 : n1 , n3 , n4 & P2 : n1 , n2 , n4 → red
P1 : n2 , n4 , n3 & P2 : n2 , n1 , n3 → red
P1 : n2 , n4 & P2 : n2 , n1 , n3 , n4 → red
P1 : n3 , n4 & P2 : n3 , n1 , n2 , n4 → red
The number is 1;
(iii) L(CM Cσ1 ,σ2 ) = 1;

Ln (CM Cσ1 ,σ2 ) is 0.

3
XX
Ln (CM Cσ1 ,σ2 ,··· ,σt ) = min µi (e).
S
e∈S i=1

different colors. The set S of shared edges in this process is called
P path-coloring
P3
32


and it’s denoted by Ln (CM Cσ1 ,σ2 ,··· ,σt ). Thus
3
XX
Ln (CM Cσ1 ,σ2 ,··· ,σt ) = min µi (e).
S
e∈S i=1


The number is 1;
(iii) L(CM Cσ1 ,σ2 ,··· ,σt ) = 1;
33
1. Initial Notions

Ln (CM Cσ1 ,σ2 ,··· ,σt ) is 0.

Then
XX 3
Ln (W HL1,σ2 ) = min µi (e).
S
e∈S i=1

y share one edge, then they’re assigned to different colors. The set S of shared
edges in this process is called
P path-coloring
neutrosophic cardinality, e∈S i=1 µi (e), between all path-coloring sets, Ss,
is called neutrosophic path-coloring number and it’s denoted by Ln (W HL1,σ2 ).
Thus
XX 3
Ln (W HL1,σ2 ) = min µi (e).
S
e∈S i=1

34


& P5 : n1 , n5 , n2 → red&blue
& P5 : n1 , n4 , n3 → red&blue
& P5 : n1 , n5 , n4 → red&blue
& P5 : n1 , n4 , n5 → red&blue
The number is 2;
(iii) L(W HL1,σ2 ) = 2;
35
1. Initial Notions
paths;
& P8 : n2 , n5 , n1 , n4 & P9 : n2 , n5 , n1 , n3 , n4
& P8 : n3 , n4 , n1 , n5 & P9 : n3 , n4 , n1 , n2 , n5
Ln (W HL1,σ2 ) is 1.6.
1.7 Applications in Time Table and Scheduling

In this section, two applications for time table and scheduling are provided where
the models are either complete models which mean complete connections are
36
1.7. Applications in Time Table and Scheduling

formed as individual and family of complete models with common neutrosophic

vertex set or quasi-complete models which mean quasi-complete connections
are formed as individual and family of quasi-complete models with common
neutrosophic vertex set.
Designing the programs to achieve some goals is general approach to apply on
some issues to function properly. Separation has key role in the context of this
style. Separating the duration of work which are consecutive, is the matter and
it has importance to avoid mixing up.
Step 1. (Definition) Time table is an approach to get some attributes to do

the work fast and proper. The style of scheduling implies special attention
to the tasks which are consecutive.
Step 2. (Issue) Scheduling of program has faced with difficulties to differ amid
consecutive sections. Beyond that, sometimes sections are not the same.
Step 3. (Model) The situation is designed as a model. The model uses data to
assign every section and to assign to relation amid sections, three numbers
belong unit interval to state indeterminacy, possibilities and determinacy.
There’s one restriction in that, the numbers amid two sections are at least
the number of the relations amid them. Table (1.1), clarifies about the
assigned numbers to these situations.
Table 1.1: Scheduling concerns its Subjects and its Connections as a neutrosophic
graph in a Model. 76tbl1
Sections of N T G n1 n2 · · · n5
Values (0.7, 0.9, 0.3) (0.4, 0.2, 0.8)· · · (0.4, 0.2, 0.8)
Connections of N T G E1 E2 · · · E6
Values (0.4, 0.2, 0.3) (0.5, 0.2, 0.3)· · · (0.3, 0.2, 0.3)
37
1. Initial Notions

and its neutrosophic path-coloring number 76NTG20
1.8 Case 1: Complete-t-partite Model alongside its

path-coloring number and its neutrosophic
path-coloring number
Step 4. (Solution) The neutrosophic graph alongside its path-coloring number

and its neutrosophic path-coloring number as model, propose to use
specific number. Every subject has connection with some subjects. Thus
the connection is applied as possible and the model demonstrates quasi-full
connections as quasi-possible. Using the notion of strong on the connection
amid subjects, causes the importance of subject goes in the highest level
such that the value amid two consecutive subjects, is determined by those
subjects. If the configuration is star, the number is different. Also, it holds
for other types such that complete, wheel, path, and cycle. The collection
of situations is another application of its path-coloring number and its
neutrosophic path-coloring number when the notion of family is applied in
the way that all members of family are from same classes of neutrosophic
graphs. As follows, There are five subjects which are represented as Figure
(1.20). This model is strong and even more it’s quasi-complete. And the
study proposes using specific number which is called its path-coloring
number and its neutrosophic path-coloring number. There are also some
analyses on other numbers in the way that, the clarification is gained
about being special number or not. Also, in the last part, there is one
neutrosophic number to assign to this model and situation to compare
them with same situations to get more precise. Consider Figure (1.20).
In Figure (1.20), an complete-t-partite-neutrosophic graph is illustrated.
Some points are represented in follow-up items as follows.

38
1.9. Case 2: Complete Model alongside its A Neutrosophic Graph in the
Viewpoint of its path-coloring number and its neutrosophic path-coloring
number


The number is 1;

(iii) L(CM Cσ1 ,σ2 ,··· ,σt ) = 1;

Ln (CM Cσ1 ,σ2 ,··· ,σt ) is 0.
1.9 Case 2: Complete Model alongside its A

Neutrosophic Graph in the Viewpoint of its

specific number. Every subject has connection with every given subject
in deemed way. Thus the connection applied as possible and the model
demonstrates full connections as possible between parts but with different
view where symmetry amid vertices and edges are the matters. Using the
39
1. Initial Notions
notion of strong on the connection amid subjects, causes the importance of

subject goes in the highest level such that the value amid two consecutive
subjects, is determined by those subjects. If the configuration is complete
multipartite, the number is different. Also, it holds for other types such
that star, wheel, path, and cycle. The collection of situations is another
application of its path-coloring number and its neutrosophic path-coloring
number when the notion of family is applied in the way that all members
of family are from same classes of neutrosophic graphs. As follows, There
are four subjects which are represented in the formation of one model as
Figure (1.21). This model is neutrosophic strong as individual and even
more it’s complete. And the study proposes using specific number which is
called its path-coloring number and its neutrosophic path-coloring number
for this model. There are also some analyses on other numbers in the
way that, the clarification is gained about being special number or not.
Also, in the last part, there is one neutrosophic number to assign to these
models as individual. A model as a collection of situations to compare
them with another model as a collection of situations to get more precise.
Consider Figure (1.21). There is one section for clarifications.
P1 : n1 , n2 → red
P2 : n1 , n3 , n2 → red
P3 : n1 , n4 , n2 → red
P4 : n1 , n3 , n4 , n2 → blue
P5 : n1 , n4 , n3 , n2 → yellow

the same as red. The path P4 has shared edge n1 n3 with P2 and
shared edge n4 n2 with P3 thus it’s been colored the different color
as blue in comparison to them. The path P5 has shared edge n1 n4
with P3 and shared edge n3 n4 with P4 thus it’s been colored the
different color as yellow in comparison to different paths in the terms
of different colors. Thus S = {red, blue, yellow} is path-coloring set
and its cardinality, 3, is path-coloring number. To sum them up, for
given two vertices, x and y, there are some paths from x to y. If two
paths from x to y share one edge, then they’re assigned to different
colors. The set of colors, S = {red, blue, yellow}, in this process
is called path-coloring set from x to y. The minimum cardinality
between all path-coloring sets from two given vertices, 3, is called
path-coloring number and it’s denoted by L(CM T σ ) = 3;
(ii) all vertices have same positions in the matter of creating paths. So
for every two given vertices, the number and the behaviors of paths
are the same;
(iv) shared edges form a set of representatives of colors. Each color
is corresponded to an edge which has minimum neutrosophic
cardinality;
40
1.10. Open Problems

cardinality. Minimum neutrosophic cardinality is obtained in this
way but other way is to use all shared edges to form S and after that
minimum neutrosophic cardinality is optimal;
(vi) two edges n1 n3 and n4 n2 are shared with P4 by P3 and P2 .
The minimum neutrosophic cardinality is 0.6 corresponded to
n4 n2 . Other corresponded color has only one shared edge n3 n4
and minimum neutrosophic cardinality is 0.9. Thus minimum
neutrosophic cardinality is 1.5. And corresponded set is S =
{n4 n2 , n3 n4 }. To sum them up, for given two vertices, x and y, there
are some paths from x to y. If two paths from x to y share one edge,
then they’re assigned to different colors. The set S = {n4 n2 , n3 n4 }
P3 set from x to y.
P
The minimum neutrosophic cardinality, e∈S i=1 µi (e), between
all path-coloring sets, Ss, is called neutrosophic path-coloring number
and it’s denoted by Ln (CM T σ ) = 1.5.
1.10 Open Problems

In this section, some questions and problems are proposed to give some avenues
to pursue this study. The structures of the definitions and results give some
ideas to make new settings which are eligible to extend and to create new study.
Notion concerning its path-coloring number and its neutrosophic path-coloring
number are defined in neutrosophic graphs. Thus,
Question 1.10.1. Is it possible to use other types of its path-coloring number
and its neutrosophic path-coloring number?
Question 1.10.2. Are existed some connections amid different types of its path-
coloring number and its neutrosophic path-coloring number in neutrosophic
graphs?
Question 1.10.3. Is it possible to construct some classes of neutrosophic graphs
which have “nice” behavior?
Question 1.10.4. Which mathematical notions do make an independent study
to apply these types in neutrosophic graphs?
Problem 1.10.5. Which parameters are related to this parameter?
Problem 1.10.6. Which approaches do work to construct applications to create
independent study?
Problem 1.10.7. Which approaches do work to construct definitions which use
all definitions and the relations amid them instead of separate definitions to
create independent study?
1.11 Conclusion and Closing Remarks

In this section, concluding remarks and closing remarks are represented. The
drawbacks of this article are illustrated. Some benefits and advantages of this
study are highlighted.
41
1. Initial Notions
This study uses two definitions concerning path-coloring number and neutro-
sophic path-coloring number arising from different types of paths based on
shared edges amid them in neutrosophic graphs assigned to neutrosophic graphs.
Consider two vertices. Minimum number of shared edges based on those vertices
in the formations of all paths with those vertices as their starts and their ends
to compare with other paths, is a number which is representative based on
those vertices. Minimum neutrosophic number of shared edges amid neutro-
sophic cardinality of all sets of shared edges is called neutrosophic path-coloring
number. The connections of paths which aren’t clarified by a common edge
differ them from each other and put them in different categories to represent a
Table 1.2: A Brief Overview about Advantages and Limitations of this Study 76tbl2
Advantages Limitations
1. path-coloring number of Model 1. Connections amid Classes
2. neutrosophic path-coloring number of Model
3. Minimal path-coloring sets 2. Study on Families
4. Shared Edges amid all Paths
5. Acting on All Paths 3. Same Models in Family
number which is called path-coloring number and neutrosophic path-coloring

in neutrosophic graphs assigned to neutrosophic graphs. Further studies could
be about changes in the settings to compare these notions amid different set-
tings of neutrosophic graphs theory. One way is finding some relations amid
all definitions of notions to make sensible definitions. In Table (1.2), some
limitations and advantages of this study are pointed out.
42
Bibliography
Ref1 [1] M. Akram, and G. Shahzadi, “Operations on Single-Valued Neutrosophic

Graphs”, Journal of uncertain systems 11 (1) (2017) 1-26.
Ref2 [2] K. Atanassov, “Intuitionistic fuzzy sets”, Fuzzy Sets Syst. 20 (1986) 87-96.
Ref3 [3] S. Broumi et al., “Single-valued neutrosophic graphs”, Journal of New

Theory 10 (2016) 86-101.
Ref4 [4] S. Corteel et al., “The permutation-path coloring problem on trees”,

Theoretical Computer Science 297 (1-3) (2003) 119-143.
Ref5 [5] O. Dagdeviren, and V. Khalilpour Akram, “Pack: Path coloring based
k-connectivity detection algorithm for wireless sensor networks”, Ad Hoc
Networks 64 (2017) 41-52.
Ref6 [6] X. Deng et al., “A 2-approximation algorithm for path coloring on a

restricted class of trees of rings”, Journal of Algorithms 47 (1) (2003)
1-13.
Ref7 [7] T. Erlebach, and Klaus Jansen, “The complexity of path coloring and call
scheduling”, Theoretical Computer Science 255 (1-2) (2001) 33-50.
Ref8 [8] L. Gargano, and A.R. Rescigno, “Collision-free path coloring with
application to minimum-delay gathering in sensor networks”, Discrete
Applied Mathematics 157 (8) (2009) 1858-1872.
Ref9 [9] Henry Garrett, (2022). “Beyond Neutrosophic Graphs”, Ohio: E-

publishing: Educational Publisher 1091 West 1st Ave Grand-
view Heights, Ohio 43212 United States. ISBN: 978-1-59973-725-6
(http://fs.unm.edu/BeyondNeutrosophicGraphs.pdf).
Ref10 [10] Henry Garrett, “Dimension and Coloring alongside Domination in Neut-
rosophic Hypergraphs”, Preprints 2021, 2021120448 (doi: 10.20944/pre-
prints202112.0448.v1).
Ref11 [11] Henry Garrett, “Properties of SuperHyperGraph and Neut-

rosophic SuperHyperGraph”, Neutrosophic Sets and Sys-
tems 49 (2022) 531-561 (doi: 10.5281/zenodo.6456413).
(http://fs.unm.edu/NSS/NeutrosophicSuperHyperGraph34.pdf).
(https://digitalrepository.unm.edu/nss_journal/vol49/iss1/34).
43
Bibliography
Ref12 [12] Henry Garrett, “Three Types of Neutrosophic Alliances based on Con-
nectedness and (Strong) Edges”, Preprints 2022, 2022010239 (doi:
10.20944/preprints202201.0239.v1).
Ref13 [13] N. Shah, and A. Hussain, “Neutrosophic soft graphs”, Neutrosophic Set
and Systems 11 (2016) 31-44.
Ref14 [14] A. Shannon and K.T. Atanassov, “A first step to a theory of the
intuitionistic fuzzy graphs”, Proceeding of FUBEST (Lakov, D., Ed.)
Sofia (1994) 59-61.
Ref15 [15] F. Smarandache, “A Unifying field in logics neutrosophy: Neutrosophic
probability, set and logic, Rehoboth: ” American Research Press (1998).
Ref16 [16] H. Wang et al., “Single-valued neutrosophic sets”, Multispace and
Multistructure 4 (2010) 410-413.
Ref17 [17] L. A. Zadeh, “Fuzzy sets”, Information and Control 8 (1965) 338-354.
44
CHAPTER 2
Modified Notions
[Ref2] Henry Garrett, “Neutrosophic Dominating Path-Coloring Numbers

in New Visions of Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.32151.65445).
Neutrosophic Dominating Path-Coloring Numbers in New Visions

of Classes of Neutrosophic Graphs
2.1 Abstract
New setting is introduced to study dominating path-coloring number and
neutrosophic dominating path-coloring number arising from different types of
paths based on shared edges amid them in neutrosophic graphs assigned to
neutrosophic graphs. Consider two vertices. Minimum number of shared edges
based on those vertices in the formations of all paths with those vertices as
their starts and their ends to compare with other paths, is a number which
is representative based on those vertices. Minimum neutrosophic number of
neutrosophic dominating path-coloring number. Forming sets from special paths
to figure out different types of number of paths having smallest number of colors
from shared edges from two vertices are given in the terms of minimum number
of paths to get minimum number to assign to neutrosophic graphs is key type
of approach to have these notions namely dominating path-coloring number
and neutrosophic dominating path-coloring number arising from different types
of paths based on shared edges amid them in neutrosophic graphs assigned to
neutrosophic graphs. Two numbers and one set are assigned to a neutrosophic
graph, are obtained but now both settings lead to approach is on demand which
is to compute and to find representatives of paths having smallest number of
colors from shared edges from two vertices are given forming different types
of sets of paths in the terms of minimum number and minimum neutrosophic
number forming it to get minimum number to assign to a neutrosophic graph.
Let N T G : (V, E, σ, µ) be a neutrosophic graph. Then for given two vertices,
x and y, there are some paths from x to y. If two paths from x to y share
one edge, then they’re assigned to different colors. The set of different colors,
S, in this process is called dominating path-coloring set from x to y if for
45
2. Modified Notions
every edge outside there’s at least one edge inside which they’ve common
vertex. The minimum cardinality between all dominating path-coloring sets
from two given vertices is called dominating path-coloring number and it’s
denoted by Q(N T G); for given two vertices, x and y, there are some paths
from x to y. If two paths from x to y share one edge, then they’re assigned
to different colors. The set S of different colors in this process is called
dominating path-coloring set from x to y if for every edge outside there’s at
least one edgePinside
Pwhich they’ve common vertex. The minimum neutrosophic
3
cardinality, e∈S i=1 µi (e), between all dominating path-coloring sets, Ss,
is called neutrosophic dominating path-coloring number and it’s denoted by
Qn (N T G). As concluding results, there are some statements, remarks, examples
and clarifications about some classes of neutrosophic graphs namely path-
neutrosophic graphs, cycle-neutrosophic graphs, complete-neutrosophic graphs,
star-neutrosophic graphs, complete-bipartite-neutrosophic graphs, complete-t-
partite-neutrosophic graphs and wheel-neutrosophic graphs. The clarifications
are also presented in both sections “Setting of dominating path-coloring number,”
and “Setting of neutrosophic dominating path-coloring number,” for introduced
results and used classes. This approach facilitates identifying paths which
form dominating path-coloring number and neutrosophic dominating path-
coloring number arising from different types of paths based on shared edges
amid them in neutrosophic graphs assigned to neutrosophic graphs. In both
settings, some classes of well-known neutrosophic graphs are studied. Some
clarifications for each result and each definition are provided. The cardinality
of set of shared edges and neutrosophic cardinality of set of shared edges
have eligibility to define dominating path-coloring number and neutrosophic
dominating path-coloring number but different types of shared edges have
eligibility to define dominating path-coloring sets. Some results get more
frameworks and perspective about these definitions. The way in that, different
types of shared edges having smallest number from all paths from two vertices
are given forming different types of sets in the terms of minimum number of
shared edges having smallest number of different paths from two vertices are
given and smallest number of shared edges having smallest number of paths
from two vertices are given forming it to get minimum number to assign to
neutrosophic graphs or in other words, the way in that, consider two vertices.
Minimum number of shared edges based on those vertices in the formations of
all paths with those vertices as their starts and their ends to compare with other
paths, is a number which is representative based on those vertices; Minimum
neutrosophic number of shared edges amid neutrosophic cardinality of all sets of
shared edges is called neutrosophic dominating path-coloring number, opens the
way to do some approaches. These notions are applied into neutrosophic graphs
this study. Neutrosophic dominating path-coloring notion is applied to different
settings and classes of neutrosophic graphs. Some problems are proposed to
pursue this study. Basic familiarities with graph theory and neutrosophic graph
theory are proposed for this article.
Keywords: Dominating Path-Coloring Number, Neutrosophic Dominating
Path-Coloring Number, Classes of Neutrosophic Graphs

46
2.2. Background
2.2 Background
Fuzzy set in Ref. [Ref22], intuitionistic fuzzy sets in Ref. [Ref2], a first
step to a theory of the intuitionistic fuzzy graphs in Ref. [Ref18], a unifying
field in logics neutrosophy: neutrosophic probability, set and logic, rehoboth in
Ref. [Ref19], single-valued neutrosophic sets in Ref. [Ref20], single-valued
neutrosophic graphs in Ref. [Ref4], operations on single-valued neutrosophic
graphs in Ref. [Ref1], neutrosophic soft graphs in Ref. [Ref17], even cycle
decompositions of index 3 by a novel coloring technique in Ref. [Ref3], list star
edge-coloring of claw-free subcubic multigraphs in Ref. [Ref5], on fractional
version of oriented coloring in Ref. [Ref6], domination and dominator colorings
in planar graphs with small diameter in Ref. [Ref11], graph polynomials
and paintability of plane graphs in Ref. [Ref12], the chromatic number
of signed graphs with bounded maximum average degree in Ref. [Ref13],
upper bound for dp-chromatic number of a graph in Ref. [Ref14], colouring
graphs of bounded diameter in the absence of small cycles in Ref. [Ref15],
note on injective edge-coloring of graphs in Ref. [Ref16], on r-hued list
coloring of K4(7)-minor free graphs in Ref. [Ref21], dimension and coloring
alongside domination in neutrosophic hypergraphs in Ref. [Ref8], three types
of neutrosophic alliances based on connectedness and (strong) edges in Ref.
[Ref10], properties of SuperHyperGraph and neutrosophic SuperHyperGraph in
Ref. [Ref9], are studied. Also, some studies and researches about neutrosophic
graphs, are proposed as a book in Ref. [Ref7].

Question 2.3.1. Is it possible to use mixed versions of ideas concerning
“dominating path-coloring number”, “neutrosophic dominating path-coloring
number” and “Neutrosophic Graph” to define some notions which are applied
to neutrosophic graphs?
have key roles to assign dominating path-coloring number and neutrosophic
dominating path-coloring number arising from different types of paths based
graphs. Thus they’re used to define new ideas which conclude to the structure
of dominating path-coloring number and neutrosophic dominating path-coloring
in neutrosophic graphs assigned to neutrosophic graphs. The concept of having
smallest number of paths with shared edge from two vertices are given inspires
us to study the behavior of all paths in the way that, some types of numbers,
dominating path-coloring number and neutrosophic dominating path-coloring
in neutrosophic graphs assigned to neutrosophic graphs, are the cases of study in
47
2. Modified Notions
the setting of individuals. In both settings, a corresponded numbers concludes

the discussion. Also, there are some avenues to extend these notions.
The framework of this study is as follows. In the beginning, I introduce basic
definitions to clarify about preliminaries. In subsection “Preliminaries”, new
notions of dominating path-coloring number and neutrosophic dominating
edges amid them in neutrosophic graphs assigned to neutrosophic graphs,
are highlighted, are introduced and are clarified as individuals. In section
“Preliminaries”, different types of paths and minimum numbers of shared
edges amid them from two vertices are neighbors forming different types
of sets in the terms of minimum numbers and minimal sets forming it to
get minimum number to assign to neutrosophic graphs, have the key role in
this way. General results are obtained and also, the results about the basic
notions of dominating path-coloring number and neutrosophic dominating
edges amid them in neutrosophic graphs assigned to neutrosophic graphs, are
elicited. Some classes of neutrosophic graphs are studied in the terms of
dominating path-coloring number and neutrosophic dominating path-coloring
in neutrosophic graphs assigned to neutrosophic graphs, in section “Setting
of dominating path-coloring number,” as individuals. In section “Setting
of dominating path-coloring number,” dominating path-coloring number is
applied into individuals. As concluding results, there are some statements,
remarks, examples and clarifications about some classes of neutrosophic
The clarifications are also presented in both sections “Setting of dominating
path-coloring number,” and “Setting of neutrosophic dominating path-coloring
number,” for introduced results and used classes. In section “Applications in
Time Table and Scheduling”, two applications are posed for quasi-complete
and complete notions, namely complete-neutrosophic graphs and complete-t-
partite-neutrosophic graphs concerning time table and scheduling when the
suspicions are about choosing some subjects and the mentioned models are
considered as individual. In section “Open Problems”, some problems and
2.4 Preliminaries
model.

48
2.4. Preliminaries

µ(vi vj ) ≤ σ(vi ) ∧ σ(vj ).

P
On (N T G).
(v) : |E| is called size of NTG and it’s denoted by Q(N T G).
P P3
by Sn (N T G).

about them.

V

_ ^
µ∞ (x0 , xt ) = µ(xi xi+1 );
P :x0 ,x1 ,··· ,xt i=0,··· ,t−1

and
i=0,1,··· ,n−1 µ(vi vi+1 );
s
49
2. Modified Notions

µ(vi vj ) ≤ σ(vi ) ∧ σ(vj ).
s
On (N T G);
W HL1,σ2 .
Definition 2.4.7. (dominating path-coloring numbers).
(i) for given two vertices, x and y, there are some paths from x to y. If
two paths from x to y share one edge, then they’re assigned to different
colors. The set of different colors, S, in this process is called dominating
path-coloring set from x to y if for every edge outside there’s at least
one edge inside which they’ve common vertex. The minimum cardinality
between all dominating path-coloring sets from two given vertices is called
dominating path-coloring number and it’s denoted by Q(N T G);
50
2.4. Preliminaries
(ii) for given two vertices, x and y, there are some paths from x to y. If
two paths from x to y share one edge, then they’re assigned to different
colors. The set S of different colors in this process is called dominating
path-coloring set from x to y if for every edge outside there’s at least
one edge inside
P which
P3they’ve common vertex. The minimum neutrosophic
cardinality, e∈S i=1 µi (e), between all dominating path-coloring sets,
Ss, is called neutrosophic dominating path-coloring number and
it’s denoted by Qn (N T G).
matters of mind.
P1 : n1 , n2 → red
P2 : n1 , n3 , n2 → red
P3 : n1 , n4 , n2 → red
P4 : n1 , n3 , n4 , n2 → blue
P5 : n1 , n4 , n3 , n2 → yellow

shared edge n3 n4 with P4 thus it’s been colored the different color as yellow
in comparison to different paths in the terms of different colors. Thus
S = {red, blue, yellow} is dominating path-coloring set and its cardinality,
3, is dominating path-coloring number. To sum them up, for given two
vertices, x and y, there are some paths from x to y. If two paths from x to y
share one edge, then they’re assigned to different colors. The set of colors,
S = {red, blue, yellow}, in this process is called dominating path-coloring
set from x to y. The minimum cardinality between all dominating path-
coloring sets from two given vertices, 3, is called dominating path-coloring
number and it’s denoted by Q(N T G) = 3;
same;
51
2. Modified Notions
Figure 2.1: A Neutrosophic Graph in the Viewpoint of its dominating path-

coloring number and its neutrosophic dominating path-coloring number. 77NTG1

set is S = {n4 n2 , n3 n4 }. To sum them up, for given two vertices, x and y,
there are some paths from x to y. If two paths from x to y share one edge,
then they’re assigned to different colors. The set S = {n4 n2 , n3 n4 } of
shared edges in this process is called dominatingP path-coloring
P3 set from x
to y. The minimum neutrosophic cardinality, e∈S i=1 µi (e), between
all dominating path-coloring sets, Ss, is called neutrosophic dominating
path-coloring number and it’s denoted by Qn (N T G) = 1.5.
2.5 Setting of dominating path-coloring number

In this section, I provide some results in the setting of dominating path-coloring
about them.
Then
Q(CM T σ ) = min |S|.

S

52
2.5. Setting of dominating path-coloring number
colors. The set of colors in this process is called dominating path-coloring set
from x to y. The minimum cardinality between all dominating path-coloring
sets from two given vertices is called dominating path-coloring number and it’s
denoted by Q(CM T σ ). Thus
Q(CM T σ ) = min |S|.

S

P1 : n1 , n2 → red
P2 : n1 , n3 , n2 → red
P3 : n1 , n4 , n2 → red
P4 : n1 , n3 , n4 , n2 → blue
P5 : n1 , n4 , n3 , n2 → yellow

number and it’s denoted by Q(CM T σ ) = 3;
same;
53
2. Modified Notions


P3 set from x
path-coloring number and it’s denoted by Qn (CM T σ ) = 1.5.

graph.
O(P T H)
Q(P T H) = b c.
3
x and y, there’s one paths from x to y. If two paths from x to y share one edge,
start and end. The set of colors,{red}, in this process is called dominating
path-coloring set from x to y. The minimum cardinality between all dominating
path-coloring sets, 1, from two given vertices is called dominating path-coloring
number and it’s denoted by Q(P T H). Thus
O(P T H)
Q(P T H) = b c.
3

54

n1 , n2 → red
n1 , n2 , n3 → blue
n1 , n2 , n3 , n4 → yellow
n1 , n2 , n3 , n4 , n5 → green
n2 , n3 → red
n2 , n3 , n4 → pink
n2 , n3 , n4 , n5 → brown
n3 , n4 → red
n3 , n4 , n5 → blue
n4 , n5 → red
The number is 6;

(iii) Q(P T H) = 6;
summation of 5 numbers is neutrosophic dominating path-coloring
number. every color is compared with its previous color. The way is
a consecutive procedure;
n1 , n2 → red
n1 , n2 , n3 → blue → n1 n2 → 0.8
n1 , n2 , n3 , n4 → yellow → n1 n2 , n2 n3 → 1.3
n2 , n3 → red
n2 , n3 , n4 → pink → n2 n3 , n3 n4 → 1.3
n2 , n3 , n4 , n5 → brown → n2 n3 , n3 n4 → 1.3
n3 , n4 → red
n3 , n4 , n5 → blue → n3 n4 → 0.7
n4 , n5 → red
Qn (P T H) is 5.6.
55
2. Modified Notions

n1 , n2 → red
n1 , n2 , n3 → red
n1 , n2 , n3 , n4 → red
n1 , n2 , n3 , n4 , n5 → red
n1 , n2 , n3 , n4 , n5 , n6 → red
n2 , n3 → red
n2 , n3 , n4 → red
n2 , n3 , n4 , n5 → red
n2 , n3 , n4 , n5 , n6 → red
n3 , n4 → red
n3 , n4 , n5 → red
n4 , n5 → red
The number is 1;

(iii) Q(P T H) = 1;
n1 , n2 → red
n2 , n3 → red
n3 , n4 → red
n4 , n5 → red
Qn (P T H) is 0.

O(CY C) ≥ 3. Then
O(CY C)
Q(CY C) = b c.
3
56



two vertices, x and y, there are only two paths from x to y. If two paths from
x to y share one edge, then they’re assigned to different colors but these two
paths don’t share one edge. The set of colors, {red}, in this process is called
dominating path-coloring set from x to y. The minimum cardinality between all
dominating path-coloring sets from two given vertices, 1, is called dominating
path-coloring number and it’s denoted by Q(CY C). Thus
O(CY C)
Q(CY C) = b c.
3


57
2. Modified Notions

P1 : n1 , n2 & P2 : n1 , n6 , n5 , n4 , n3 , n2 → red
P1 : n1 , n2 , n3 & P2 : n1 , n6 , n5 , n4 , n3 → red
P1 : n1 , n2 , n3 , n4 & P2 : n1 , n6 , n5 , n4 → red
P1 : n1 , n2 , n3 , n4 , n5 & P2 : n1 , n6 , n5 → red
P1 : n1 , n2 , n3 , n4 , n5 , n6 & P2 : n1 , n6 → red
The number is 1;

(iii) Q(CY C) = 1;

Qn (CY C) is 0.

P1 : n1 , n2 & P2 : n1 , n5 , n4 , n3 , n2 → red
P1 : n1 , n2 , n3 & P2 : n1 , n5 , n4 , n3 → red
P1 : n1 , n2 , n3 , n4 & P2 : n1 n5 , n4 → red
P1 : n1 , n2 , n3 , n4 , n5 & P2 : n1 , n5 → red
The number is 1;

(iii) Q(CY C) = 1;
58



Qn (CY C) is 0.

center c. Then
Q(ST R1,σ2 ) = 1.

forever. So for given vertex, y, there’s only one path from center to y. If
two paths from center to y share one edge, then they’re assigned to different
colors but there’s only one path and indeed, there’s only one edge. The set of
59
2. Modified Notions
colors, {red}, in this process is called dominating path-coloring set from x to y.

The minimum cardinality between all dominating path-coloring sets from two
given vertices, 1, is called dominating path-coloring number and it’s denoted by
Q(ST R1,σ2 ). Thus
Q(ST R1,σ2 ) = 1.


items as follows.
P : n1 , n2 → red
P : n1 , n3 → red
P : n1 , n4 → red
P : n1 , n5 → red
The number is 1;
(iii) Q(ST R1,σ2 ) = 1;
n1 ;
no shared edge;

Qn (ST R1,σ2 ) is 0.

graph. Then
Q(CM Cσ1 ,σ2 ) = min |S|.
S
60


The set of colors in this process is called dominating path-coloring set from x
to y. The minimum cardinality between all dominating path-coloring sets from
two given vertices is called dominating path-coloring number and it’s denoted
by Q(CM Cσ1 ,σ2 ). Thus
Q(CM Cσ1 ,σ2 ) = min |S|.

S

P1 : n1 , n2 & P2 : n1 , n3 , n4 , n2 → red
P1 : n1 , n3 & P2 : n1 , n2 , n4 , n3 → red
P1 : n1 , n3 , n4 & P2 : n1 , n2 , n4 → red
P1 : n2 , n4 , n3 & P2 : n2 , n1 , n3 → red
P1 : n2 , n4 & P2 : n2 , n1 , n3 , n4 → red
P1 : n3 , n4 & P2 : n3 , n1 , n2 , n4 → red
The number is 1;
61
2. Modified Notions

(iii) Q(CM Cσ1 ,σ2 ) = 1;

Qn (CM Cσ1 ,σ2 ) is 0.

Q(CM Cσ1 ,σ2 ,··· ,σt ) = min |S|.
S

neutrosophic graph. For given two vertices, x and y, there are some paths from
x to y. If two paths from x to y share one edge, then they’re assigned to different
colors. The set of colors in this process is called dominating path-coloring set
from x to y. The minimum cardinality between all dominating path-coloring
sets from two given vertices is called dominating path-coloring number and it’s
denoted by Q(CM Cσ1 ,σ2 ,··· ,σt ). Thus
Q(CM Cσ1 ,σ2 ,··· ,σt ) = min |S|.
S
62


The number is 1;

(iii) Q(CM Cσ1 ,σ2 ,··· ,σt ) = 1;

Qn (CM Cσ1 ,σ2 ,··· ,σt ) is 0.

Then
Q(W HL1,σ2 ) = min |S|.
S

y share one edge, then they’re assigned to different colors. The set of colors in
this process is called dominating path-coloring set from x to y. The minimum
63
2. Modified Notions

cardinality between all dominating path-coloring sets from two given vertices
is called dominating path-coloring number and it’s denoted by Q(W HL1,σ2 ).
Thus
Q(W HL1,σ2 ) = min |S|.
S


& P5 : n1 , n5 , n2 → red&blue
& P5 : n1 , n4 , n3 → red&blue
& P5 : n1 , n5 , n4 → red&blue
& P5 : n1 , n4 , n5 → red&blue
64

The number is 2;
(iii) Q(W HL1,σ2 ) = 2;
paths;

& P8 : n2 , n5 , n1 , n4 & P9 : n2 , n5 , n1 , n3 , n4
65
2. Modified Notions


& P8 : n3 , n4 , n1 , n5 & P9 : n3 , n4 , n1 , n2 , n5
Qn (W HL1,σ2 ) is 1.6.
2.6 Setting of neutrosophic dominating path-coloring

number
In this section, I provide some results in the setting of neutrosophic
dominating path-coloring number. Some classes of neutrosophic graphs
are chosen. Complete-neutrosophic graph, path-neutrosophic graph, cycle-
neutrosophic graph, star-neutrosophic graph, bipartite-neutrosophic graph,
t-partite-neutrosophic graph, and wheel-neutrosophic graph, are both of cases
of study and classes which the results are about them.
66
2.6. Setting of neutrosophic dominating path-coloring number

Then
3
XX
Qn (CM T σ ) = min µi (e).
S
e∈S i=1

is O(CM T σ ). For given two vertices, x and y, there are some paths from x to y.
If two paths from x to y share one edge, then they’re assigned to different colors.
The set S of shared edges in this process is called dominating
P P3 path-coloring set
all dominating path-coloring sets, Ss, is called neutrosophic dominating path-
coloring number and it’s denoted by Qn (CM T σ ).Thus
3
XX
Qn (CM T σ ) = min µi (e).
S
e∈S i=1

P1 : n1 , n2 → red
P2 : n1 , n3 , n2 → red
P3 : n1 , n4 , n2 → red
P4 : n1 , n3 , n4 , n2 → blue
P5 : n1 , n4 , n3 , n2 → yellow

67
2. Modified Notions


number and it’s denoted by Q(CM T σ ) = 3;
same;
P3 set from x
path-coloring number and it’s denoted by Qn (CM T σ ) = 1.5.
graph.
3
XX
Qn (P T H) = min µi (e).
O(P T H)
S, |S|=d 3 e e∈S i=1
68

x and y, there’s only one path from x to y. If two paths from x to y share
one edge, then they’re assigned to different colors but there’s only one path
with certain start and end. The set S of shared edges in this process is
called dominating path-coloring set from x to y. The minimum neutrosophic
P P 3
cardinality, e∈S i=1 µi (e), between all dominating path-coloring sets, Ss,
is called neutrosophic dominating path-coloring number and it’s denoted by
Qn (P T H). Thus
3
XX
Qn (P T H) = min µi (e).
O(P T H)
S, |S|=d 3 e e∈S i=1

n1 , n2 → red
n1 , n2 , n3 → blue
n1 , n2 , n3 , n4 → yellow
n1 , n2 , n3 , n4 , n5 → green
n2 , n3 → red
n2 , n3 , n4 → pink
n2 , n3 , n4 , n5 → brown
n3 , n4 → red
n3 , n4 , n5 → blue
n4 , n5 → red
The number is 6;

(iii) Q(P T H) = 6;
summation of 5 numbers is neutrosophic dominating path-coloring
number. every color is compared with its previous color. The way is
a consecutive procedure;
69
2. Modified Notions
n1 , n2 → red
n1 , n2 , n3 → blue → n1 n2 → 0.8
n1 , n2 , n3 , n4 → yellow → n1 n2 , n2 n3 → 1.3
n2 , n3 → red
n2 , n3 , n4 → pink → n2 n3 , n3 n4 → 1.3
n2 , n3 , n4 , n5 → brown → n2 n3 , n3 n4 → 1.3
n3 , n4 → red
n3 , n4 , n5 → blue → n3 n4 → 0.7
n4 , n5 → red
Qn (P T H) is 5.6.

n1 , n2 → red
n1 , n2 , n3 → red
n1 , n2 , n3 , n4 → red
n1 , n2 , n3 , n4 , n5 → red
n1 , n2 , n3 , n4 , n5 , n6 → red
n2 , n3 → red
n2 , n3 , n4 → red
n2 , n3 , n4 , n5 → red
n2 , n3 , n4 , n5 , n6 → red
n3 , n4 → red
n3 , n4 , n5 → red
n4 , n5 → red
The number is 1;

(iii) Q(P T H) = 1;
n1 , n2 → red
70



n2 , n3 → red
n3 , n4 → red
n4 , n5 → red
Qn (P T H) is 0.

O(CY C) ≥ 3. Then
3
XX
Qn (CY C) = min µi (e).
O(CY C)
S, |S|=d 3 e e∈S i=1

two vertices, x and y, there are only two paths from x to y. If two paths
71
2. Modified Notions
from x to y share one edge, then they’re assigned to different colors but these
two paths don’t share one edge. The set S of shared edges in this process is
called dominating path-coloring set from x to y. The minimum neutrosophic
P P 3
cardinality, e∈S i=1 µi (e), between all dominating path-coloring sets, Ss, is
called neutrosophic dominating path-coloring number and it’s denoted by
3
XX
Qn (CY C) = min µi (e).
O(CY C)
S, |S|=d 3 e e∈S i=1

P1 : n1 , n2 & P2 : n1 , n6 , n5 , n4 , n3 , n2 → red
P1 : n1 , n2 , n3 & P2 : n1 , n6 , n5 , n4 , n3 → red
P1 : n1 , n2 , n3 , n4 & P2 : n1 , n6 , n5 , n4 → red
P1 : n1 , n2 , n3 , n4 , n5 & P2 : n1 , n6 , n5 → red
P1 : n1 , n2 , n3 , n4 , n5 , n6 & P2 : n1 , n6 → red
The number is 1;

(iii) Q(CY C) = 1;

Qn (CY C) is 0.

72

P1 : n1 , n2 & P2 : n1 , n5 , n4 , n3 , n2 → red
P1 : n1 , n2 , n3 & P2 : n1 , n5 , n4 , n3 → red
P1 : n1 , n2 , n3 , n4 & P2 : n1 n5 , n4 → red
P1 : n1 , n2 , n3 , n4 , n5 & P2 : n1 , n5 → red
The number is 1;

(iii) Q(CY C) = 1;

Qn (CY C) is 0.

center c. Then
X3
Qn (ST R1,σ2 ) = min µi (e).
e∈S
i=1

73
2. Modified Notions

but there’s only one path and indeed, there’s only one edge. The set S of shared
edges in this process is called dominating path-coloring set from x to y. The
P P 3
and it’s denoted by Qn (ST R1,σ2 ). Thus
3
X
Qn (ST R1,σ2 ) = min µi (e).
e∈S
i=1

items as follows.
P : n1 , n2 → red
P : n1 , n3 → red
P : n1 , n4 → red
P : n1 , n5 → red
The number is 1;

(iii) Q(ST R1,σ2 ) = 1;
n1 ;
74

no shared edge;

Qn (ST R1,σ2 ) is 0.

graph. Then
XX 3
Qn (CM Cσ1 ,σ2 ) = min µi (e).
S
e∈S i=1

The set S of shared edges in this process is called dominating
P P3 path-coloring set
all dominating path-coloring sets, Ss, is called neutrosophic dominating path-
coloring number and it’s denoted by Qn (CM Cσ1 ,σ2 ). Thus
3
XX
Qn (CM Cσ1 ,σ2 ) = min µi (e).
S
e∈S i=1

75
2. Modified Notions

P1 : n1 , n2 & P2 : n1 , n3 , n4 , n2 → red
P1 : n1 , n3 & P2 : n1 , n2 , n4 , n3 → red
P1 : n1 , n3 , n4 & P2 : n1 , n2 , n4 → red
P1 : n2 , n4 , n3 & P2 : n2 , n1 , n3 → red
P1 : n2 , n4 & P2 : n2 , n1 , n3 , n4 → red
P1 : n3 , n4 & P2 : n3 , n1 , n2 , n4 → red
The number is 1;
(iii) Q(CM Cσ1 ,σ2 ) = 1;

Qn (CM Cσ1 ,σ2 ) is 0.

3
XX
Qn (CM Cσ1 ,σ2 ,··· ,σt ) = min µi (e).
S
e∈S i=1

from x to y. If two paths from x to y share one edge, then they’re as-
signed to different colors. The set S of shared edges in this process is called
dominating
P path-coloring
P3 set from x to y. The minimum neutrosophic car-
dinality, e∈S i=1 µi (e), between all dominating path-coloring sets, Ss, is
76

called neutrosophic dominating path-coloring number and it’s denoted by

Qn (CM Cσ1 ,σ2 ,··· ,σt ). Thus
3
XX
Qn (CM Cσ1 ,σ2 ,··· ,σt ) = min µi (e).
S
e∈S i=1


The number is 1;
(iii) Q(CM Cσ1 ,σ2 ,··· ,σt ) = 1;
77
2. Modified Notions


Qn (CM Cσ1 ,σ2 ,··· ,σt ) is 0.

Then
XX 3
Qn (W HL1,σ2 ) = min µi (e).
S
e∈S i=1

y share one edge, then they’re assigned to different colors. The set S of shared
edges in this process is called dominating path-coloring set from x to y. The
P P 3
and it’s denoted by Qn (W HL1,σ2 ). Thus
3
XX
Qn (W HL1,σ2 ) = min µi (e).
S
e∈S i=1
78


& P5 : n1 , n5 , n2 → red&blue
& P5 : n1 , n4 , n3 → red&blue
& P5 : n1 , n5 , n4 → red&blue
& P5 : n1 , n4 , n5 → red&blue
The number is 2;
79
2. Modified Notions
(iii) Q(W HL1,σ2 ) = 2;
paths;

& P8 : n2 , n5 , n1 , n4 & P9 : n2 , n5 , n1 , n3 , n4
& P8 : n3 , n4 , n1 , n5 & P9 : n3 , n4 , n1 , n2 , n5
Qn (W HL1,σ2 ) is 1.6.
80


81
2. Modified Notions
Values (0.7, 0.9, 0.3) (0.4, 0.2, 0.8)· · · (0.4, 0.2, 0.8)
Values (0.4, 0.2, 0.3) (0.5, 0.2, 0.3)· · · (0.3, 0.2, 0.3)

coloring number and its neutrosophic dominating path-coloring number 77NTG20

dominating path-coloring number and its neutrosophic
dominating path-coloring number
Step 4. (Solution) The neutrosophic graph alongside its dominating path-

coloring number and its neutrosophic dominating path-coloring number
as model, propose to use specific number. Every subject has connection
with some subjects. Thus the connection is applied as possible and the
model demonstrates quasi-full connections as quasi-possible. Using the
subjects, is determined by those subjects. If the configuration is star, the
number is different. Also, it holds for other types such that complete,
wheel, path, and cycle. The collection of situations is another application
of its dominating path-coloring number and its neutrosophic dominating
path-coloring number when the notion of family is applied in the way
that all members of family are from same classes of neutrosophic graphs.
As follows, There are five subjects which are represented as Figure (2.20).
This model is strong and even more it’s quasi-complete. And the study
proposes using specific number which is called its dominating path-coloring
number and its neutrosophic dominating path-coloring number. There are
also some analyses on other numbers in the way that, the clarification is
gained about being special number or not. Also, in the last part, there is
82
Viewpoint of its dominating path-coloring number and its neutrosophic
dominating path-coloring number
one neutrosophic number to assign to this model and situation to compare

The number is 1;

(iii) Q(CM Cσ1 ,σ2 ,··· ,σt ) = 1;

Qn (CM Cσ1 ,σ2 ,··· ,σt ) is 0.

Neutrosophic Graph in the Viewpoint of its dominating
path-coloring number and its neutrosophic dominating
Step 4. (Solution) The neutrosophic graph alongside its dominating path-

as model, propose to use specific number. Every subject has connection
with every given subject in deemed way. Thus the connection applied as
possible and the model demonstrates full connections as possible between
parts but with different view where symmetry amid vertices and edges are
the matters. Using the notion of strong on the connection amid subjects,
causes the importance of subject goes in the highest level such that the
value amid two consecutive subjects, is determined by those subjects. If
the configuration is complete multipartite, the number is different. Also, it
83
2. Modified Notions

coloring number and its neutrosophic dominating path-coloring number 77NTG21
holds for other types such that star, wheel, path, and cycle. The collection
of situations is another application of its dominating path-coloring number
and its neutrosophic dominating path-coloring number when the notion
of family is applied in the way that all members of family are from same
classes of neutrosophic graphs. As follows, There are four subjects which
are represented in the formation of one model as Figure (2.21). This model
is neutrosophic strong as individual and even more it’s complete. And the
study proposes using specific number which is called its dominating path-
P1 : n1 , n2 → red
P2 : n1 , n3 , n2 → red
P3 : n1 , n4 , n2 → red
P4 : n1 , n3 , n4 , n2 → blue
P5 : n1 , n4 , n3 , n2 → yellow

the same as red. The path P4 has shared edge n1 n3 with P2 and
shared edge n4 n2 with P3 thus it’s been colored the different color
as blue in comparison to them. The path P5 has shared edge n1 n4
with P3 and shared edge n3 n4 with P4 thus it’s been colored the
different color as yellow in comparison to different paths in the terms
of different colors. Thus S = {red, blue, yellow} is dominating path-
coloring set and its cardinality, 3, is dominating path-coloring number.
To sum them up, for given two vertices, x and y, there are some paths
from x to y. If two paths from x to y share one edge, then they’re
assigned to different colors. The set of colors, S = {red, blue, yellow},
in this process is called dominating path-coloring set from x to y.
84
2.10. Open Problems
The minimum cardinality between all dominating path-coloring sets

from two given vertices, 3, is called dominating path-coloring number
and it’s denoted by Q(CM T σ ) = 3;
are the same;
(iv) shared edges form a set of representatives of colors. Each color
is corresponded to an edge which has minimum neutrosophic
cardinality;
cardinality. Minimum neutrosophic cardinality is obtained in this
way but other way is to use all shared edges to form S and after that
(vi) two edges n1 n3 and n4 n2 are shared with P4 by P3 and P2 .
The minimum neutrosophic cardinality is 0.6 corresponded to
n4 n2 . Other corresponded color has only one shared edge n3 n4
and minimum neutrosophic cardinality is 0.9. Thus minimum
neutrosophic cardinality is 1.5. And corresponded set is S =
{n4 n2 , n3 n4 }. To sum them up, for given two vertices, x and
y, there are some paths from x to y. If two paths from x to y
share one edge, then they’re assigned to different colors. The set
S = {n4 n2 , n3 n4 } of shared edges in this process is called dominating
path-coloring
P P3 set from x to y. The minimum neutrosophic cardinality,
e∈S i=1 µi (e), between all dominating path-coloring sets, Ss,
is called neutrosophic dominating path-coloring number and it’s
denoted by Qn (CM T σ ) = 1.5.
2.10 Open Problems

Notion concerning its dominating path-coloring number and its neutrosophic
dominating path-coloring number are defined in neutrosophic graphs. Thus,
Question 2.10.1. Is it possible to use other types of its dominating path-coloring
number and its neutrosophic dominating path-coloring number?
Question 2.10.2. Are existed some connections amid different types of its
dominating path-coloring number and its neutrosophic dominating path-coloring
number in neutrosophic graphs?
85
2. Modified Notions

independent study?

This study uses two definitions concerning dominating path-coloring number
and neutrosophic dominating path-coloring number arising from different types
of paths based on shared edges amid them in neutrosophic graphs assigned to
neutrosophic graphs. Consider two vertices. Minimum number of shared edges
based on those vertices in the formations of all paths with those vertices as
their starts and their ends to compare with other paths, is a number which
is representative based on those vertices. Minimum neutrosophic number of
neutrosophic dominating path-coloring number. The connections of paths which
aren’t clarified by a common edge differ them from each other and put them
in different categories to represent a number which is called dominating path-
1. dominating path-coloring number of Model 1. Connections amid Classes
2. neutrosophic dominating path-coloring number of Model
3. Minimal dominating path-coloring sets 2. Study on Families
coloring number and neutrosophic dominating path-coloring number arising

from different types of paths based on shared edges amid them in neutrosophic
graphs assigned to neutrosophic graphs. Further studies could be about changes
in the settings to compare these notions amid different settings of neutrosophic
graphs theory. One way is finding some relations amid all definitions of notions
to make sensible definitions. In Table (2.2), some limitations and advantages of
this study are pointed out.
86
Bibliography

Ref3 [3] S. Bonvicini, and M. C. Molinari, “Even Cycle Decompositions of index 3

by a novel coloring technique”, Discrete Applied Mathematics 317 (2022)
49-62.

Theory 10 (2016) 86-101.
Ref5 [5] Q. Cui, and Zh. Han„ “List star edge-coloring of claw-free subcubic
multigraphs”, Discrete Applied Mathematics 309 (2022) 258-264.
Ref6 [6] S. Das et al., “On fractional version of oriented coloring”, Discrete Applied
Mathematics 316 (2022) 33-42.

prints202112.0448.v1).

tems 49 (2022) 531-561 (doi: 10.5281/zenodo.6456413).
10.20944/preprints202201.0239.v1).
Ref11 [11] W. Goddard, and M. A. Henning, “Domination and dominator colorings

in planar graphs with small diameter”, Discrete Applied Mathematics 313
(2022) 80-92.
87
Bibliography
Ref12 [12] J. Grytczuk et al., “Graph polynomials and paintability of plane graphs”,
Discrete Applied Mathematics 313 (2022) 71-79.
Ref13 [13] F. Jacques, and A. Pinlou„ “The chromatic number of signed graphs with
bounded maximum average degree”, Discrete Applied Mathematics 316
(2022) 43-59.
Ref14 [14] J. Lv et al., “Upper bound for DP-chromatic number of a graph”, Discrete
Applied Mathematics 316 (2022) 28-32.
Ref15 [15] B. Martin et al., “Colouring graphs of bounded diameter in the absence
of small cycles”, Discrete Applied Mathematics 314 (2022) 150-161.
Ref16 [16] Zh. Miao et al., “Note on injective edge-coloring of graphs”, Discrete
Applied Mathematics 310 (2022) 65-74.
and Systems 11 (2016) 31-44.
Sofia (1994) 59-61.
Ref21 [21] W. Wei et al., “On r-hued list coloring of K4(7)-minor free graphs”,
Discrete Applied Mathematics 309 (2022) 301-309.
88
CHAPTER 3
Extended Notions
[Ref3] Henry Garrett, “Neutrosophic Path-Coloring Numbers Based
On Endpoints In Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.27990.11845).
Neutrosophic Path-Coloring Numbers Based On Endpoints In

Neutrosophic Graphs
3.1 Abstract
New setting is introduced to study path-coloring number and neutrosophic
endpoints amid them in neutrosophic graphs assigned to neutrosophic graphs.
Consider two vertices. Minimum number of shared endpoints based on those
vertices in the formations of all paths with those vertices as their starts and
their ends to compare with other paths, is a number which is representative
based on those vertices. Minimum neutrosophic number of latter endpoints
corresponded to path-coloring set amid neutrosophic cardinality of all sets of
latter endpoints corresponded to path-coloring set is called neutrosophic path-
coloring number. Forming sets from special paths to figure out different types of
number of paths having smallest number of colors from shared endpoints from
two vertices are given in the terms of minimum number of paths to get minimum
number to assign to neutrosophic graphs is key type of approach to have these
notions namely path-coloring number and neutrosophic path-coloring number
arising from different types of paths based on shared endpoints amid them in
neutrosophic graphs assigned to neutrosophic graphs. Two numbers and one set
are assigned to a neutrosophic graph, are obtained but now both settings lead
to approach is on demand which is to compute and to find representatives of
paths having smallest number of colors from shared endpoints from two vertices
are given forming different types of sets of paths in the terms of minimum
number and minimum neutrosophic number forming it to get minimum number
to assign to a neutrosophic graph. Let N T G : (V, E, σ, µ) be a neutrosophic
graph. Then for given two vertices, x and y, there are some paths from x to y.
If two paths from x to y share an endpoint, then they’re assigned to different
colors. The set of different colors, S, in this process is called path-coloring set
from x to y. The minimum cardinality between all path-coloring sets from two
89
3. Extended Notions
given vertices is called path-coloring number and it’s denoted by V(N T G); for
given two vertices, x and y, there are some paths from x to y. If two paths
set S of different colors in this process isPcalledPpath-coloring set from x to y.
3
neutrosophic path-coloring number and it’s denoted by Vn (N T G). As concluding
complete-bipartite-neutrosophic graphs, complete-t-partite-neutrosophic graphs,
sections “Setting of path-coloring number,” and “Setting of neutrosophic path-
coloring number,” for introduced results and used classes. This approach
facilitates identifying paths which form path-coloring number and neutrosophic
endpoints amid them in neutrosophic graphs assigned to neutrosophic graphs. In
both settings, some classes of well-known neutrosophic graphs are studied. Some
clarifications for each result and each definition are provided. The cardinality
of set of shared endpoints and neutrosophic cardinality of latter endpoints
corresponded to path-coloring set have eligibility to define path-coloring number
and neutrosophic path-coloring number but different types of shared endpoints
have eligibility to define path-coloring sets. Some results get more frameworks
and perspective about these definitions. The way in that, different types of
shared endpoints having smallest number from all paths from two vertices are
given forming different types of sets in the terms of minimum number of shared
endpoints having smallest number of different paths from two vertices are given
and smallest number of shared endpoints having smallest number of paths
from two vertices are given forming it to get minimum number to assign to
neutrosophic graphs or in other words, the way in that, consider two vertices,
minimum number of shared endpoints based on those vertices in the formations
of all paths with those vertices as their starts and their ends to compare
with other paths, is a number which is representative based on those vertices;
minimum neutrosophic number of latter endpoints corresponded to path-coloring
set amid neutrosophic cardinality of all sets of latter endpoints corresponded to
path-coloring set is called neutrosophic path-coloring number, opens the way
to do some approaches. These notions are applied into neutrosophic graphs
this study. Neutrosophic path-coloring notion is applied to different settings
and classes of neutrosophic graphs. Some problems are proposed to pursue this
study. Basic familiarities with graph theory and neutrosophic graph theory are
proposed for this article.
Keywords: Path-Coloring Number, Neutrosophic Path-Coloring Number,
Classes of Neutrosophic Graphs

90
3.2. Background
3.2 Background
Fuzzy set in Ref. [Ref22] by Zadeh (1965), intuitionistic fuzzy sets in Ref.
[Ref3] by Atanassov (1986), a first step to a theory of the intuitionistic fuzzy
graphs in Ref. [Ref18] by Shannon and Atanassov (1994), a unifying field
in logics neutrosophy: neutrosophic probability, set and logic, rehoboth in
Ref. [Ref19] by Smarandache (1998), single-valued neutrosophic sets in Ref.
[Ref20] by Wang et al. (2010), single-valued neutrosophic graphs in Ref.
[Ref5] by Broumi et al. (2016), operations on single-valued neutrosophic
graphs in Ref. [Ref1] by Akram and Shahzadi (2017), neutrosophic soft graphs
in Ref. [Ref17] by Shah and Hussain (2016), bounds on the average and
minimum attendance in preference-based activity scheduling in Ref. [Ref2]
by Aronshtam and Ilani (2022), investigating the recoverable robust single
machine scheduling problem under interval uncertainty in Ref. [Ref4] by
Bold and Goerigk (2022), new bounds for the b-chromatic number of vertex
deleted graphs in Ref. [Ref6] by Del-Vecchio and Kouider (2022), bipartite
completion of colored graphs avoiding chordless cycles of given lengths in Ref.
[Ref7] by Elaine et al., infinite chromatic games in Ref. [Ref12] by Janczewski
et al. (2022), edge-disjoint rainbow triangles in edge-colored graphs in Ref.
[Ref13] by Li and Li (2022), rainbow triangles in arc-colored digraphs in
Ref. [Ref14] by Li et al. (2022), a sufficient condition for edge 6-colorable
planar graphs with maximum degree 6 in Ref. [Ref15] by Lu and Shi (2022),
some comparative results concerning the Grundy and b-chromatic number of
graphs in Ref. [Ref16] by Masih and Zaker (2022), color neighborhood union
conditions for proper edge-pancyclicity of edge-colored complete graphs in Ref.
[Ref21] by Wu et al. (2022), dimension and coloring alongside domination
in neutrosophic hypergraphs in Ref. [Ref9] by Henry Garrett (2022), three
types of neutrosophic alliances based on connectedness and (strong) edges in
Ref. [Ref11] by Henry Garrett (2022), properties of SuperHyperGraph and
neutrosophic SuperHyperGraph in Ref. [Ref10] by Henry Garrett (2022), are
studied. Also, some studies and researches about neutrosophic graphs, are
proposed as a book in Ref. [Ref8] by Henry Garrett (2022).

Question 3.3.1. Is it possible to use mixed versions of ideas concerning “path-
coloring number”, “neutrosophic path-coloring number” and “Neutrosophic
Graph” to define some notions which are applied to neutrosophic graphs?
have key roles to assign path-coloring number and neutrosophic path-coloring
number arising from different types of paths based on shared endpoints amid
them in neutrosophic graphs assigned to neutrosophic graphs. Thus they’re
used to define new ideas which conclude to the structure of path-coloring
91
3. Extended Notions

paths based on shared endpoints amid them in neutrosophic graphs assigned
to neutrosophic graphs. The concept of having smallest number of paths with
shared endpoints from two vertices are given inspires us to study the behavior
of all paths in the way that, some types of numbers, path-coloring number and
on shared endpoints amid them in neutrosophic graphs assigned to neutrosophic
graphs, are the cases of study in the setting of individuals. In both settings,
corresponded numbers conclude the discussion. Also, there are some avenues to
extend these notions.
The framework of this study is as follows. In the beginning, I introduce
basic definitions to clarify about preliminaries. In subsection “Preliminaries”,
new notions of path-coloring number and neutrosophic path-coloring number
arising from different types of paths based on shared endpoints amid them
in neutrosophic graphs assigned to neutrosophic graphs, are highlighted, are
introduced and are clarified as individuals. In section “Preliminaries”, different
types of paths and minimum numbers of shared endpoints amid them from two
vertices aren’t necessarily neighbors forming different types of sets in the terms
of minimum numbers and minimal sets forming it to get minimum number to
assign to neutrosophic graphs, have the key role in this way. General results
are obtained and also, the results about the basic notions of path-coloring
paths based on shared endpoints amid them in neutrosophic graphs assigned
to neutrosophic graphs, are elicited. Some classes of neutrosophic graphs are
studied in the terms of path-coloring number and neutrosophic path-coloring
them in neutrosophic graphs assigned to neutrosophic graphs, in section “Setting
of path-coloring number,” as individuals. In section “Setting of path-coloring
number,” path-coloring number is applied into individuals. As concluding
complete-bipartite-neutrosophic graphs, complete-t-partite-neutrosophic graphs,
sections “Setting of path-coloring number,” and “Setting of neutrosophic
path-coloring number,” for introduced results and used classes. In section
“Applications in Time Table and Scheduling”, two applications are posed for
quasi-complete and complete notions, namely complete-neutrosophic graphs and
complete-t-partite-neutrosophic graphs concerning time table and scheduling
when the suspicions are about choosing some subjects and the mentioned models
are considered as individual. In section “Open Problems”, some problems and
92
3.4. Preliminaries
3.4 Preliminaries
model.
µ(vi vj ) ≤ σ(vi ) ∧ σ(vj ).
P
On (N T G).
(v) : |E| is called size of NTG and it’s denoted by V(N T G).
P P3
by Sn (N T G).
about them.
V

_ ^
µ∞ (x0 , xt ) = µ(xi xi+1 );
P :x0 ,x1 ,··· ,xt i=0,··· ,t−1

and
i=0,1,··· ,n−1 µ(vi vi+1 );
93
3. Extended Notions
s
µ(vi vj ) ≤ σ(vi ) ∧ σ(vj ).
s
On (N T G);
W HL1,σ2 .
Definition 3.4.7. (path-coloring numbers).
94
3.4. Preliminaries
(i) for given two vertices, x and y, there are some paths from x to y. If two
paths from x to y share an endpoint, then they’re assigned to different
colors. The set of different colors, S, in this process is called path-
coloring set from x to y. The minimum cardinality between all path-
coloring sets from two given vertices is called path-coloring number
and it’s denoted by V(N T G);
(ii) for given two vertices, x and y, there are some paths from x to y. If two
P path-coloring
colors. The set S of different colors in this process is called P3
set from x to y. The minimum neutrosophic cardinality, x∈Z i=1 σi (x),
between all sets Zs including the latter endpoints corresponded to path-
coloring set Ss, is called neutrosophic path-coloring number and it’s
denoted by Vn (N T G).
matters of mind.
P1 : n1 , n2 → red
P2 : n1 , n3 , n2 → blue
P3 : n1 , n4 , n2 → yellow
P4 : n1 , n3 , n4 , n2 → white
P5 : n1 , n4 , n3 , n2 → black
Thus ∪3i=1 Si = {redi , bluei , yellowi , whitei , blacki }, is path-coloring set

from x to y share an endpoint, then they’re assigned to different colors.
The set of different colors, ∪3i=1 Si = {redi , bluei , yellowi , whitei , blacki },
in this process is called path-coloring set from x to y. The minimum
cardinality, 15, between all path-coloring sets from two given vertices is
called path-coloring number and it’s denoted by V(N T G) = 15;
same;
(iii) there are some different paths which have no shared endpoints. So they
could been assigned to same color;
(iv) shared endpoints form a set of representatives of colors. Each color is
corresponded to a vertex which has minimum neutrosophic cardinality;
95
3. Extended Notions

(v) every color in S is corresponded to a vertex has minimum neutrosophic

cardinality. Minimum neutrosophic cardinality is obtained in this way
but other way is to use all shared endpoints to form S and after that
(vi) for given two vertices, x and y, there are some paths from x to
y. If two paths from x to y share an endpoint, then they’re as-
signed to different colors. The set of different colors, ∪3i=1 Si =
{redi , bluei , yellowi , whitei , blacki }, in this process is called path-
coloring
P P3set from x to y. The P minimum neutrosophic cardinality,
3
x∈S i=1 σ i (x) = On (N T G) − i=1 σi (n2 ) = 3.9, between all path-
coloring sets, Ss, is called neutrosophic path-coloring number and it’s
denoted by
3
X
Vn (CM T ) = On (CM T ) − σi (n2 ) = 3.9.
i=1
3.5 Setting of path-coloring number

In this section, I provide some results in the setting of path-coloring number.
Some classes of neutrosophic graphs are chosen. Complete-neutrosophic
about them.
Then
V(CM T σ ) = (O(CM T σ ) − 1)!.

CM T σ : (V, E, σ, µ) is a complete-neutrosophic graph, all vertices are
connected to each other. So there’s one edge between two vertices. If
P : vi , vs , vs+1 , · · · , vs+z , vj is a path from vi to vj , then all permutations
96
of internal vertices, it means all vertices on the path excluding vi and vj , is a

path from vi to vj , too. Furthermore, all permutations of vertices make a new
path. The number of vertices is O(CM T σ ). For given two vertices, x and y,
there are some paths from x to y. If two paths from x to y share an endpoint,
then they’re assigned to different colors. The set of different colors, S, in this
process is called path-coloring set from x to y. The minimum cardinality, |S|,
number and it’s denoted by
V(CM T σ ) = (O(CM T σ ) − 1)!.

P1 : n1 , n2 → red
P2 : n1 , n3 , n2 → blue
P3 : n1 , n4 , n2 → yellow
P4 : n1 , n3 , n4 , n2 → white
P5 : n1 , n4 , n3 , n2 → black

called path-coloring number and it’s denoted by V(CM T σ ) = 15;
same;

97
3. Extended Notions


coloring
P P3set from x to y. The minimum P3 neutrosophic cardinality,
x∈S i=1 σ i (x) = O n (CM T σ ) − i=1 σ i (n 2 ) = 3.9, between all
it’s denoted by
3
X
Vn (CM T σ ) = On (CM T σ ) − σi (n2 ) = 3.9.
i=1

graph.
V(P T H) = O(P T H) − 1.
x1 , x2 , · · · , xO(P T H) be a path-neutrosophic graph. For given two vertices, x and
y, there’s one path from x to y. If two paths from x to y share one endpoint, then
they’re assigned to different colors but there are only O(P T H)−1 paths for every
given vertex. In the terms of number of paths, all vertices behave the same and
they’ve same positions. The set of colors is S = {red1 , red2 , · · · , redO(P T H)−1 },
in this process. For given two vertices, x and y, there are some paths from
x to y. If two paths from x to y share an endpoint, then they’re assigned to
different colors. The set of different colors, S = {red1 , red2 , · · · , redO(P T H)−1 },
in this process is called path-coloring set from x to y. The minimum cardinality,
|S| = |{red1 , red2 , · · · , redO(P T H)−1 }| = O(P T H)−1, between all path-coloring
V(P T H). Thus
V(P T H) = O(P T H) − 1.
98

(i) Consider the vertex n1 . All paths with endpoint n1 are as follow:
P1 : n1 , n2 → red
P2 : n1 , n2 , n3 → blue
P3 : n1 , n2 , n3 , n4 → yellow
P4 : n1 , n2 , n3 , n4 , n5 → white
Thus S = {red, blue, yellow, white}, is path-coloring set and its

cardinality, 4, is path-coloring number. To sum them up, for given
two vertices, x and y, there are some paths from x to y. If two paths
from x to y share an endpoint, then they’re assigned to different
colors. The set of different colors, S = {red, blue, yellow, white}, in
this process is called path-coloring set from x to y. The minimum
cardinality, 4, between all path-coloring sets from two given vertices
is called path-coloring number and it’s denoted by V(P T H) = 4;
are the same;
(iii) there are some different paths which have no shared endpoints. So
they could been assigned to same color;
(iv) shared endpoints form a set of representatives of colors. Each
color is corresponded to a vertex which has minimum neutrosophic
cardinality;
(v) every color in S is corresponded to a vertex has minimum neutro-
sophic cardinality. Minimum neutrosophic cardinality is obtained in
this way but other way is to use all shared endpoints to form S and
after that minimum neutrosophic cardinality is optimal;
(vi) for given two vertices, x and y, there are some paths from x to y. If two
colors. The set of different colors, S = {red, blue, yellow, white},
in this process is called path-coloring Pset from x to y. The
P 3
minimum neutrosophic cardinality, x∈S i=1 σi (x) = On (P T H)−
P3
i=1 σi (n2 ) = 4.5, between all path-coloring sets, Ss, is called
neutrosophic path-coloring number and it’s denoted by
3
X
Vn (P T H) = On (P T H) − σi (n2 ) = 4.5.
i=1

99
3. Extended Notions
P1 : n1 , n2 → red
P2 : n1 , n2 , n3 → blue
P3 : n1 , n2 , n3 , n4 → yellow
P4 : n1 , n2 , n3 , n4 , n5 → white
P5 : n1 , n2 , n3 , n4 , n5 , n6 → black
Thus S = {red, blue, yellow, white, black}, is path-coloring set and

its cardinality, 5, is path-coloring number. To sum them up, for given
The set of different colors, S = {red, blue, yellow, white, black}, in
are the same;
cardinality;
P 3
P3
3
X
Vn (P T H) = On (P T H) − σi (n5 ) = 7.4.
i=1

O(CY C) ≥ 3. Then
V(CY C) = 2 × (O(CY C) − 1).

vertices, x and y, there are only two paths with distinct edges from x to y. If
two paths from x to y share one endpoint, then they’re assigned to different
100


colors but there are only 2 × (O(CY C) − 1) paths for every given vertex. In
the terms of number of paths, all vertices behave the same and they’ve same
positions. The set of colors is
S = {red1 , red2 , · · · , red2×(O(CY C)−1) },
in this process. For given two vertices, x and y, there are some paths from x to
y. If two paths from x to y share an endpoint, then they’re assigned to different
colors. The set of different colors, S = {red1 , red2 , · · · , red2×(O(CY C)−1) }, in
this process is called path-coloring set from x to y. The minimum cardinality,
|S| = |{red1 , red2 , · · · , red2×(O(CY C)−1) }| = 2 × (O(CY C) − 1),
number and it’s denoted by V(CY C). Thus
V(CY C) = 2 × (O(CY C) − 1).
101
3. Extended Notions


P1 : n1 , n2 → red
P2 : n1 , n2 , n3 → blue
P3 : n1 , n2 , n3 , n4 → yellow
P4 : n1 , n2 , n3 , n4 , n5 → white
P5 : n1 , n2 , n3 , n4 , n5 , n6 → black
P6 : n1 , n6 , n5 , n4 , n3 , n2 → pink
P7 : n1 , n6 , n5 , n4 , n3 → purple
P8 : n1 , n6 , n5 , n4 → brown
P9 : n1 , n6 , n5 → orange
P10 : n1 , n6 → green
Thus S = {red, blue, yellow, white, black, pink, purple, brown, orange, green},
is path-coloring set and its cardinality, 10, is path-coloring number.
To sum them up, for given two vertices, x and y, there are some
paths from x to y. If two paths from x to y share an endpoint, then
they’re assigned to different colors. The set of different colors,
S = {red, blue, yellow, white, black, pink, purple, brown, orange, green},

is called path-coloring number and it’s denoted by V(CY C) = 10;
are the same;
cardinality;
102
(vi) for given two vertices, x and y, there are some paths from x to y. If
two paths from x to y share an endpoint, then they’re assigned to
different colors. The set of different colors,

neutrosophic cardinality,
3
XX 3
X
σi (x) = On (CY C) − σi (n2 ) = 6,
x∈S i=1 i=1

3
X
Vn (CY C) = On (CY C) − σi (n2 ) = 6.
i=1

P1 : n1 , n2 → red
P2 : n1 , n2 , n3 → blue
P3 : n1 , n2 , n3 , n4 → yellow
P4 : n1 , n2 , n3 , n4 , n5 → white
P5 :: n1 , n5 , n4 , n3 , n2 → black
P6 : n1 , n5 , n4 , n3 → pink
P7 : n1 , n5 , n4 → purple
P8 : n1 , n5 → brown
Thus S = {red, blue, yellow, white, black, pink, purple, brown} is

path-coloring set and its cardinality, 8, is path-coloring number.
S = {red, blue, yellow, white, black, pink, purple, brown},

are the same;
103
3. Extended Notions


cardinality;

3
XX 3
X
σi (x) = On (CY C) − σi (n3 ) = 6.2,
x∈S i=1 i=1

3
X
Vn (CY C) = On (CY C) − σi (n3 ) = 6.2.
i=1

center c. Then
V(ST R1,σ2 ) = O(ST R1,σ2 ) − 1.

forever. For given two vertices, x and y, there’s only one path with distinct
edges from x to y. If two paths from x to y share one endpoint, then they’re
104

assigned to different colors but there are only O(ST R1,σ2 ) − 1 paths for center.
In the terms of number of paths, all vertices don’t behave the same and they
don’t have same positions. The set of colors is
S = {red1 , red2 , · · · , redO(ST R1,σ2 )−1 },
colors. The set of different colors, S = {red1 , red2 , · · · , redO(ST R1,σ2 −1 }, in this
process is called path-coloring set from x to y. The minimum cardinality,
|S| = |{red1 , red2 , · · · , redO(ST R1,σ2 )−1 }| = O(ST R1,σ2 ) − 1,
number and it’s denoted by V(ST R1,σ2 ). Thus
V(ST R1,σ2 ) = O(ST R1,σ2 ) − 1.

items as follows.
P2 : n1 , n3 → pink
P3 : n1 , n4 →→ blue
P4 : n1 , n5 → red
105
3. Extended Notions
Thus S = {brown, pink, blue, red} is path-coloring set and its cardinality,
4, is path-coloring number. To sum them up, for given two vertices, x
and y, there are some paths from x to y. If two paths from x to y share
an endpoint, then they’re assigned to different colors. The set of different
colors,
S = {brown, pink, blue, red},
called path-coloring number and it’s denoted by V(ST R1,σ2 ) = 4;
(ii) all vertices don’t have same positions in the matter of creating paths. So
for every two given vertices, the number and the behaviors of paths aren’t
the same;
(iii) there aren’t some different paths which have no shared endpoints. So they
couldn’t been assigned to same color;


colors. The set of different colors,

3
XX 3
X
σi (x) = On (ST R1,σ2 ) − σi (n4 ) = 3.9,
x∈S i=1 i=1

3
X
Vn (ST R1,σ2 ) = On (ST R1,σ2 ) − σi (n4 ) = 3.9.
i=1

graph. Then
V(CM Cσ1 ,σ2 ) ≥ min |S|.
S∈{V1 ,V2 }V1 ∪V2 =V

graph. For given two vertices, x and y, there’s only one path with distinct edges
from x to y. If two paths from x to y share one endpoint, then they’re assigned
106

to different colors but there are more than |V2 | paths for vertices in part V1 and
there are more than |V1 | paths for vertices in part V2 . In the terms of number
of paths, all vertices don’t behave the same and they don’t have same positions
where they’re in different parts but all vertices behave the same and they have
same positions where they’re in same parts. The set of colors is
S = {red1 , red2 , · · · , redmin{V1 ,V2 }V1 ∪V2 =V },
colors. The set of different colors, S = {red1 , red2 , · · · , redmin{V1 ,V2 }V1 ∪V2 =V },
|S| = |{red1 , red2 , · · · , redmin{V1 ,V2 }V1 ∪V2 =V }| = min |S|,

S∈{V1 ,V2 }V1 ∪V2 =V
number and it’s denoted by V(CM Cσ1 ,σ2 ). Thus

S∈{V1 ,V2 }V1 ∪V2 =V

107
3. Extended Notions
P2 : n1 , n2 , n4 → pink
P3 : n1 , n2 , n4 , n3 → blue
P4 : n1 , n3 → red
P5 : n1 , n3 , n4 → yellow
P6 : n1 , n3 , n4 , n2 → black
Thus S = {brown, pink, blue, red, yellow, black} is path-coloring set and
its cardinality, 6, is path-coloring number. To sum them up, for given two
vertices, x and y, there are some paths from x to y. If two paths from x
to y share an endpoint, then they’re assigned to different colors. The set
of different colors,
S = {brown, pink, blue, red, yellow, black},
called path-coloring number and it’s denoted by V(CM Cσ1 ,σ2 ) = 6;
same;
3
XX 3
X
σi (x) = On (CM Cσ1 ,σ2 ) − σi (n1 ) = 3.9,
x∈S i=1 i=1

3
X
Vn (CM Cσ1 ,σ2 ) = On (CM Cσ1 ,σ2 ) − σi (n1 ) = 3.9.
i=1
108


V(CM Cσ1 ,σ2 ,··· ,σt ) ≥ min |S|.

S∈{V1 ,V2 ,··· ,Vt }V1 ∪V2 ∪···∪Vt =V

neutrosophic graph. For given two vertices, x and y, there’s only one path with
distinct edges from x to y. If two paths from x to y share one endpoint, then
they’re assigned to different colors but there are more than |V2 | + |V3 | + · · · + |Vt |
paths for vertices in part V1 and there are more than |V1 | + |V2 | + · · · + |Vt |
paths for vertices in part V2 . In the terms of number of paths, all vertices don’t
behave the same and they don’t have same positions where they’re in different
parts but all vertices behave the same and they have same positions where
they’re in same parts. The set of colors is
S = {red1 , red2 , · · · , redmin{V1 ,V2 }V1 ∪V2 ∪···∪Vt =V },
in this process. For given two vertices, x and y, there are some
they’re assigned to different colors. The set of different colors, S =
{red1 , red2 , · · · , redmin{V1 ,V2 ,··· ,Vt }V1 ∪V2 ∪···∪Vt =V }, in this process is called path-
coloring set from x to y. The minimum cardinality,

S∈{V1 ,V2 ,··· ,Vt }V1 ∪V2 ∪···∪Vt =V
number and it’s denoted by V(CM Cσ1 ,σ2 ,··· ,σt ). Thus
V(CM Cσ1 ,σ2 ,··· ,σt ) ≥ min |S|.

S∈{V1 ,V2 ,··· ,Vt }V1 ∪V2 ∪···∪Vt =V

109
3. Extended Notions
P2 : n1 , n2 , n4 → pink
P3 : n1 , n2 , n4 , n3 → blue
P4 : n1 , n2 , n4 , n5 → orange
P5 : n1 , n3 → red
P6 : n1 , n3 , n4 → yellow
P7 : n1 , n3 , n4 , n2 → black
P8 : n1 , n3 , n4 , n5 → white
P9 : n1 , n5 → green
P10 : n1 , n5 , n4 → gray
P11 : n1 , n5 , n4 , n2 → gold
P12 : n1 , n5 , n3 , n2 → purple
Thus S = {brown, pink, blue, orange, red, yellow, black, white, green, gray, gold, purple}
is path-coloring set and its cardinality, 12, is path-coloring number. To
sum them up, for given two vertices, x and y, there are some paths from
x to y. If two paths from x to y share an endpoint, then they’re assigned
to different colors. The set of different colors,
S = {brown, pink, blue, orange, red, yellow, black, white, green, gray, gold, purple},
called path-coloring number and it’s denoted by V(CM Cσ1 ,σ2 ,··· ,σt ) = 12;
(ii) all vertices have same positions in same part in the matter of creating
paths. So for every two given vertices, the number and the behaviors of
paths are the same. All vertices don’t have same positions in different
part in the matter of creating paths. So for every two given vertices, the
number and the behaviors of paths aren’t the same;
110

3
XX 3
X
σi (x) = On (CM Cσ1 ,σ2 ,··· ,σt ) − σi (n1 ) = 5.3,
x∈S i=1 i=1

3
X
Vn (CM Cσ1 ,σ2 ,··· ,σt ) = On (CM Cσ1 ,σ2 ,··· ,σt ) − σi (n1 ) = 5.3.
i=1

Then
V(W HL1,σ2 ) = min |S|.
S

argument is elementary. All vertices of a cycle join to one vertex. The paths
with an endpoint is center form the intended set to obtain number since the
number of these paths is the biggest. For given two vertices, x and y, there
are some paths from x to y. If two paths from x to y share an endpoint, then
they’re assigned to different colors. The set of different colors, in this process
is called path-coloring set from x to y. The minimum cardinality, minS |S|,
number and it’s denoted by V(W HL1,σ2 ). Thus
V(W HL1,σ2 ) = min |S|.
S
111
3. Extended Notions

(i) Consider a vertex. All paths with endpoints are as follow. All paths are
as follows.
P1 : n1 , n2 | P2 : n1 , n3 , n2
| P3 : n1 , n4 , n3 , n2 | P4 : n1 , n4 , n5 , n2
| P5 : n1 , n5 , n2
→ red | blue | pink | purple | black
P1 : n1 , n3 | P2 : n1 , n2 , n3
| P3 : n1 , n5 , n2 , n3 | P4 : n1 , n5 , n4 , n3
| P5 : n1 , n4 , n3
P1 : n1 , n4 | P2 : n1 , n3 , n4
| P3 : n1 , n2 , n3 , n4 | P4 : n1 , n2 , n5 , n4
| P5 : n1 , n5 , n4
P1 : n1 , n5 | P2 : n1 , n2 , n5
| P3 : n1 , n3 , n2 , n5 | P4 : n1 , n3 , n4 , n5
| P5 : n1 , n4 , n5
P1 : n2 , n3 | P2 : n2 , n1 , n3
| P3 : n2 , n1 , n4 , n3 | P4 : n2 , n1 , n5 , n4 , n3
| P5 : n2 , n5 , n1 , n3 | P6 : n2 , n5 , n1 , n4 , n3
| P7 : n2 , n5 , n4 , n3
112
→ red | blue | pink | purple | black | green | orange
P1 : n2 , n1 , n4 | P2 : n2 , n1 , n3 , n4
| P3 : n2 , n1 , n5 , n4 | P4 : n2 , n3 , n4
| P5 : n2 , n3 , n1 , n4 | P6 : n2 , n3 , n1 , n5 , n4
| P7 : n2 , n5 , n4
| P8 : n2 , n5 , n1 , n4
| P9 : n2 , n5 , n1 , n3 , n4
P1 : n2 , n5 | P2 : n2 , n1 , n5
| P3 : n2 , n1 , n4 , n5 | P4 : n2 , n1 , n3 , n4 , n5
| P5 : n2 , n3 , n1 , n5 | P6 : n2 , n3 , n1 , n4 , n5
| P7 : n2 , n3 , n4 , n5
P1 : n3 , n4 | P2 : n3 , n1 , n4
| P3 : n3 , n1 , n5 , n4 | P4 : n3 , n1 , n2 , n5 , n4
| P5 : n3 , n2 , n1 , n4 | P6 : n3 , n2 , n1 , n5 , n4
| P7 : n3 , n2 , n5 , n4
P1 : n3 , n1 , n5 | P2 : n3 , n1 , n2 , n5
| P3 : n3 , n1 , n4 , n5 | P4 : n3 , n2 , n5
| P5 : n3 , n2 , n1 , n5 | P6 : n3 , n2 , n1 , n4 , n5
| P7 : n3 , n4 , n5 | P8 : n3 , n4 , n1 , n5
| P9 : n3 , n4 , n1 , n2 , n5
P1 : n4 , n5 | P2 : n4 , n1 , n5
| P3 : n4 , n1 , n2 , n5 | P4 : n4 , n1 , n3 , n2 , n5
| P5 : n4 , n3 , n1 , n5 | P6 : n4 , n3 , n1 , n2 , n5
| P7 : n4 , n3 , n2 , n5
113
3. Extended Notions
The number is 48.

Thus S = {red1 , red2 , · · · , red48 } is path-coloring set and its cardinality,
colors,
S = {red1 , red2 , · · · , red48 },
called path-coloring number and it’s denoted by V(W HL1,σ2 ) = 48;
(ii) all vertices excluding center have same positions in the matter of creating
paths are the same;
S = {red1 , red2 , · · · , red48 },
3
XX 3
X
σi (x) = On (W HL1,σ2 ) − σi (n1 ) = 5.3,
x∈S i=1 i=1

3
X
Vn (W HL1,σ2 ) = On (W HL1,σ2 ) − σi (n1 ) = 5.3.
i=1
3.6 Setting of neutrosophic path-coloring number

In this section, I provide some results in the setting of neutrosophic path-coloring
about them.
114


Then
3
X
Vn (CM T σ ) = On (CM T σ ) − max σi (x).
x∈S
i=1

CM T σ : (V, E, σ, µ) is a complete-neutrosophic graph, all vertices are
connected to each other. So there’s one edge between two vertices. If
P : vi , vs , vs+1 , · · · , vs+z , vj is a path from vi to vj , then all permutations
of internal vertices, it means all vertices on the path excluding vi and vj , is
a path from vi to vj , too. Furthermore, all permutations of vertices make
a new path. The number of vertices is O(CM T σ ). For given two vertices,
x and y, there are some paths from x to y. If two paths from x to y share
an endpoint, then they’re assigned to different colors. The set S of different
colors in this process is called P path-coloring
neutrosophic cardinality, x∈Z i=1 σi (x), between all sets Zs including the
latter endpoints corresponded to path-coloring set Ss, is called neutrosophic
path-coloring number and it’s denoted by Vn (CM T σ ). Thus
3
X
Vn (CM T σ ) = On (CM T σ ) − max σi (x).
x∈S
i=1

115
3. Extended Notions

P1 : n1 , n2 → red
P2 : n1 , n3 , n2 → blue
P3 : n1 , n4 , n2 → yellow
P4 : n1 , n3 , n4 , n2 → white
P5 : n1 , n4 , n3 , n2 → black

called path-coloring number and it’s denoted by V(CM T ) = 15;
same;


coloring
P P3set from x to y. The P minimum neutrosophic cardinality,
3
x∈S i=1 σ i (x) = On (CM T ) − i=1 σi (n2 ) = 3.9, between all path-
coloring sets, Ss, is called neutrosophic path-coloring number and it’s
denoted by
3
X
Vn (CM T ) = On (CM T ) − σi (n2 ) = 3.9.
i=1

graph.
116

3
X
Vn (P T H) = On (P T H) − max σi (x).
x∈S
i=1

x1 , x2 , · · · , xO(P T H) be a path-neutrosophic graph. For given two vertices, x and
y, there’s one path from x to y. If two paths from x to y share one endpoint, then
they’re assigned to different colors but there are only O(P T H)−1 paths for every
given vertex. In the terms of number of paths, all vertices behave the same and
they’ve same positions. The set of colors is S = {red1 , red2 , · · · , redO(P T H)−1 },
in this process. For given two vertices, x and y, there are some paths from
x to y. If two paths from x to y share an endpoint, then they’re assigned to
different colors. The set of different colors, S = {red1 , red2 , · · · , redO(P T H)−1 },
|S| = |{red1 , red2 , · · · , redO(P T H)−1 }| = O(P T H)−1, between all path-coloring
V(P T H). For given two vertices, x and y, there are some paths from x to y.
If two paths from x to y share an endpoint, then they’re assigned to different
colors. The set S of different colors in this processP is called
P3path-coloring set
from x to y. The minimum neutrosophic cardinality, x∈Z i=1 σi (x), between
all sets Zs including the latter endpoints corresponded to path-coloring set
Ss, is called neutrosophic path-coloring number and it’s denoted by Vn (P T H).
Thus
X3
Vn (P T H) = On (P T H) − max σi (x).
x∈S
i=1

117
3. Extended Notions
P1 : n1 , n2 → red
P2 : n1 , n2 , n3 → blue
P3 : n1 , n2 , n3 , n4 → yellow
P4 : n1 , n2 , n3 , n4 , n5 → white
Thus S = {red, blue, yellow, white}, is path-coloring set and its

cardinality, 4, is path-coloring number. To sum them up, for given
from x to y share an endpoint, then they’re assigned to different
colors. The set of different colors, S = {red, blue, yellow, white}, in
are the same;
cardinality;
P 3
P3
3
X
Vn (P T H) = On (P T H) − σi (n2 ) = 4.5.
i=1

P1 : n1 , n2 → red
P2 : n1 , n2 , n3 → blue
P3 : n1 , n2 , n3 , n4 → yellow
118
P4 : n1 , n2 , n3 , n4 , n5 → white
P5 : n1 , n2 , n3 , n4 , n5 , n6 → black
Thus S = {red, blue, yellow, white, black}, is path-coloring set and

its cardinality, 5, is path-coloring number. To sum them up, for given
The set of different colors, S = {red, blue, yellow, white, black}, in
are the same;
cardinality;
P 3
P3
3
X
Vn (P T H) = On (P T H) − σi (n5 ) = 7.4.
i=1

O(CY C) ≥ 3. Then
3
X
Vn (CY C) = On (CY C) − max σi (x).
x∈S
i=1

vertices, x and y, there are only two paths with distinct edges from x to y. If
two paths from x to y share one endpoint, then they’re assigned to different
colors but there are only 2 × (O(CY C) − 1) paths for every given vertex. In
the terms of number of paths, all vertices behave the same and they’ve same
positions. The set of colors is
S = {red1 , red2 , · · · , red2×(O(CY C)−1) },
119
3. Extended Notions


colors. The set of different colors, S = {red1 , red2 , · · · , red2×(O(CY C)−1) }, in
this process is called path-coloring set from x to y. The minimum cardinality,
|S| = |{red1 , red2 , · · · , red2×(O(CY C)−1) }| = 2 × (O(CY C) − 1),
number and it’s denoted by V(CY C). Thus
V(CY C) = 2 × (O(CY C) − 1).
For given two vertices, x and y, there are some paths from x to y. If two paths
3
120
neutrosophic path-coloring number and it’s denoted by Vn (CY C). Thus

3
X
Vn (CY C) = On (CY C) − max σi (x).
x∈S
i=1


P1 : n1 , n2 → red
P2 : n1 , n2 , n3 → blue
P3 : n1 , n2 , n3 , n4 → yellow
P4 : n1 , n2 , n3 , n4 , n5 → white
P5 : n1 , n2 , n3 , n4 , n5 , n6 → black
P6 : n1 , n6 , n5 , n4 , n3 , n2 → pink
P7 : n1 , n6 , n5 , n4 , n3 → purple
P8 : n1 , n6 , n5 , n4 → brown
P9 : n1 , n6 , n5 → orange
P10 : n1 , n6 → green
Thus S = {red, blue, yellow, white, black, pink, purple, brown, orange, green},

are the same;
121
3. Extended Notions

cardinality;

3
XX 3
X
σi (x) = On (CY C) − σi (n2 ) = 6,
x∈S i=1 i=1

3
X
Vn (CY C) = On (CY C) − σi (n2 ) = 6.
i=1

P1 : n1 , n2 → red
P2 : n1 , n2 , n3 → blue
P3 : n1 , n2 , n3 , n4 → yellow
P4 : n1 , n2 , n3 , n4 , n5 → white
P5 :: n1 , n5 , n4 , n3 , n2 → black
P6 : n1 , n5 , n4 , n3 → pink
P7 : n1 , n5 , n4 → purple
Thus S = {red, blue, yellow, white, black, pink, purple, brown} is

path-coloring set and its cardinality, 8, is path-coloring number.

122

are the same;
cardinality;
3
XX 3
X
σi (x) = On (CY C) − σi (n3 ) = 6.2,
x∈S i=1 i=1

3
X
Vn (CY C) = On (CY C) − σi (n3 ) = 6.2.
i=1

center c. Then
3
X
Vn (ST R1,σ2 ) = On (ST R1,σ2 ) − σi (c).
i=1
123
3. Extended Notions


forever. For given two vertices, x and y, there’s only one path with distinct
edges from x to y. If two paths from x to y share one endpoint, then they’re
assigned to different colors but there are only O(ST R1,σ2 ) − 1 paths for center.
In the terms of number of paths, all vertices don’t behave the same and they
don’t have same positions. The set of colors is
S = {red1 , red2 , · · · , redO(ST R1,σ2 )−1 },
colors. The set of different colors, S = {red1 , red2 , · · · , redO(ST R1,σ2 −1 }, in this
process is called path-coloring set from x to y. The minimum cardinality,
|S| = |{red1 , red2 , · · · , redO(ST R1,σ2 )−1 }| = O(ST R1,σ2 ) − 1,
number and it’s denoted by V(ST R1,σ2 ). Thus
V(ST R1,σ2 ) = O(ST R1,σ2 ) − 1.

3
neutrosophic path-coloring number and it’s denoted by Vn (ST R1,σ2 ). Thus
3
X
Vn (ST R1,σ2 ) = On (ST R1,σ2 ) − σi (c).
i=1

124
items as follows.
P2 : n1 , n3 → pink
P3 : n1 , n4 →→ blue
P4 : n1 , n5 → red
Thus S = {brown, pink, blue, red} is path-coloring set and its cardinality,
colors,
called path-coloring number and it’s denoted by V(ST R1,σ2 ) = 4;
(ii) all vertices don’t have same positions in the matter of creating paths. So
for every two given vertices, the number and the behaviors of paths aren’t
the same;
(iii) there aren’t some different paths which have no shared endpoints. So they
couldn’t been assigned to same color;

3
XX 3
X
σi (x) = On (ST R1,σ2 ) − σi (n4 ) = 3.9,
x∈S i=1 i=1
125
3. Extended Notions


3
X
Vn (ST R1,σ2 ) = On (ST R1,σ2 ) − σi (n4 ) = 3.9.
i=1

graph. Then
X 3
X 3
X
Vn (CM Cσ1 ,σ2 ) ≥ σi (x) − max σi (x).
x∈S
x∈S∈{V1 ,V2 }V1 ∪V2 =V i=1 i=1

graph. For given two vertices, x and y, there’s only one path with distinct edges
from x to y. If two paths from x to y share one endpoint, then they’re assigned
to different colors but there are more than |V2 | paths for vertices in part V1 and
there are more than |V1 | paths for vertices in part V2 . In the terms of number
of paths, all vertices don’t behave the same and they don’t have same positions
where they’re in different parts but all vertices behave the same and they have
same positions where they’re in same parts. The set of colors is
S = {red1 , red2 , · · · , redmin{V1 ,V2 }V1 ∪V2 =V },
colors. The set of different colors, S = {red1 , red2 , · · · , redmin{V1 ,V2 }V1 ∪V2 =V },

S∈{V1 ,V2 }V1 ∪V2 =V
number and it’s denoted by V(CM Cσ1 ,σ2 ). Thus

S∈{V1 ,V2 }V1 ∪V2 =V
126
3
neutrosophic path-coloring number and it’s denoted by Vn (CM Cσ1 ,σ2 ). Thus
X 3
X 3
X
Vn (CM Cσ1 ,σ2 ) ≥ σi (x) − max σi (x).
x∈S
x∈S∈{V1 ,V2 }V1 ∪V2 =V i=1 i=1

P2 : n1 , n2 , n4 → pink
P3 : n1 , n2 , n4 , n3 → blue
P4 : n1 , n3 → red
P5 : n1 , n3 , n4 → yellow
P6 : n1 , n3 , n4 , n2 → black
Thus S = {brown, pink, blue, red, yellow, black} is path-coloring set and
its cardinality, 6, is path-coloring number. To sum them up, for given two
vertices, x and y, there are some paths from x to y. If two paths from x
to y share an endpoint, then they’re assigned to different colors. The set
of different colors,

called path-coloring number and it’s denoted by V(CM Cσ1 ,σ2 ) = 6;
same;
127
3. Extended Notions




3
XX 3
X
σi (x) = On (CM Cσ1 ,σ2 ) − σi (n1 ) = 3.9,
x∈S i=1 i=1

3
X
Vn (CM Cσ1 ,σ2 ) = On (CM Cσ1 ,σ2 ) − σi (n1 ) = 3.9.
i=1

X 3
X 3
X
Vn (CM Cσ1 ,σ2 ,··· ,σt ) ≥ σi (x) − max σi (x).
x∈S
x∈S∈{V1 ,V2 ,··· ,Vt }V1 ∪V2 ∪···∪Vt =V i=1 i=1
128

neutrosophic graph. For given two vertices, x and y, there’s only one path with
distinct edges from x to y. If two paths from x to y share one endpoint, then
they’re assigned to different colors but there are more than |V2 | + |V3 | + · · · + |Vt |
paths for vertices in part V1 and there are more than |V1 | + |V2 | + · · · + |Vt |
paths for vertices in part V2 . In the terms of number of paths, all vertices don’t
behave the same and they don’t have same positions where they’re in different
parts but all vertices behave the same and they have same positions where
they’re in same parts. The set of colors is
S = {red1 , red2 , · · · , redmin{V1 ,V2 }V1 ∪V2 ∪···∪Vt =V },
in this process. For given two vertices, x and y, there are some
they’re assigned to different colors. The set of different colors, S =
{red1 , red2 , · · · , redmin{V1 ,V2 ,··· ,Vt }V1 ∪V2 ∪···∪Vt =V }, in this process is called path-
coloring set from x to y. The minimum cardinality,

S∈{V1 ,V2 ,··· ,Vt }V1 ∪V2 ∪···∪Vt =V
number and it’s denoted by V(CM Cσ1 ,σ2 ,··· ,σt ). Thus
V(CM Cσ1 ,σ2 ,··· ,σt ) ≥ min |S|.

S∈{V1 ,V2 ,··· ,Vt }V1 ∪V2 ∪···∪Vt =V
3
neutrosophic path-coloring number and it’s denoted by Vn (CM Cσ1 ,σ2 ,··· ,σt ).
Thus
X 3
X 3
X
Vn (CM Cσ1 ,σ2 ,··· ,σt ) ≥ σi (x) − max σi (x).
x∈S
x∈S∈{V1 ,V2 ,··· ,Vt }V1 ∪V2 ∪···∪Vt =V i=1 i=1

129
3. Extended Notions
P2 : n1 , n2 , n4 → pink
P3 : n1 , n2 , n4 , n3 → blue
P4 : n1 , n2 , n4 , n5 → orange
P5 : n1 , n3 → red
P6 : n1 , n3 , n4 → yellow
P7 : n1 , n3 , n4 , n2 → black
P8 : n1 , n3 , n4 , n5 → white
P10 : n1 , n5 , n4 → gray
P11 : n1 , n5 , n4 , n2 → gold
P12 : n1 , n5 , n3 , n2 → purple
is path-coloring set and its cardinality, 12, is path-coloring number. To
sum them up, for given two vertices, x and y, there are some paths from
x to y. If two paths from x to y share an endpoint, then they’re assigned
to different colors. The set of different colors,

called path-coloring number and it’s denoted by V(CM Cσ1 ,σ2 ,··· ,σt ) = 12;
paths are the same. All vertices don’t have same positions in different
part in the matter of creating paths. So for every two given vertices, the
number and the behaviors of paths aren’t the same;


130


3
XX 3
X
x∈S i=1 i=1

3
X
i=1

Then
X3
Vn (W HL1,σ2 ) = On (W HL1,σ2 ) − σi (c).
i=1

argument is elementary. All vertices of a cycle join to one vertex. The paths
with an endpoint is center form the intended set to obtain number since the
number of these paths is the biggest. For given two vertices, x and y, there
are some paths from x to y. If two paths from x to y share an endpoint, then
they’re assigned to different colors. The set of different colors, in this process
is called path-coloring set from x to y. The minimum cardinality, minS |S|,
number and it’s denoted by V(W HL1,σ2 ). Thus
V(W HL1,σ2 ) = min |S|.

S
131
3. Extended Notions

3
neutrosophic path-coloring number and it’s denoted by Vn (W HL1,σ2 ). Thus
3
X
Vn (W HL1,σ2 ) = On (W HL1,σ2 ) − σi (c).
i=1

(i) Consider a vertex. All paths with endpoints are as follow. All paths are
as follows.
P1 : n1 , n2 | P2 : n1 , n3 , n2
| P3 : n1 , n4 , n3 , n2 | P4 : n1 , n4 , n5 , n2
| P5 : n1 , n5 , n2
P1 : n1 , n3 | P2 : n1 , n2 , n3
| P3 : n1 , n5 , n2 , n3 | P4 : n1 , n5 , n4 , n3
| P5 : n1 , n4 , n3
P1 : n1 , n4 | P2 : n1 , n3 , n4
| P3 : n1 , n2 , n3 , n4 | P4 : n1 , n2 , n5 , n4
| P5 : n1 , n5 , n4
P1 : n1 , n5 | P2 : n1 , n2 , n5
| P3 : n1 , n3 , n2 , n5 | P4 : n1 , n3 , n4 , n5
| P5 : n1 , n4 , n5
132
P1 : n2 , n3 | P2 : n2 , n1 , n3
| P3 : n2 , n1 , n4 , n3 | P4 : n2 , n1 , n5 , n4 , n3
| P5 : n2 , n5 , n1 , n3 | P6 : n2 , n5 , n1 , n4 , n3
| P7 : n2 , n5 , n4 , n3
P1 : n2 , n1 , n4 | P2 : n2 , n1 , n3 , n4
| P3 : n2 , n1 , n5 , n4 | P4 : n2 , n3 , n4
| P5 : n2 , n3 , n1 , n4 | P6 : n2 , n3 , n1 , n5 , n4
| P7 : n2 , n5 , n4
| P8 : n2 , n5 , n1 , n4
| P9 : n2 , n5 , n1 , n3 , n4
P1 : n2 , n5 | P2 : n2 , n1 , n5
| P3 : n2 , n1 , n4 , n5 | P4 : n2 , n1 , n3 , n4 , n5
| P5 : n2 , n3 , n1 , n5 | P6 : n2 , n3 , n1 , n4 , n5
| P7 : n2 , n3 , n4 , n5
P1 : n3 , n4 | P2 : n3 , n1 , n4
| P3 : n3 , n1 , n5 , n4 | P4 : n3 , n1 , n2 , n5 , n4
| P5 : n3 , n2 , n1 , n4 | P6 : n3 , n2 , n1 , n5 , n4
| P7 : n3 , n2 , n5 , n4
P1 : n3 , n1 , n5 | P2 : n3 , n1 , n2 , n5
| P3 : n3 , n1 , n4 , n5 | P4 : n3 , n2 , n5
| P5 : n3 , n2 , n1 , n5 | P6 : n3 , n2 , n1 , n4 , n5
| P7 : n3 , n4 , n5 | P8 : n3 , n4 , n1 , n5
| P9 : n3 , n4 , n1 , n2 , n5
133
3. Extended Notions
P1 : n4 , n5 | P2 : n4 , n1 , n5
| P3 : n4 , n1 , n2 , n5 | P4 : n4 , n1 , n3 , n2 , n5
| P5 : n4 , n3 , n1 , n5 | P6 : n4 , n3 , n1 , n2 , n5
| P7 : n4 , n3 , n2 , n5
The number is 48.

Thus S = {red1 , red2 , · · · , red48 } is path-coloring set and its cardinality,
colors,
S = {red1 , red2 , · · · , red48 },
called path-coloring number and it’s denoted by V(W HL1,σ2 ) = 48;
(ii) all vertices excluding center have same positions in the matter of creating
paths are the same;
S = {red1 , red2 , · · · , red48 },
3
XX 3
X
σi (x) = On (W HL1,σ2 ) − σi (n1 ) = 5.3,
x∈S i=1 i=1

3
X
Vn (W HL1,σ2 ) = On (W HL1,σ2 ) − σi (n1 ) = 5.3.
i=1
134


135
3. Extended Notions
Values (0.7, 0.9, 0.3) (0.4, 0.2, 0.8)· · · (0.4, 0.2, 0.8)
Values (0.4, 0.2, 0.3) (0.5, 0.2, 0.3)· · · (0.3, 0.2, 0.3)



specific number. Every subject has connection with some subjects. Thus
the connection is applied as possible and the model demonstrates quasi-full
connections as quasi-possible. Using the notion of strong on the connection
amid subjects, causes the importance of subject goes in the highest level
such that the value amid two consecutive subjects, is determined by those
subjects. If the configuration is star, the number is different. Also, it holds
for other types such that complete, wheel, path, and cycle. The collection
of situations is another application of its path-coloring number and its
neutrosophic path-coloring number when the notion of family is applied in
the way that all members of family are from same classes of neutrosophic
graphs. As follows, There are five subjects which are represented as Figure
(3.20). This model is strong and even more it’s quasi-complete. And the
study proposes using specific number which is called its path-coloring
number and its neutrosophic path-coloring number. There are also some
analyses on other numbers in the way that, the clarification is gained
about being special number or not. Also, in the last part, there is one
neutrosophic number to assign to this model and situation to compare
136
3.8. Case 1: Complete-t-partite Model alongside its path-coloring number and
its neutrosophic path-coloring number
P2 : n1 , n2 , n4 → pink
P3 : n1 , n2 , n4 , n3 → blue
P4 : n1 , n2 , n4 , n5 → orange
P5 : n1 , n3 → red
P6 : n1 , n3 , n4 → yellow
P7 : n1 , n3 , n4 , n2 → black
P8 : n1 , n3 , n4 , n5 → white
P10 : n1 , n5 , n4 → gray
P11 : n1 , n5 , n4 , n2 → gold
P12 : n1 , n5 , n3 , n2 → purple
in this process is called path-coloring set from x to y. The

minimum cardinality, 12, between all path-coloring sets from two
given vertices is called path-coloring number and it’s denoted by
V(CM Cσ1 ,σ2 ,··· ,σt ) = 12;
paths. So for every two given vertices, the number and the behaviors
of paths are the same. All vertices don’t have same positions in
different part in the matter of creating paths. So for every two given
vertices, the number and the behaviors of paths aren’t the same;
cardinality;
137
3. Extended Notions


3
XX 3
X
x∈S i=1 i=1

3
X
i=1

Neutrosophic Graph in the Viewpoint of its

specific number. Every subject has connection with every given subject
in deemed way. Thus the connection applied as possible and the model
demonstrates full connections as possible between parts but with different
view where symmetry amid vertices and edges are the matters. Using the
subjects, is determined by those subjects. If the configuration is complete
multipartite, the number is different. Also, it holds for other types such
that star, wheel, path, and cycle. The collection of situations is another
application of its path-coloring number and its neutrosophic path-coloring
number when the notion of family is applied in the way that all members
of family are from same classes of neutrosophic graphs. As follows, There
138
Viewpoint of its path-coloring number and its neutrosophic path-coloring
number
are four subjects which are represented in the formation of one model as
Figure (3.21). This model is neutrosophic strong as individual and even
more it’s complete. And the study proposes using specific number which is
called its path-coloring number and its neutrosophic path-coloring number
P1 : n1 , n2 → red
P2 : n1 , n3 , n2 → blue
P3 : n1 , n4 , n2 → yellow
P4 : n1 , n3 , n4 , n2 → white
P5 : n1 , n4 , n3 , n2 → black
Thus ∪3i=1 Si = {redi , bluei , yellowi , whitei , blacki }, is path-coloring

set and its cardinality, 15, is path-coloring number. To sum
them up, for given two vertices, x and y, there are some paths
from x to y. If two paths from x to y share an endpoint, then
∪3i=1 Si = {redi , bluei , yellowi , whitei , blacki }, in this process is called
path-coloring set from x to y. The minimum cardinality, 15, between
all path-coloring sets from two given vertices is called path-coloring
number and it’s denoted by V(CM T σ ) = 15;
are the same;
cardinality;
(vi) for given two vertices, x and y, there are some paths from x
to y. If two paths from x to y share an endpoint, then they’re
assigned to different colors. The set of different colors, ∪3i=1 Si =
coloring
P P3set from x to y. The minimum P3 neutrosophic cardinality,
x∈S i=1 σi (x) = On (CM T σ ) − i=1 σi (n2 ) = 3.9, between all
path-coloring sets, Ss, is called neutrosophic path-coloring number
139
3. Extended Notions
and it’s denoted by

3
X
Vn (CM T σ ) = On (CM T σ ) − σi (n2 ) = 3.9.
i=1
3.10 Open Problems

Notion concerning its path-coloring number and its neutrosophic path-coloring
number are defined in neutrosophic graphs. Thus,
Question 3.10.1. Is it possible to use other types of its path-coloring number
and its neutrosophic path-coloring number?
Question 3.10.2. Are existed some connections amid different types of its path-
coloring number and its neutrosophic path-coloring number in neutrosophic
graphs?
independent study?

This study uses two definitions concerning path-coloring number and neutro-
sophic path-coloring number arising from different types of paths based on
shared endpoints amid them in neutrosophic graphs assigned to neutrosophic
graphs. Consider two vertices. Minimum number of shared endpoints based on
those vertices in the formations of all paths with those vertices as their starts
and their ends to compare with other paths, is a number which is representative
based on those vertices. Minimum neutrosophic number of latter endpoints cor-
responded to path-coloring set amid neutrosophic cardinality of all sets of latter
endpoints corresponded to path-coloring set is called neutrosophic path-coloring
number. The connections of paths which aren’t clarified by a common endpoint
differ them from each other and put them in different categories to represent a
number which is called path-coloring number and neutrosophic path-coloring
140
3.11. Conclusion and Closing Remarks
1. path-coloring number of Model 1. Connections amid Classes
2. neutrosophic path-coloring number of Model
3. Minimal path-coloring sets 2. Study on Families
them in neutrosophic graphs assigned to neutrosophic graphs. Further studies
could be about changes in the settings to compare these notions amid different
settings of neutrosophic graphs theory. One way is finding some relations amid
all definitions of notions to make sensible definitions. In Table (3.2), some
limitations and advantages of this study are pointed out.
141
Bibliography

Ref2 [2] L. Aronshtam, and H. Ilani, “Bounds on the average and minimum at-
tendance in preference-based activity scheduling”, Discrete Applied Math-
ematics 306 (2022) 114-119. (https://doi.org/10.1016/j.dam.2021.09.024.)
Ref4 [4] M. Bold, and M. Goerigk, “Investigating the recoverable ro-

bust single machine scheduling problem under interval uncer-
tainty”, Discrete Applied Mathematics 313 (2022) 99-114. (ht-
tps://doi.org/10.1016/j.dam.2022.02.005.)

Theory 10 (2016) 86-101.
Ref6 [6] R. R. Del-Vecchio, and M. Kouider, “New bounds for the b-chromatic
number of vertex deleted graphs”, Discrete Applied Mathematics 306
(2022) 108-113. (https://doi.org/10.1016/j.dam.2021.09.023.)
Ref7 [7] M. E. Elaine et al., “Bipartite completion of colored graphs avoiding

chordless cycles of given lengths”, Discrete Applied Mathematics (2022).
(https://doi.org/10.1016/j.dam.2022.03.027.)

prints202112.0448.v1).

tems 49 (2022) 531-561 (doi: 10.5281/zenodo.6456413).
143
Bibliography
10.20944/preprints202201.0239.v1).
Ref12 [12] R. Janczewski et al., “Infinite chromatic games”, Discrete Applied Math-
ematics 309 (2022) 138-146. (https://doi.org/10.1016/j.dam.2021.11.020.)
Ref13 [13] L. Li, and X. Li, “Edge-disjoint rainbow triangles in edge-colored
graphs”, Discrete Applied Mathematics 318 (2022) 21-30. (ht-
tps://doi.org/10.1016/j.dam.2022.05.016.)
Ref14 [14] W. Li et al., “Rainbow triangles in arc-colored digraphs”,
Discrete Applied Mathematics 314 (2022) 169-180. (ht-
tps://doi.org/10.1016/j.dam.2022.02.011.)
Ref15 [15] Z. Lu, and L. Shi, “A sufficient condition for edge 6-colorable planar graphs
with maximum degree 6 ”, Discrete Applied Mathematics 313 (2022) 67-70.
(https://doi.org/10.1016/j.dam.2022.01.018.)
Ref16 [16] Z. Masih, and M. Zaker, “Some comparative results concerning the Grundy
and b-chromatic number of graphs”, Discrete Applied Mathematics 306
(2022) 1-6. (https://doi.org/10.1016/j.dam.2021.09.015.)
and Systems 11 (2016) 31-44.
Sofia (1994) 59-61.
Ref21 [21] F. Wu et al., “Color neighborhood union conditions for proper edge-
pancyclicity of edge-colored complete graphs”, Discrete Applied Mathem-
atics 307 (2022) 145-152. (https://doi.org/10.1016/j.dam.2021.10.016.)
144

Neutrosophic Path-Coloring

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Neutrosophic Path-Coloring

Uploaded by

Copyright:

Available Formats

Neutrosophic

Dr. Henry Garrett

In this book, some notions are introduced about “Neutrosophic Path-Coloring”.

ments, remarks, examples and clarifications about some classes of neutrosophic

this study. Neutrosophic dominating path-coloring notion is applied to different

2.8 Case 1: Complete-t-partite Model alongside its dominating

1.1 A Neutrosophic Graph in the Viewpoint of its path-coloring number

1.18 A Neutrosophic Graph in the Viewpoint of its path-coloring number

2.1 A Neutrosophic Graph in the Viewpoint of its dominating path-

2.14 A Neutrosophic Graph in the Viewpoint of its dominating path-

3.1 A Neutrosophic Graph in the Viewpoint of its path-coloring number

3.13 A Neutrosophic Graph in the Viewpoint of its path-coloring number

1.1 Scheduling concerns its Subjects and its Connections as a neutro-

2.1 Scheduling concerns its Subjects and its Connections as a neutro-

3.1 Scheduling concerns its Subjects and its Connections as a neutro-

[Ref1] Henry Garrett, “Path Coloring Numbers of Neutrosophic Graphs

Path Coloring Numbers of Neutrosophic Graphs Based on

path-coloring set from x to y. The minimum cardinality between all path-coloring

Classes of Neutrosophic Graphs

1.3 Motivation and Contributions

µ(vi vj ) ≤ σ(vi ) ∧ σ(vj ).

(i) : σ is called neutrosophic vertex set.

(ii) : µ is called neutrosophic edge set.

(iii) : |V | is called order of NTG and it’s denoted by O(N T G).

Some classes of well-known neutrosophic graphs are defined. These classes

(i) : a sequence of consecutive vertices P : x0 , x1 , · · · , xO(N T G) is called path

(iii) : connectedness amid vertices x0 and xt is

(iv) : a sequence of consecutive vertices P : x0 , x1 , · · · , xO(N T G) , x0 is called

(vi) : t-partite is complete bipartite if t = 2, and it’s denoted by Kσ1 ,σ2 ;

(vii) : complete bipartite is star if |V1 | = 1, and it’s denoted by S1,σ2 ;

(ix) : it’s complete where ∀uv ∈ V, µ(uv) = σ(u) ∧ σ(v);

(x) : it’s strong where ∀uv ∈ E, µ(uv) = σ(u) ∧ σ(v).

To make them concrete, I bring preliminaries of this article in two upcoming

µ(vi vj ) ≤ σ(vi ) ∧ σ(vj ).

1.4.6.1. N T G = (V, E, σ = (σ1 , σ2 , σ3 ), µ = (µ1 , µ2 , µ3 )), O(N T G), and

1.4.6.2. CM T σ , P T H, CY C, ST R1,σ2 , CM T σ1 ,σ2 , CM T σ1 ,σ2 ,··· ,σt , and

Definition 1.4.7. (path-coloring numbers).

For convenient usages, the word neutrosophic which is used in previous

The paths P1 , P2 and P3 has no shared edge so they’ve been colored

Figure 1.1: A Neutrosophic Graph in the Viewpoint of its path-coloring number

is 0.9. Thus minimum neutrosophic cardinality is 1.5. And corresponded

1.5 Setting of path-coloring number

L(CM T σ ) = min |S|.

Proof. Suppose CM T σ : (V, E, σ, µ) is a complete-neutrosophic graph. By

L(CM T σ ) = min |S|.

The clarifications about results are in progress as follows. A complete-

The paths P1 , P2 and P3 has no shared edge so they’ve been colored

Figure 1.2: A Neutrosophic Graph in the Viewpoint of its path-coloring number

is 0.9. Thus minimum neutrosophic cardinality is 1.5. And corresponded

Another class of neutrosophic graphs is addressed to path-neutrosophic

Proof. Suppose P T H : (V, E, σ, µ) is a path-neutrosophic graph. Let

Example 1.5.4. There are two sections for clarifications.

(a) In Figure (1.3), an odd-path-neutrosophic graph is illustrated. Some

(i) All paths are as follows.

(ii) 1-paths have same color;

(iv) the position of given vertices could be different in the terms of

(v) every color is corresponded to some shared edges. Minimum

(vi) all paths are as follows.

(b) In Figure (1.4), an even-path-neutrosophic graph is illustrated. Some

(i) All paths are as follows.

(ii) 1-paths have same color;

Proposition 1.5.5. Let N T G : (V, E, σ, µ) be a cycle-neutrosophic graph where

Proof. Suppose CY C : (V, E, σ, µ) is a cycle-neutrosophic graph. For given two

Figure 1.3: A Neutrosophic Graph in the Viewpoint of its path-coloring number