0034 - Zero Forcing Number in Neutrosophic Graphs

Zero Forcing Number in
Neutrosophic Graphs
Ideas | Approaches | Accessibility | Availability
Dr. Henry Garrett

Report | Exposition | References | Research #22 2022
Abstract
In this book, some notions are introduced about “Zero Forcing Number in
Neutrosophic Graphs.” Three chapters are devised as “Common Notions”,
“Modified Notions” and “Extended Notions”. Three manuscripts are cited as
the references of these chapters which are my 47th, 48th, and 49th manuscripts.
I’ve used my 47th, 48th, and 49th manuscripts to write this book.
In first chapter, there are some points as follow. New setting is introduced to
study zero forcing number and zero forcing neutrosophic-number. Leaf-like is a
key term to have these notions. Let N T G : (V, E, σ, µ) be a neutrosophic graph.
Then zero forcing number Z(N T G) for a neutrosophic graph N T G : (V, E, σ, µ)
is minimum cardinality of a set S of black vertices (whereas vertices in V (G) \ S
are colored white) such that V (G) is turned black after finitely many applications
of “the color-change rule”: a white vertex is converted to a black vertex if it is
the only white neighbor of a black vertex. Zero forcing neutrosophic-number
Zn (N T G) for a neutrosophic graph N T G : (V, E, σ, µ) is minimum neutrosophic
cardinality of a set S of black vertices (whereas vertices in V (G) \ S are colored
white) such that V (G) is turned black after finitely many applications of
“the color-change rule”: a white vertex is converted to a black vertex if it
is the only white neighbor of a black vertex. Zero forcing number and zero
forcing neutrosophic-number are about a set of vertices which are applied
into the setting of neutrosophic graphs. The structure of set is studied and
general results are obtained. Also, some classes of neutrosophic graphs namely
path-neutrosophic graphs, cycle-neutrosophic graphs, complete-neutrosophic
graphs, star-neutrosophic graphs, bipartite-neutrosophic graphs, and t-partite-
neutrosophic graphs are investigated in the terms of a minimal set which forms
both of zero forcing number and zero forcing neutrosophic-number. Neutrosophic
number is reused in this way. It’s applied to use the type of neutrosophic number
in the way that, three values of a vertex are used and they’ve same share to
construct this number to compare with other vertices. Summation of three values
of vertex makes one number and applying it to a comparison. This approach
facilitates identifying vertices which form zero forcing number and zero forcing
neutrosophic-number. In path-neutrosophic graphs, a leaf forms minimal set but
in cycle-neutrosophic graphs, two vertices which are neighbors, forms minimal
set. Other classes have same approaches. In complete-neutrosophic graphs, a set
of vertices excluding one vertex leads us to zero forcing number and zero forcing
neutrosophic-number. In star-neutrosophic graphs , a set of vertices excluding
center and other vertex makes minimal set. In complete-bipartite-neutrosophic
graphs, a set of vertices excluding two vertices from different parts makes
i
Abstract
intended set but in complete-t-partite-neutrosophic graphs, a set of vertices

excluding one vertex makes intended set. In both settings, some classes of
well-known neutrosophic graphs are studied. Some clarifications for each result
and each definition are provided. Using basic set to extend this set to set of all
vertices has key role to have these notions in the form of zero forcing number
and zero forcing neutrosophic-number. The cardinality of a set has eligibility to
form zero forcing number but the neutrosophic cardinality of a set has eligibility
to call zero forcing neutrosophic-number. Some results get more frameworks and
perspective about these definitions. The way in that, two vertices have unique
connection together, opens the way to do some approaches. A vertex could
affect on other vertex but there’s no usage of edges. 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. Some problems are proposed to pursue this
study. Basic familiarities with graph theory and neutrosophic graph theory are
proposed for this article.
In second chapter, there are some points as follow. New setting is introduced to
study failed zero-forcing number and failed zero-forcing neutrosophic-number.
Leaf-like is a key term to have these notions. Forcing a vertex to change its
color is a type of approach to force that vertex to be zero-like. Forcing a vertex
which is only neighbor for zero-like vertex to be zero-like vertex but now reverse
approach is on demand which is finding biggest set which doesn’t force. Let
N T G : (V, E, σ, µ) be a neutrosophic graph. Then failed zero-forcing number
Z(N T G) for a neutrosophic graph N T G : (V, E, σ, µ) is maximal cardinality
of a set S of black vertices (whereas vertices in V (G) \ S are colored white)
such that V (G) isn’t turned black after finitely many applications of “the
color-change rule”: a white vertex is converted to a black vertex if it is the
only white neighbor of a black vertex. Failed zero-forcing neutrosophic-number
Zn (N T G) for a neutrosophic graph N T G : (V, E, σ, µ) is maximal neutrosophic
white) such that V (G) isn’t turned black after finitely many applications of
“the color-change rule”: a white vertex is converted to a black vertex if it is the
only white neighbor of a black vertex. Failed zero-forcing number and failed
zero-forcing neutrosophic-number are about a set of vertices which are applied
neutrosophic graphs are investigated in the terms of maximal set which forms
both of failed zero-forcing number and failed zero-forcing neutrosophic-number.
Neutrosophic number is reused in this way. It’s applied to use the type of
neutrosophic number in the way that, three values of a vertex are used and
they’ve same share to construct this number to compare with other vertices.
Summation of three values of vertex makes one number and applying it to a
comparison. This approach facilitates identifying vertices which form failed
zero-forcing number and failed zero-forcing neutrosophic-number. In path-
neutrosophic graphs, the set of vertices such that every given two vertices
in the set, have distance at least two, forms maximal set but with slightly
differences, in cycle-neutrosophic graphs, the set of vertices such that every
given two vertices in the set, have distance at least two, forms maximal set.
ii
Other classes have same approaches. In complete-neutrosophic graphs, a set
of vertices excluding two vertices leads us to failed zero-forcing number and
failed zero-forcing neutrosophic-number. In star-neutrosophic graphs, a set
of vertices excluding only two vertices and containing center, makes maximal
set. In complete-bipartite-neutrosophic graphs, a set of vertices excluding two
vertices from same parts makes intended set but with slightly differences, in
complete-t-partite-neutrosophic graphs, a set of vertices excluding two vertices
from same parts makes intended set. In both settings, some classes of well-known
neutrosophic graphs are studied. Some clarifications for each result and each
definition are provided. Using basic set not to extend this set to set of all vertices
has key role to have these notions in the form of failed zero-forcing number and
failed zero-forcing neutrosophic-number. The cardinality of a set has eligibility
to form failed zero-forcing number but the neutrosophic cardinality of a set
has eligibility to call failed zero-forcing neutrosophic-number. Some results get
more frameworks and perspective about these definitions. The way in that,
two vertices don’t have unique connection together, opens the way to do some
approaches. A vertex could affect on other vertex but there’s no usage of edges.
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. Some problems
are proposed to pursue this study. Basic familiarities with graph theory and
neutrosophic graph theory are proposed for this article.
In third chapter, there are some points as follow. New setting is introduced to
study 1-zero-forcing number, 1-zero-forcing neutrosophic-number, failed 1-zero-
forcing number and failed 1-zero-forcing neutrosophic-number arising operations
of different vertices. Leaf-like is a key term to have these notions. (Not) Forcing
a vertex to change its color is a type of approach to force that vertex to be
zero-like. (Not) Forcing a vertex which is only neighbor for zero-like vertex to
be zero-like vertex but now both settings leads to approach is on demand which
is finding biggest (smallest) set which doesn’t force. Let N T G : (V, E, σ, µ) be
a neutrosophic graph. Then 1-zero-forcing number Z(N T G) for a neutrosophic
graph N T G : (V, E, σ, µ) is minimum cardinality of a set S of black vertices
(whereas vertices in V (G) \ S are colored white) such that V (G) is turned black
after finitely many applications of “the color-change rule”: a white vertex is
converted to a black vertex if it is the only white neighbor of a black vertex.
The last condition is as follows. For one time, black can change any vertex from
white to black. 1-zero-forcing neutrosophic-number Zn (N T G) for a neutrosophic
graph N T G : (V, E, σ, µ) is minimum neutrosophic cardinality of a set S of
black vertices (whereas vertices in V (G) \ S are colored white) such that V (G)
is turned black after finitely many applications of “the color-change rule”: a
white vertex is converted to a black vertex if it is the only white neighbor of a
black vertex. The last condition is as follows. For one time, black can change
any vertex from white to black. Failed 1-zero-forcing number Z 0 (N T G) for a
neutrosophic graph N T G : (V, E, σ, µ) is maximum cardinality of a set S of
black vertices (whereas vertices in V (G) \ S are colored white) such that V (G)
isn’t turned black after finitely many applications of “the color-change rule”:
a white vertex is converted to a black vertex if it is the only white neighbor
of a black vertex. The last condition is as follows. For one time, Black can
change any vertex from white to black. The last condition is as follows. For one
time, black can change any vertex from white to black. Failed 1-zero-forcing
iii
Abstract
neutrosophic-number Zn0 (N T G) for a neutrosophic graph N T G : (V, E, σ, µ) is

maximum neutrosophic cardinality of a set S of black vertices (whereas vertices
in V (G) \ S are colored white) such that V (G) isn’t turned black after finitely
many applications of “the color-change rule”: a white vertex is converted to a
black vertex if it is the only white neighbor of a black vertex. The last condition
is as follows. For one time, Black can change any vertex from white to black. The
last condition is as follows. For one time, black can change any vertex from white
to black. 1-zero-forcing number, 1-zero-forcing neutrosophic-number, failed
1-zero-forcing number and failed 1-zero-forcing neutrosophic-number arising
operations of different vertices are about a set of vertices which are applied
neutrosophic graphs are investigated in the terms of maximal set minimal set
which form 1-zero-forcing number, 1-zero-forcing neutrosophic-number, failed
operations of different vertices. Neutrosophic number is reused in this way. It’s
applied to use the type of neutrosophic number in the way that, three values of
a vertex are used and they’ve same share to construct this number to compare
with other vertices. Summation of three values of vertex makes one number and
applying it to a comparison. This approach facilitates identifying vertices which
form 1-zero-forcing number, 1-zero-forcing neutrosophic-number, failed 1-zero-
of different vertices. In path-neutrosophic graphs, ∅ (1-set), forms maximal
(minimal) set but with slightly differences, in cycle-neutrosophic graphs, ∅ (1-set),
forms maximal (minimal) set. Other classes have same approaches. In complete-
neutrosophic graphs, a set of vertices excluding two (three) vertices leads us to
(failed) 1-zero-forcing number and (failed) 1-zero-forcing neutrosophic-number.
In star-neutrosophic graphs, a set of vertices excluding only two (three) vertices
and containing center, makes (maximal) minimal set. In complete-bipartite-
neutrosophic graphs, a set of vertices excluding three (four) vertices from (same)
different parts as possible makes intended set but with slightly differences, in
complete-t-partite-neutrosophic graphs, a set of vertices excluding three (four)
vertices from (same) different parts makes intended set. In both settings, some
classes of well-known neutrosophic graphs are studied. Some clarifications for
each result and each definition are provided. Using basic set (not) to extend
this set to set of all vertices has key role to have these notions in the form of
1-zero-forcing number, 1-zero-forcing neutrosophic-number, failed 1-zero-forcing
number and failed 1-zero-forcing neutrosophic-number arising operations of
different vertices. The cardinality of a set has eligibility to form (failed) 1-zero-
forcing number but the neutrosophic cardinality of a set has eligibility to call
(failed) 1-zero-forcing neutrosophic-number. Some results get more frameworks
and perspective about these definitions. The way in that, three vertices (don’t)
have unique connection amid each other, opens the way to do some approaches.
A vertex could affect on other vertex but there’s no usage of edges. These
notions are applied into neutrosophic graphs as individuals but not family of
them as drawbacks for these notions. Finding special neutrosophic graphs
iv
The following references are cited by chapters.
[Ref1] Henry Garrett, “Zero Forcing Number in Neutrosophic Graphs”,
ResearchGate 2022 (doi: 10.13140/RG.2.2.32265.93286).
[Ref2] Henry Garrett, “Failed Zero-Forcing Number in Neutrosophic Graphs”,
ResearchGate 2022 (doi: 10.13140/RG 2.2.24873.47209).
[Ref3] Henry Garrett, “Failed)1-Zero-Forcing Number in Neutrosophic Graphs”,
Three chapters are devised as “Common 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 xiii
1 Common Notions 1
1.1 Zero Forcing Number in Neutrosophic Graphs . . . . . . . . . 1
1.2 Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.3 Motivation and Contributions . . . . . . . . . . . . . . . . . . 2
1.4 Preliminaries . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
1.5 Setting of Neutrosophic Zero Forcing Number . . . . . . . . . 5
1.6 Setting of Zero Forcing Neutrosophic-Number . . . . . . . . . 16
1.7 Applications in Time Table and Scheduling . . . . . . . . . . . 27
1.8 Case 1: Star Model alongside its Zero Forcing Number and its
Zero Forcing Neutrosophic-Number . . . . . . . . . . . . . . . 28
1.9 Case 2: Cycle Model alongside its Zero Forcing Number and
its Zero Forcing Neutrosophic-Number . . . . . . . . . . . . . 30
1.10 Open Problems . . . . . . . . . . . . . . . . . . . . . . . . . . 32
1.11 Conclusion and Closing Remarks . . . . . . . . . . . . . . . . 33
2 Modified Notions 35
2.1 Failed Zero-Forcing Number in Neutrosophic Graphs . . . . . 35
2.2 Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35
2.4 Preliminaries . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37
2.5 Setting of Neutrosophic Failed Zero-Forcing Number . . . . . 40
2.6 Setting of Failed Zero-Forcing Neutrosophic-Number . . . . . 51
2.8 Case 1: Star Model alongside its Failed Zero-Forcing Number
and its Failed Zero-Forcing Neutrosophic-Number . . . . . . . 63
2.9 Case 2: Cycle Model alongside its Failed Zero-Forcing Number
and its Failed Zero-Forcing Neutrosophic-Number . . . . . . . 65
ix
Contents
2.10 Open Problems . . . . . . . . . . . . . . . . . . . . . . . . . . 67

3 Extended Notions 71
3.1 (Failed)1-Zero-Forcing Number in Neutrosophic Graphs . . . . 71
3.2 Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 71
3.4 Preliminaries . . . . . . . . . . . . . . . . . . . . . . . . . . . . 74
3.5 Setting of Neutrosophic 1-Zero-Forcing Number . . . . . . . . 78
3.6 Setting of 1-Zero-Forcing Neutrosophic-Number . . . . . . . . 89
3.7 Setting of Neutrosophic Failed 1-Zero-Forcing Number . . . . 101
3.8 Setting of Failed 1-Zero-Forcing Neutrosophic-Number . . . . 112
3.10 Case 1: Star Model alongside its 1-Zero-Forcing Number and
its 1-Zero-Forcing Neutrosophic-Number . . . . . . . . . . . . 124
3.11 Case 2: Star Model alongside its Failed 1-Zero-Forcing Number
and its Failed 1-Zero-Forcing Neutrosophic-Number . . . . . . 126
3.12 Open Problems . . . . . . . . . . . . . . . . . . . . . . . . . . 127
Bibliography 129
x
List of Figures
1.1 A Neutrosophic Graph in the Viewpoint of its Zero Forcing Number

and its Zero Forcing Neutrosophic-Number. . . . . . . . . . . . . . 6
1.2 A Neutrosophic Graph in the Viewpoint of its Zero Forcing Number. 7
1.11 A Neutrosophic Graph in the Viewpoint of its Zero Forcing
Neutrosophic-Number. . . . . . . . . . . . . . . . . . . . . . . . . . 20
2.1 A Neutrosophic Graph in the Viewpoint of its Failed Zero-Forcing

Number and its Failed Zero-Forcing Neutrosophic-Number. . . . . 40
xi
List of Figures

3.1 A Neutrosophic Graph in the Viewpoint of its 1-Zero-Forcing

Number and its 1-Zero-Forcing Neutrosophic-Number. . . . . . . . 77
3.2 A Neutrosophic Graph in the Viewpoint of its Failed 1-Zero-Forcing
Number and its Failed 1-Zero-Forcing Neutrosophic-Number. . . . 78
3.3 A Neutrosophic Graph in the Viewpoint of its 1-Zero-Forcing Number. 80
xii
List of Figures

Number. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 103
Number. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 105
Number. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 105
Number. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 107
Number. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 108
Number. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 109
Number. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 111
Number. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 112
xiii
List of Figures

Number and its 1-Zero-Forcing Neutrosophic-Number. . . . . . . . 124
xiv
List of Tables
1.1 Scheduling concerns its Subjects and its Connections as a neutro-

sophic graph and its alliances in a Model. . . . . . . . . . . . . . . 28
1.2 A Brief Overview about Advantages and Limitations of this study 33


xv
CHAPTER 1
Common Notions
The following sections are cited as [Ref1] which is my 47th manuscript and I
use prefix 47 as number before any labelling for items.
1.1 Zero Forcing Number in Neutrosophic Graphs
1.2 Abstract
New setting is introduced to study zero forcing number and zero forcing
neutrosophic-number. Leaf-like is a key term to have these notions. Let
N T G : (V, E, σ, µ) be a neutrosophic graph. Then zero forcing number Z(N T G)
for a neutrosophic graph N T G : (V, E, σ, µ) is minimum cardinality of a set S of
black vertices (whereas vertices in V (G) \ S are colored white) such that V (G) is
turned black after finitely many applications of “the color-change rule”: a white
vertex is converted to a black vertex if it is the only white neighbor of a black
vertex. Zero forcing neutrosophic-number Zn (N T G) for a neutrosophic graph
N T G : (V, E, σ, µ) is minimum neutrosophic cardinality of a set S of black
vertices (whereas vertices in V (G)\S are colored white) such that V (G) is turned
black after finitely many applications of “the color-change rule”: a white vertex is
converted to a black vertex if it is the only white neighbor of a black vertex. Zero
forcing number and zero forcing neutrosophic-number are about a set of vertices
which are applied into the setting of neutrosophic graphs. The structure of set
is studied and general results are obtained. Also, some classes of neutrosophic
graphs namely path-neutrosophic graphs, cycle-neutrosophic graphs, complete-
neutrosophic graphs, star-neutrosophic graphs, bipartite-neutrosophic graphs,
and t-partite-neutrosophic graphs are investigated in the terms of a minimal set
which forms both of zero forcing number and zero forcing neutrosophic-number.
Summation of three values of vertex makes one number and applying it to
a comparison. This approach facilitates identifying vertices which form zero
forcing number and zero forcing neutrosophic-number. In path-neutrosophic
graphs, a leaf forms minimal set but in cycle-neutrosophic graphs, two vertices
which are neighbors, forms minimal set. Other classes have same approaches. In
complete-neutrosophic graphs, a set of vertices excluding one vertex leads us to
zero forcing number and zero forcing neutrosophic-number. In star-neutrosophic
1
1. Common Notions
graphs , a set of vertices excluding center and other vertex makes minimal set. In
complete-bipartite-neutrosophic graphs, a set of vertices excluding two vertices
from different parts makes intended set but in complete-t-partite-neutrosophic
graphs, a set of vertices excluding one vertex makes intended set. In both
settings, some classes of well-known neutrosophic graphs are studied. Some
clarifications for each result and each definition are provided. Using basic set to
extend this set to set of all vertices has key role to have these notions in the form
of zero forcing number and zero forcing neutrosophic-number. The cardinality of
a set has eligibility to form zero forcing number but the neutrosophic cardinality
of a set has eligibility to call zero forcing neutrosophic-number. Some results get
more frameworks and perspective about these definitions. The way in that, two
vertices have unique connection together, opens the way to do some approaches.
Keywords: Zero Forcing Number, Set, Vertex
AMS Subject Classification: 05C17, 05C22, 05E45
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 “Zero
Forcing Number”, “Zero Forcing Neutrosophic-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. Unique connections amid two vertices
have key roles to assign zero forcing number and zero forcing neutrosophic-
number. Thus they’re used to define new ideas which conclude to the structure
zero forcing number and zero forcing neutrosophic-number. The concept of
having unique edge inspires us to study the behavior of vertices in the way
that, some types of numbers zero forcing number and zero forcing neutrosophic-
number. are the cases of study in the setting of individuals. In both settings, a
corresponded number 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 zero forcing number and zero forcing neutrosophic-number
are highlighted, are introduced and are clarified as individuals. In section
“Preliminaries”, sets of vertices have the key role in this way. General results
are obtained and also, the results about the basic notions of zero forcing
number and zero forcing neutrosophic-number are elicited. Some classes of
neutrosophic graphs are studied in the terms of neutrosophic zero forcing number,
in section “Setting of Neutrosophic Zero Forcing Number,” as individuals. In
2
1.4. Preliminaries
section “Setting of Neutrosophic Zero Forcing Number,”, neutrosophic zero

forcing 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 and complete-t-partite-neutrosophic graphs. The
clarifications are also presented in both sections “Setting of Neutrosophic Zero
Forcing Number,” and “Setting of Zero Forcing Neutrosophic-Number,” for
introduced results and used classes. In section “Applications in Time Table and
Scheduling”, two applications are posed for star-neutrosophic graphs and cycle-
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
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).
(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 S(N T G).
(vi) : Σe∈E Σ3i=1 µi (e) is called neutrosophic size of NTG and it’s denoted by
Sn (N T G).
3
1. Common Notions
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 vertices P : x0 , x1 , · · · , xO is called path where xi xi+1 ∈

E, i = 0, 1, · · · , n − 1;
V
(ii) : strength of path P : x0 , x1 , · · · , xO is i=0,··· ,n−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 vertices P : x0 , x1 , · · · , xO is called cycle where xi xi+1 ∈

E, i = 0, 1, · · · , V
n − 1 and there are two edges xy and uv such that
µ(xy) = µ(uv) = 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).
The main definition is presented in next section. The notions of quasi-

number and quasi-co-number facilitate the ground to introduce new results.
These notions will be applied on some classes of neutrosophic graphs in upcoming
sections and they separate the results in two different sections based on
introduced types.
Definition 1.4.4. (Zero Forcing Number).
Let N T G : (V, E, σ, µ) be a neutrosophic graph. Then
(i) Zero forcing number Z(N T G) for a neutrosophic graph N T G :

(V, E, σ, µ) is minimum cardinality of a set S of black vertices (whereas
vertices in V (G) \ S are colored white) such that V (G) is turned black
after finitely many applications of “the color-change rule”: a white vertex
is converted to a black vertex if it is the only white neighbor of a black
vertex.
4
1.5. Setting of Neutrosophic Zero Forcing Number
(ii) Zero forcing neutrosophic-number Zn (N T G) for a neutrosophic

graph N T G : (V, E, σ, µ) is minimum neutrosophic cardinality of a set S
of black vertices (whereas vertices in V (G) \ S are colored white) such that
V (G) is turned black after finitely many applications of “the color-change
rule”: a white vertex is converted to a black vertex if it is the only white
neighbor of a black vertex.
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.5. In Figure (1.1), a complete neutrosophic graph is illustrated.
Some points are represented in follow-up items as follows.
(i) if S = {n3 , n4 } is a set of black vertices, then n2 is white neighbor of n3
and n4 . Thus the color-change rule doesn’t imply n2 is black vertex. n1 is
white neighbor of n3 and n4 . Thus the color-change rule doesn’t imply n1
is black vertex. Thus n1 and n2 aren’t black vertices. Hence V (G) isn’t
turned black after finitely many applications of “the color-change rule”;
(ii) if S = {n2 , n3 , n4 } is a set of black vertices, then n1 is only white neighbor
of n2 . Thus the color-change rule implies n1 is black vertex. Thus n1 is
black vertex. Hence V (G) is turned black after finitely many applications
of “the color-change rule”;
(iii) if S = {n1 , n2 , n4 } is a set of black vertices, then n3 is only white neighbor
(iv) if S = {n1 , n3 , n4 } is a set of black vertices, then n2 is only white neighbor
(v) 3 is zero forcing number and its corresponded sets are {n1 , n2 , n3 }, {n1 , n2 , n4 },
{n1 , n3 , n4 }, and {n2 , n3 , n4 };
(vi) 3.9 is zero forcing neutrosophic-number and its corresponded set is
{n1 , n3 , n4 }.
1.5 Setting of Neutrosophic Zero Forcing Number

In this section, I provide some results in the setting of neutrosophic
zero forcing number. Some classes of neutrosophic graphs are chosen.
Complete-neutrosophic graph, path-neutrosophic graph, cycle-neutrosophic
graph, and star-neutrosophic graph, bipartite-neutrosophic graph, and t-partite-
neutrosophic graph are both of cases of study and classes which the results are
about them.
5
1. Common Notions
Figure 1.1: A Neutrosophic Graph in the Viewpoint of its Zero Forcing Number
and its Zero Forcing Neutrosophic-Number. 47NTG1
In next result, a complete-neutrosophic graph is considered in the way that,

its neutrosophic zero forcing number and its zero forcing neutrosophic-number
this model are computed. A complete-neutrosophic graph has specific attribute
which implies every vertex is neighbor to all other vertices in the way that, two
given vertices have edge is incident to these endpoints.
Proposition 1.5.1. Let N T G : (V, E, σ, µ) be a complete-neutrosophic graph.
Then
Z(N T G) = O(N T G) − 1.
Proof. Suppose N T G : (V, E, σ, µ) is a complete-neutrosophic graph. Every

vertex is a neighbor for every given vertex. Assume |S| > 2. If S is a set of
black vertices and S < O(N T G) − 1, then there are x and y such that they’ve
more than one neighbor in S. Thus the color-change rule doesn’t imply these
vertices are black vertices. Hence V (G) isn’t turned black after finitely many
applications of “the color-change rule”. So
Z(N T G) = O(N T G) − 1.
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.

6
Figure 1.2: A Neutrosophic Graph in the Viewpoint of its Zero Forcing Number. 47NTG2



{n1 , n3 , n4 }, and {n2 , n3 , n4 };

{n1 , n3 , n4 }.
In next result, a path-neutrosophic graph is considered and zero forcing

number and its zero forcing neutrosophic-number of this model are computed for
a leaf in specific case. Precisely, inequality is proposed for quasi-number in next
result where being leaf-like and having its unique edge are key hypotheses. The
set of black forms zero forcing number and its zero forcing neutrosophic-number.
Proposition 1.5.3. Let N T G : (V, E, σ, µ) be a path-neutrosophic graph. Then
Z(N T G) = 1.
Proof. Suppose N T G : (V, E, σ, µ) is a path-neutrosophic graph. Every non-leaf

vertex is a neighbor for two vertices. A leaf is only member of S is a set of
black vertices. Thus the color-change rule implies all vertices are black vertices.
Hence V (G) is turned black after finitely many applications of “the color-change
rule”. So
Z(N T G) = 1.

7
1. Common Notions
In next part, one odd-path-neutrosophic graph is depicted. Zero forcing

number and its zero forcing neutrosophic-number are computed. In next part,
one even-path-neutrosophic graph is applied to compute its zero forcing number
and its zero forcing neutrosophic-number, too.
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.
(i) if S = {n3 , n4 } is a set of black vertices, then n2 is only white

neighbor of n3 and n5 is only white neighbor of n4 . Thus the color-
change rule implies n2 is black vertex and after that n1 is only white
neighbor of n2 . Thus the color-change rule implies n1 is black vertex.
In other side, n5 is only white neighbor of n4 . Thus the color-change
rule implies n5 is black vertex and after that n6 is only white neighbor
of n5 . Thus the color-change rule implies n6 is black vertex. Thus
n1 , n2 , n5 and n6 are black vertices. Hence V (G) is turned black
after finitely many applications of “the color-change rule”;
(ii) if S = {n3 , n4 , n5 } is a set of black vertices, then n2 is only white
Thus n1 and n2 are black vertices. Hence V (G) is turned black after
finitely many applications of “the color-change rule”;
(iii) if S = {n2 } is a set of black vertices, then n1 and n3 are only white
neighbor of n2 . Thus the color-change rule doesn’t imply n1 and n3
are black vertices. Hence V (G) isn’t turned black after finitely many
applications of “the color-change rule”;
(iv) if S = {n1 } is a set of black vertices, then n2 is only white neighbor
of n1 . Thus the color-change rule implies n2 is black vertex and after
that n3 is only white neighbor of n2 . Thus the color-change rule
implies n3 is black vertex after that n4 is only white neighbor of n3 .
Thus the color-change rule implies n4 is black vertex after that n5 is
only white neighbor of n4 . Thus the color-change rule implies n5 is
black vertex. Thus n2 , n3 , n4 and n5 are black vertices. Hence V (G)
is turned black after finitely many applications of “the color-change
rule”;
(v) 1 is zero forcing number and its corresponded sets are {n1 }, and
{n5 };
{n1 }.
(b) In Figure (1.4), an even-path-neutrosophic graph is illustrated. Some


8

rule implies n5 is black vertex. Thus n1 , n2 and n6 are black vertices.
Hence V (G) is turned black after finitely many applications of “the
color-change rule”;
Thus the color-change rule implies n4 is black vertex after that n5
is only white neighbor of n4 . Thus the color-change rule implies n5
is black vertex after that n6 is only white neighbor of n5 . Thus the
color-change rule implies n6 is black vertex. Thus n2 , n3 , n4 , n5 and
n6 are black vertices. Hence V (G) is turned black after finitely many
{n6 };
{n1 }.
The set of vertices forms zero forcing number and its zero forcing
neutrosophic-number.
9
1. Common Notions
Proposition 1.5.5. Let N T G : (V, E, σ, µ) be a cycle-neutrosophic graph. Then
Z(N T G) = 2.
Proof. Suppose N T G : (V, E, σ, µ) is a cycle-neutrosophic graph. Every vertex

is a neighbor for two vertices. Two vertices which are neighbors, are only
members of S is a set of black vertices. Thus the color-change rule implies
all vertices are black vertices. Hence V (G) is turned black after finitely many
Z(N T G) = 2.
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


10

(iv) if S = {n1 } is a set of black vertices, then n2 and n6 are only white
(v) 2 is zero forcing number and its corresponded sets are
{n1 , n2 },{n1 , n3 },
{n1 , n4 },{n1 , n5 },{n1 , n6 },{n2 , n3 },
{n2 , n4 },{n2 , n5 },{n2 , n6 },{n3 , n4 },
{n3 , n5 },{n3 , n6 },
{n4 , n5 },{n4 , n6 }, and
{n5 , n6 };
{n1 , n5 }.
(b) In Figure (1.6), an odd-cycle-neutrosophic graph is illustrated. Some
neighbor of n3 . Thus the color-change rule implies n2 is black vertex
and after that n1 is only white neighbor of n2 . Thus the color-change
rule implies n1 is black vertex. Thus n1 and n2 are black vertices.
11
1. Common Notions
{n1 , n2 },{n1 , n3 },
{n1 , n4 },{n1 , n5 },
{n2 , n3 },{n2 , n4 },
{n2 , n5 },{n3 , n4 },
{n3 , n5 }, and {n4 , n5 };
{n1 , n5 }.
Proposition 1.5.7. Let N T G : (V, E, σ, µ) be a star-neutrosophic graph with

center c. Then
Z(N T G) = O(N T G) − 2.
Proof. Suppose N T G : (V, E, σ, µ) is a star-neutrosophic graph. Every vertex is

a neighbor for center. Furthermore, center is only neighbor for any given vertex.
So center is only neighbor for all vertices. Hence all vertices excluding center
and other vertex are only members of S is a set of black vertices. Thus the
12
color-change rule implies all vertices are black vertices. Hence V (G) is turned
black after finitely many applications of “the color-change rule”. So
Z(N T G) = O(N T G) − 2.
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.
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.
(i) if S = {n2 , n3 , n4 , n5 } is a set of black vertices, then n1 is only white

Thus n1 are black vertex. Hence V (G) is turned black after finitely many

of n3 . Thus the color-change rule implies n1 is black vertex and after that
n2 is only white neighbor of n1 . Thus the color-change rule implies n2 is
black vertex. Thus n1 and n2 are black vertices. Hence V (G) is turned
black after finitely many applications of “the color-change rule”;
(iii) if S = {n1 , n4 , n5 } is a set of black vertices, then n2 and n3 are white

neighbors of n1 . Thus the color-change rule doesn’t imply n2 and n3

(v) 3 is zero forcing number and its corresponded sets are {n1 , n2 , n3 },{n1 , n2 , n4 },
{n1 , n2 , n5 },{n1 , n3 , n4 },
{n1 , n3 , n5 },{n1 , n4 , n5 },
{n2 , n3 , n4 },{n2 , n3 , n5 },
and {n3 , n4 , n5 };

{n2 , n3 , n5 }.
Proposition 1.5.9. Let N T G : (V, E, σ, µ) be a bipartite-neutrosophic graph.

Then
Z(N T G) = O(N T G) − 2.
13
1. Common Notions
Proof. Suppose N T G : (V, E, σ, µ) is a bipartite-neutrosophic graph. Every

vertex is a neighbor for all vertices in another part. Hence all vertices excluding
two vertices from different parts are only member of S is a set of black vertices.
Thus the color-change rule implies all vertices are black vertices. Hence V (G)
is turned black after finitely many applications of “the color-change rule”. So
Z(N T G) = O(N T G) − 2.
The clarifications about results are in progress as follows. A bipartite-

about new notions. A bipartite-neutrosophic graph is related to previous result
Example 1.5.10. There is one section for clarifications. In Figure (1.8), a
bipartite-neutrosophic graph is illustrated. Some points are represented in
follow-up items as follows.
(i) if S = {n1 , n3 } is a set of black vertices, then n2 is only white neighbor

of n1 . Thus the color-change rule implies n2 is black vertex. In other side,
(ii) if S = {n1 , n2 } is a set of black vertices, then n3 is only white neighbor

(iii) if S = {n1 , n4 } is a set of black vertices, then n2 and n3 are white neighbors
of n1 and n4 , simultaneously. Thus the color-change rule doesn’t imply
n2 and n3 are black vertices. Hence V (G) isn’t turned black after finitely
many applications of “the color-change rule”;
14
(iv) if S = {n2 , n4 } is a set of black vertices, then n3 is only white neighbor

(v) 2 is zero forcing number and its corresponded sets are {n1 , n2 },{n1 , n3 },
{n4 , n2 }, and {n4 , n3 };
{n2 , n4 }.
Proposition 1.5.11. Let N T G : (V, E, σ, µ) be an t-partite-neutrosophic graph

such that t 6= 2. Then
Z(N T G) = O(N T G) − 1.
Proof. Suppose N T G : (V, E, σ, µ) is a t-partite-neutrosophic graph. Every
one vertex is only member of S is a set of black vertices. Thus the color-change
rule implies all vertices are black vertices. Hence V (G) is turned black after
finitely many applications of “the color-change rule”. So
Z(N T G) = O(N T G) − 1.

The clarifications about results are in progress as follows. A t-partite-
about new notions. A t-partite-neutrosophic graph is related to previous result
t-partite-neutrosophic graph is illustrated. Some points are represented in
15
1. Common Notions
(i) if S = {n1 , n3 , n5 } is a set of black vertices, then n2 is only white neighbor



neighbors of n1 and n4 , simultaneously. Thus the color-change rule doesn’t
imply n2 and n3 are black vertices. Hence V (G) isn’t turned black after

{n1 , n2 , n3 },{n4 , n2 , n5 },
{n4 , n3 , n5 }, and {n4 , n2 , n3 };

{n2 , n4 , n5 }.
1.6 Setting of Zero Forcing Neutrosophic-Number

In this section, I provide some results in the setting of zero forcing
neutrosophic-number. Some classes of neutrosophic graphs are chosen.
16
1.6. Setting of Zero Forcing Neutrosophic-Number

about them.
its neutrosophic zero forcing number and its zero forcing neutrosophic-number
Then
Zn (N T G) = On (N T G) − max{Σ3i=1 σi (x)}x∈V .






17
1. Common Notions
{n1 , n3 , n4 }, and {n2 , n3 , n4 };
{n1 , n3 , n4 }.
Zn (N T G) = min{Σ3i=1 σi (x)}x is a leaf .

vertex is a neighbor for two vertices. A leaf is only member of S is a set of
black vertices. Thus the color-change rule implies all vertices are black vertices.
Hence V (G) is turned black after finitely many applications of “the color-change
rule”. So
Zn (N T G) = min{Σ3i=1 σi (x)}x is a leaf .

In next part, one odd-path-neutrosophic graph is depicted. Zero forcing

number and its zero forcing neutrosophic-number are computed. In next part,
one even-path-neutrosophic graph is applied to compute its zero forcing number
and its zero forcing neutrosophic-number, too.
18

rule”;
{n5 };
{n1 }.


19
1. Common Notions
Figure 1.11: A Neutrosophic Graph in the Viewpoint of its Zero Forcing

Neutrosophic-Number. 47NTG11

{n6 };
{n1 }.
20
Zn (N T G) = min{Σ3i=1 σi (x) + Σ3i=1 σi (y)}xy∈E. .

members of S is a set of black vertices. Thus the color-change rule implies
Zn (N T G) = min{Σ3i=1 σi (x) + Σ3i=1 σi (y)}xy∈E. .



21
1. Common Notions
{n1 , n2 },{n1 , n3 },
{n1 , n4 },{n1 , n5 },{n1 , n6 },{n2 , n3 },
{n2 , n4 },{n2 , n5 },{n2 , n6 },{n3 , n4 },
{n3 , n5 },
{n3 , n6 },
{n4 , n5 },{n4 , n6 }, and
{n5 , n6 };
{n1 , n5 }.


{n1 , n2 },{n1 , n3 },
{n1 , n4 },{n1 , n5 },
{n2 , n3 },{n2 , n4 },
{n2 , n5 },{n3 , n4 },
{n3 , n5 }, and {n4 , n5 };
{n1 , n5 }.
22



center c. Then
Zn (N T G) = On (N T G) − max{Σ3i=1 σi (c) + Σ3i=1 σi (x)}x∈V .
Proof. Suppose N T G : (V, E, σ, µ) is a star-neutrosophic graph. Every vertex is

a neighbor for center. Furthermore, center is only neighbor for any given vertex.
So center is only neighbor for all vertices. Hence all vertices excluding center
and other vertexare only members of S is a set of black vertices. Thus the
color-change rule implies all vertices are black vertices. Hence V (G) is turned
black after finitely many applications of “the color-change rule”. So
Zn (N T G) = On (N T G) − max{Σ3i=1 σi (c) + Σ3i=1 σi (x)}x∈V .

23
1. Common Notions
items as follows.




{n1 , n2 , n5 },{n1 , n3 , n4 },
{n1 , n3 , n5 },{n1 , n4 , n5 },{n2 , n3 , n4 },
{n2 , n3 , n5 }, and {n3 , n4 , n5 };

{n2 , n3 , n5 }.

Then
Zn (N T G) = On (N T G) − max{Σ3i=1 σi (x) + Σ3i=1 σi (x0 )}x,x0 ∈V .

two vertices from different parts are only member of S is a set of black vertices.
Thus the color-change rule implies all vertices are black vertices. Hence V (G)
is turned black after finitely many applications of “the color-change rule”. So
24





(v) 2 is zero forcing number and its corresponded sets are {n1 , n2 },{n1 , n3 },
{n4 , n2 }, and {n4 , n3 };
25
1. Common Notions


{n2 , n4 }.
Proposition 1.6.11. Let N T G : (V, E, σ, µ) be a t-partite-neutrosophic graph


one vertex is only member of S is a set of black vertices. Thus the color-change
rule implies all vertices are black vertices. Hence V (G) is turned black after
finitely many applications of “the color-change rule”. So


26
1.7. Applications in Time Table and Scheduling



neighbors of n1 and n4 , simultaneously. Thus the color-change rule doesn’t
imply n2 and n3 are black vertices. Hence V (G) isn’t turned black after

{n1 , n2 , n3 },{n4 , n2 , n5 },
{n4 , n3 , n5 }, and {n4 , n2 , n3 };

{n2 , n4 , n5 }.
1.7 Applications in Time Table and Scheduling

In this section, two applications for time table and scheduling are provided
where the models aren’t complete models which mean complete connections are
formed as individual and family of 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
27
1. Common Notions
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 (3.1), clarifies about the
assigned numbers to these situations.
Table 1.1: Scheduling concerns its Subjects and its Connections as a neutrosophic
graph and its alliances in a Model. tbl1c
Sections of N T G n1 n2 · · · n5
Values (0.7, 0.9, 0.3) (0.4, 0.2, 0.8)· · · (0.3, 0.4, 0.3)
Connections of N T G E1 E2 · · · E4
Values (0.4, 0.2, 0.3) (0.5, 0.2, 0.3)· · · (0.3, 0.4, 0.3)
1.8 Case 1: Star Model alongside its Zero Forcing

Number and its Zero Forcing Neutrosophic-Number
Step 4. (Solution) The neutrosophic graph alongside its zero forcing number
and its zero forcing neutrosophic-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 some
connections as possible. Using the notion of strong on the connection
28
1.9. Case 2: Cycle Model alongside its Zero Forcing Number and its Zero
Forcing Neutrosophic-Number
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 zero forcing 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.18). This model is strong.
And the study proposes using specific number which is called zero forcing
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.18). In Figure (1.18), an star-neutrosophic graph is
illustrated. Some points are represented in follow-up items as follows.

Thus n1 are black vertex. Hence V (G) is turned black after finitely


(iv) if S = {n2 , n3 , n5 } is a set of black vertices, then n1 is only white


{n1 , n2 , n3 },{n1 , n2 , n4 },
{n1 , n2 , n5 },{n1 , n3 , n4 },
{n1 , n3 , n5 },{n1 , n4 , n5 },
{n2 , n3 , n4 },{n2 , n3 , n5 },
and {n3 , n4 , n5 };

{n2 , n3 , n5 }.
29
1. Common Notions
1.9 Case 2: Cycle Model alongside its Zero Forcing

Number and its Zero Forcing Neutrosophic-Number
Step 4. (Solution) The neutrosophic graph alongside its zero forcing number
and its zero forcing neutrosophic-number as model, propose to use specific
number. Every subject has connection with every given subject in
deemed way. Thus the connection is 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 holds for other types such
that star, wheel, path, and cycle. The collection of situations is another
application of zero forcing number and zero forcing neutrosophic-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 six
subjects and five subjects which are represented in the formation of two
30
1.9. Case 2: Cycle Model alongside its Zero Forcing Number and its Zero
Forcing Neutrosophic-Number
models as Figures (1.19), (1.20). These models are neutrosophic strong
as individual. And the study proposes using specific number which is
called zero forcing number and zero forcing neutrosophic-number for these
models. 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
Figures (1.19), (1.20). There is one section for clarifications.
(a) In Figure (1.19), an even-cycle-neutrosophic graph is illustrated.
neighbor of n3 and n5 is only white neighbor of n4 . Thus the
color-change rule implies n2 is black vertex and after that n1 is
only white neighbor of n2 . Thus the color-change rule implies
n1 is black vertex. In other side, n5 is only white neighbor
of n4 . Thus the color-change rule implies n5 is black vertex
and after that n6 is only white neighbor of n5 . Thus the color-
change rule implies n6 is black vertex. Thus n1 , n2 , n5 and n6
are black vertices. Hence V (G) is turned black after finitely
n1 is black vertex. In other side, n6 is only white neighbor of
n5 . Thus the color-change rule implies n6 is black vertex. Thus
n1 , n2 and n6 are black vertices. Hence V (G) is turned black
(iii) if S = {n2 } is a set of black vertices, then n1 and n3 are only
white neighbor of n2 . Thus the color-change rule doesn’t imply
n1 and n3 are black vertices. Hence V (G) isn’t turned black
(iv) if S = {n1 } is a set of black vertices, then n2 and n6 are only
{n1 , n2 },{n1 , n3 },
{n1 , n4 },{n1 , n5 },{n1 , n6 },{n2 , n3 },
{n2 , n4 },{n2 , n5 },{n2 , n6 },{n3 , n4 },
{n3 , n5 },{n3 , n6 },
{n4 , n5 },{n4 , n6 }, and
{n5 , n6 };
(vi) 1.3 is zero forcing neutrosophic-number and its corresponded set
is {n1 , n5 }.
31
1. Common Notions

neighbor of n3 . Thus the color-change rule implies n2 is black
vertex and after that n1 is only white neighbor of n2 . Thus the
color-change rule implies n1 is black vertex. Thus n1 and n2 are
black vertices. Hence V (G) is turned black after finitely many
(iii) if S = {n2 } is a set of black vertices, then n1 and n3 are only
{n1 , n2 },{n1 , n3 },
{n1 , n4 },{n1 , n5 },
{n2 , n3 },{n2 , n4 },
{n2 , n5 },{n3 , n4 },
{n3 , n5 }, and {n4 , n5 };
(vi) 2.7 is zero forcing neutrosophic-number and its corresponded set
is {n1 , n5 }.
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 zero forcing number and zero forcing neutrosophic-number
are defined in neutrosophic graphs. Neutrosophic number is also reused. Thus,
Question 1.10.1. Is it possible to use other types zero forcing number and zero
forcing neutrosophic-number arising from operations of different vertice to define
new zero forcing number and zero forcing neutrosophic-number?
Question 1.10.2. Are existed some connections amid different types of zero
forcing number and zero forcing neutrosophic-number in neutrosophic graphs?
Question 1.10.3. Is it possible to construct some classes of which have “nice”
behavior?
Question 1.10.4. Which mathematical notions do make an independent study
to apply these types in neutrosophic graphs?
32
1.11. Conclusion and Closing Remarks
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.
This study uses two definition concerning zero forcing number and zero
forcing neutrosophic-number arising operations of different vertices to study
neutrosophic graphs. New neutrosophic number is reused which is too close
to the notion of neutrosophic number but it’s different since it uses all values
as type-summation on them. Comparisons amid number and edges are done
by using neutrosophic tool. The connections of vertices which are clarified by
unique edges differ them from each other and put them in different categories to
Table 1.2: A Brief Overview about Advantages and Limitations of this study tbl2c
Advantages Limitations
1. Defining Zero Forcing Number 1. Wheel-Neutrosophic Graphs
2. Defining Zero Forcing Neutrosophic-Number
3. Study on Classes 2. Study on Families
4. Using Operations of Vertices
5. Using Unique Edges 3. Same Models in Family
represent a number which its value is called either zero forcing number or forms
zero forcing neutrosophic-number. 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.
33
CHAPTER 2
Modified Notions
2.1 Failed Zero-Forcing Number in Neutrosophic Graphs
2.2 Abstract
New setting is introduced to study failed zero-forcing number and failed zero-
forcing neutrosophic-number. Leaf-like is a key term to have these notions.
Forcing a vertex to change its color is a type of approach to force that vertex to
be zero-like. Forcing a vertex which is only neighbor for zero-like vertex to be
zero-like vertex but now reverse approach is on demand which is finding biggest
set which doesn’t force. Let N T G : (V, E, σ, µ) be a neutrosophic graph. Then
failed zero-forcing number Z(N T G) for a neutrosophic graph N T G : (V, E, σ, µ)
is maximal cardinality of a set S of black vertices (whereas vertices in V (G)\S are
colored white) such that V (G) isn’t turned black after finitely many applications
of “the color-change rule”: a white vertex is converted to a black vertex if it is the
only white neighbor of a black vertex. Failed zero-forcing neutrosophic-number
Zn (N T G) for a neutrosophic graph N T G : (V, E, σ, µ) is maximal neutrosophic
white) such that V (G) isn’t turned black after finitely many applications of
“the color-change rule”: a white vertex is converted to a black vertex if it is the
only white neighbor of a black vertex. Failed zero-forcing number and failed
zero-forcing neutrosophic-number are about a set of vertices which are applied
neutrosophic graphs are investigated in the terms of maximal set which forms
both of failed zero-forcing number and failed zero-forcing neutrosophic-number.
Summation of three values of vertex makes one number and applying it to a
comparison. This approach facilitates identifying vertices which form failed
zero-forcing number and failed zero-forcing neutrosophic-number. In path-
35
2. Modified Notions
neutrosophic graphs, the set of vertices such that every given two vertices
in the set, have distance at least two, forms maximal set but with slightly
differences, in cycle-neutrosophic graphs, the set of vertices such that every
given two vertices in the set, have distance at least two, forms maximal set.
Other classes have same approaches. In complete-neutrosophic graphs, a set
of vertices excluding two vertices leads us to failed zero-forcing number and
failed zero-forcing neutrosophic-number. In star-neutrosophic graphs, a set
of vertices excluding only two vertices and containing center, makes maximal
set. In complete-bipartite-neutrosophic graphs, a set of vertices excluding two
vertices from same parts makes intended set but with slightly differences, in
complete-t-partite-neutrosophic graphs, a set of vertices excluding two vertices
from same parts makes intended set. In both settings, some classes of well-known
neutrosophic graphs are studied. Some clarifications for each result and each
definition are provided. Using basic set not to extend this set to set of all vertices
has key role to have these notions in the form of failed zero-forcing number and
failed zero-forcing neutrosophic-number. The cardinality of a set has eligibility
to form failed zero-forcing number but the neutrosophic cardinality of a set
has eligibility to call failed zero-forcing neutrosophic-number. Some results get
more frameworks and perspective about these definitions. The way in that,
two vertices don’t have unique connection together, opens the way to do some
approaches. A vertex could affect on other vertex but there’s no usage of edges.
These notions are applied into neutrosophic graphs as individuals but not family
of them as drawbacks for these notions. Finding special neutrosophic graphs
Keywords: Failed Zero-Forcing Number, Maximal Set, Vertex

Question 2.3.1. Is it possible to use mixed versions of ideas concerning
“Failed Zero-Forcing Number”, “Failed Zero-Forcing Neutrosophic-Number” and
“Neutrosophic Graph” to define some notions which are applied to neutrosophic
graphs?
which lead to be considered as motivation. Unique connections amid two
vertices have key roles to assign failed zero-forcing number and failed zero-
forcing neutrosophic-number. Thus they’re used to define new ideas which
conclude to the structure failed zero-forcing number and failed zero-forcing
neutrosophic-number. The concept of not having unique edge inspires us to
study the behavior of vertices in the way that, some types of numbers, failed
zero-forcing number and failed zero-forcing neutrosophic-number are the cases
of study in the setting of individuals. In both settings, a corresponded number
concludes the discussion. Also, there are some avenues to extend these notions.
36
2.4. Preliminaries
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 failed zero-forcing number and failed zero-forcing neutrosophic-
number are highlighted, are introduced and are clarified as individuals. In
section “Preliminaries”, sets of vertices have the key role in this way. General
results are obtained and also, the results about the basic notions of failed
zero-forcing number and zero forcing neutrosophic-number are elicited. Some
classes of neutrosophic graphs are studied in the terms of neutrosophic failed
zero-forcing number, in section “Setting of Neutrosophic Failed Zero-Forcing
Number,” as individuals. In section “Setting of Neutrosophic Failed Zero-
Forcing Number,”, neutrosophic failed zero-forcing number is applied into
individuals. As concluding results, there are some statements, remarks,
examples and clarifications about some classes of neutrosophic graphs namely
graphs, star-neutrosophic graphs, complete-bipartite-neutrosophic graphs and
complete-t-partite-neutrosophic graphs. The clarifications are also presented
in both sections “Setting of Neutrosophic Failed Zero-Forcing Number,” and
“Setting of Failed Zero-Forcing Neutrosophic-Number,” for introduced results
and used classes. In section “Applications in Time Table and Scheduling”,
two applications are posed for star-neutrosophic graphs and cycle-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.
2.4 Preliminaries
model.
µ(vi vj ) ≤ σ(vi ) ∧ σ(vj ).
37
2. Modified Notions

On (N T G).
Sn (N T G).
about them.
E, i = 0, 1, · · · , n − 1;
V
_ ^
µ∞ (x0 , xt ) = µ(xi xi+1 );
P :x0 ,x1 ,··· ,xt i=0,··· ,t−1

E, i = 0, 1, · · · , V
µ(xy) = µ(uv) = i=0,1,··· ,n−1 µ(vi vi+1 );
s
The main definition is presented in next section. The notions of failed
zero-forcing number and failed zero-forcing neutrosophic-number facilitate the
ground to introduce new results. These notions will be applied on some classes
of neutrosophic graphs in upcoming sections and they separate the results in
two different sections based on introduced types. New setting is introduced to
study failed zero-forcing number and failed zero-forcing neutrosophic-number.
approach is on demand which is finding biggest set which doesn’t force.
38
2.4. Preliminaries
Definition 2.4.4. (Failed Zero-Forcing Number).

(i) Failed zero-forcing number Z 0 (N T G) for a neutrosophic graph N T G :

(V, E, σ, µ) is maximum cardinality of a set S of black vertices (whereas
vertices in V (G) \ S are colored white) such that V (G) isn’t turned black
vertex.
(ii) Failed zero-forcing neutrosophic-number Zn0 (N T G) for a neutro-

sophic graph N T G : (V, E, σ, µ) is maximum neutrosophic cardinality of
a set S of black vertices (whereas vertices in V (G) \ S are colored white)
color-change rule”: a white vertex is converted to a black vertex if it is
the only white neighbor of a black vertex.

matters of mind.

turned black after finitely many applications of “the color-change rule”.
Thus S = {n3 , n4 } could form failed zero-forcing number;



(v) 2 is failed zero-forcing number and its corresponded sets are

{n1 , n2 }, {n1 , n3 },
{n1 , n4 }, {n2 , n3 },{n2 , n4 }, and {n3 , n4 };
39
2. Modified Notions
Figure 2.1: A Neutrosophic Graph in the Viewpoint of its Failed Zero-Forcing

Number and its Failed Zero-Forcing Neutrosophic-Number. 48NTG1
(vi) 3.6 is failed zero-forcing neutrosophic-number and its corresponded set is

{n1 , n2 }.
2.5 Setting of Neutrosophic Failed Zero-Forcing Number

In this section, I provide some results in the setting of neutrosophic failed
zero-forcing number. Some classes of neutrosophic graphs are chosen.
about them.
In next result, a complete-neutrosophic graph is considered in the way that, its
neutrosophic failed zero-forcing number and its failed zero-forcing neutrosophic-
number this model are computed. A complete-neutrosophic graph has specific
attribute which implies every vertex is neighbor to all other vertices in the way
that, two given vertices have edge is incident to these endpoints.
Then
Z 0 (N T G) = O(N T G) − 2.

Z 0 (N T G) = O(N T G) − 2.

40
2.5. Setting of Neutrosophic Failed Zero-Forcing Number

{n1 , n2 }, {n1 , n3 },
{n1 , n4 }, {n2 , n3 },{n2 , n4 }, and {n3 , n4 };
{n1 , n2 }.
In next result, a path-neutrosophic graph is considered and failed zero-
forcing number and its failed zero-forcing neutrosophic-number of this model
are computed for a leaf in specific case. In next result where being leaf-like
41
2. Modified Notions
and having its unique edge are key hypotheses, the set of black forms failed
zero-forcing number and its failed zero-forcing neutrosophic-number.
O(N T G)
Z 0 (N T G) = b c.
2

vertex is a neighbor for two vertices. Non-leaf vertices with distance two, are
only members of S is a maximal set of black vertices which doesn’t force. Thus
the color-change rule doesn’t imply all vertices are black vertices. Hence V (G)
isn’t turned black after finitely many applications of “the color-change rule”. So
O(N T G)
Z 0 (N T G) = b c.
2

In next part, one odd-path-neutrosophic graph is depicted. Failed zero-

forcing number and its failed zero-forcing neutrosophic-number are computed.
In next part, one even-path-neutrosophic graph is applied to compute its failed
zero-forcing number and its failed zero-forcing neutrosophic-number, too.


(iii) if S = {n2 , n4 } is a set of black vertices, then n1 and n3 are only
white neighbor of n2 . Thus the color-change rule doesn’t imply n1
and n3 are black vertices. In other side, n5 and n3 are only white
applications of “the color-change rule”. Thus S = {n2 , n4 } could
form failed zero-forcing number;
42

rule”;
(v) 2 is failed zero-forcing number and its corresponded set is {n2 , n4 };
(vi) 3 is failed zero-forcing neutrosophic-number and its corresponded set
is {n2 , n4 }.
43
2. Modified Notions


(v) 2 is failed zero-forcing number and its corresponded sets are {n2 , n4 },
and {n3 , n5 };
(vi) 3.4 is failed zero-forcing neutrosophic-number and its corresponded
set is {n3 , n5 }.
The set of vertices forms failed zero-forcing number and its failed zero-forcing
O(N T G)
Z 0 (N T G) = b c.
2
is a neighbor for two vertices. Vertices with distance two, are only members of
S is a maximal set of black vertices which doesn’t force. Thus the color-change
rule doesn’t imply all vertices are black vertices. Hence V (G) isn’t turned black
after finitely many applications of “the color-change rule”. So
O(N T G)
Z 0 (N T G) = b c.
2
44

(iii) if S = {n2 , n4 , n6 } is a set of black vertices, then n1 and n3 are
only white neighbors of n2 . Thus the color-change rule doesn’t imply
n1 and n3 are black vertices. In other view, n5 and n3 are only
white neighbors of n4 . Thus the color-change rule doesn’t imply n5
and n3 are black vertices. In last view, n5 and n4 are only white
applications of “the color-change rule”. Thus S = {n2 , n4 , n6 } could
{n2 , n4 , n6 } and {n1 , n3 , n5 };
set is {n2 , n4 , n6 }.
45
2. Modified Notions

{n3 , n5 },
{n2 , n5 }, {n4 , n1 },
and {n1 , n3 };
set is {n1 , n3 }.

center c. Then
Z 0 (N T G) = O(N T G) − 2.
Proof. Suppose N T G : (V, E, σ, µ) is a star-neutrosophic graph. Every vertex

is a neighbor for center. Furthermore, center is only neighbor for any given
vertex. So center is only neighbor for all vertices. Hence all vertices excluding
two vertices but containing center are only members of S is a maximal set of
black vertices which doesn’t force. Thus the color-change rule doesn’t imply all
Z 0 (N T G) = O(N T G) − 2.
46



items as follows.


47
2. Modified Notions


are black vertices. n1 is only white neighbor of n4 but n1 ∈ S. Thus
the color-change rule doesn’t imply n1 is black vertex. n1 is only white
neighbor of n5 but n1 ∈ S. Thus the color-change rule doesn’t imply
n1 is black vertex. Hence V (G) isn’t turned black after finitely many
applications of “the color-change rule”. Thus S = {n1 , n4 , n5 } could form
failed zero-forcing number;


{n1 , n2 , n3 },{n1 , n2 , n4 },
{n1 , n2 , n5 },{n1 , n3 , n4 },
{n1 , n3 , n5 }, and {n1 , n4 , n5 };

{n1 , n3 , n4 }.

Then
Z 0 (N T G) = O(N T G) − 2.

two vertices from same parts are only members of S is a maximal set of black
vertices which doesn’t force. Thus the color-change rule doesn’t imply all
48
Z 0 (N T G) = O(N T G) − 2.



many applications of “the color-change rule”. Thus S = {n1 , n4 } could

(v) 2 is failed zero-forcing number and its corresponded sets are {n1 , n4 }, and
{n2 , n3 };
(vi) 2.9 is failed zero-forcing neutrosophic-number and its corresponded set

are {n1 , n4 }, and {n2 , n3 }.

Z 0 (N T G) = O(N T G) − 2.
49
2. Modified Notions


two vertices in same part are only members of S is a maximal set of black
Z 0 (N T G) = O(N T G) − 2.



50
2.6. Setting of Failed Zero-Forcing Neutrosophic-Number


neighbors of n1 and n4 , simultaneously. Thus the color-change rule
doesn’t imply n2 and n3 are black vertices. Hence V (G) isn’t turned
black after finitely many applications of “the color-change rule”. Thus
S = {n1 , n4 , n5 } could form failed zero-forcing number;


{n1 , n4 , n5 },{n1 , n4 , n2 },
{n1 , n4 , n3 }, and {n5 , n2 , n3 };

{n1 , n3 , n4 }.
2.6 Setting of Failed Zero-Forcing Neutrosophic-Number

In this section, I provide some results in the setting of failed zero-forcing
about them.
neutrosophic failed zero-forcing number and its failed zero-forcing neutrosophic-
number this model are computed. A complete-neutrosophic graph has specific
51
2. Modified Notions

Then
Zn0 (N T G) = On (N T G) − min{Σ3i=1 σi (x) + Σ3i=1 σi (y)}x,y∈V .

Zn0 (N T G) = On (N T G) − min{Σ3i=1 σi (x) + Σ3i=1 σi (y)}x,y∈V .

{n1 , n2 }, {n1 , n3 },
{n1 , n4 }, {n2 , n3 },{n2 , n4 }, and {n3 , n4 };
{n1 , n2 }.
52


Zn0 (N T G) = max{Σ3i=1 σi (xj ) + Σ3i=1 σi (xj+s ) + · · · }s≥2, xz isn’t a leaf .

vertex is a neighbor for two vertices. Non-leaf vertices with distance two, are
only members of S is a maximal set of black vertices which doesn’t force. Thus
the color-change rule doesn’t imply all vertices are black vertices. Hence V (G)
isn’t turned black after finitely many applications of “the color-change rule”. So
Zn0 (N T G) = max{Σ3i=1 σi (xj ) + Σ3i=1 σi (xj+s ) + · · · }s≥2, xz isn’t a leaf .

In next part, one odd-path-neutrosophic graph is depicted. Failed zero-
forcing number and its failed zero-forcing neutrosophic-number are computed.
zero-forcing number and its failed zero-forcing neutrosophic-number, too.
53
2. Modified Notions

rule”;
(v) 2 is failed zero-forcing number and its corresponded set is {n2 , n4 };
(vi) 3 is failed zero-forcing neutrosophic-number and its corresponded set
is {n2 , n4 }.
54



and {n3 , n5 };
set is {n3 , n5 }.
The set of vertices forms failed zero-forcing number and its failed zero-forcing
Zn0 (N T G) = max{Σ3i=1 σi (xj ) + Σ3i=1 σi (xj+s ) + · · · }s≥2 .
55
2. Modified Notions

is a neighbor for two vertices. Vertices with distance two, are only members of
S is a maximal set of black vertices which doesn’t force. Thus the color-change
rule doesn’t imply all vertices are black vertices. Hence V (G) isn’t turned black
after finitely many applications of “the color-change rule”. So
Zn0 (N T G) = max{Σ3i=1 σi (xj ) + Σ3i=1 σi (xj+s ) + · · · }s≥2 .

56

{n2 , n4 , n6 } and {n1 , n3 , n5 };
set is {n2 , n4 , n6 }.


{n3 , n5 },
{n2 , n5 }, {n4 , n1 },
and {n1 , n3 };
set is {n1 , n3 }.

center c. Then
Zn0 (N T G) = On (N T G) − min{Σ3i=1 σi (x) + Σ3i=1 σi (y)}x,y∈V,x,y6=c .
57
2. Modified Notions



two vertices but containing center are only members of S is a maximal set of
black vertices which doesn’t force. Thus the color-change rule doesn’t imply all
Zn0 (N T G) = On (N T G) − min{Σ3i=1 σi (x) + Σ3i=1 σi (y)}x,y∈V,x,y6=c .

58
items as follows.
the color-change rule doesn’t imply n1 is black vertex. n1 is only white
neighbor of n5 but n1 ∈ S. Thus the color-change rule doesn’t imply
n1 is black vertex. Hence V (G) isn’t turned black after finitely many
applications of “the color-change rule”. Thus S = {n1 , n4 , n5 } could form
failed zero-forcing number;
{n1 , n2 , n3 },{n1 , n2 , n4 },
{n1 , n2 , n5 },{n1 , n3 , n4 },
{n1 , n3 , n5 }, and {n1 , n4 , n5 };
{n1 , n3 , n4 }.

Then
Zn0 (N T G) = On (N T G) − min{Σ3i=1 σi (x) + Σ3i=1 σi (x0 )}x,x0 ∈Vi .

two vertices from same parts are only members of S is a maximal set of black
59
2. Modified Notions


many applications of “the color-change rule”. Thus S = {n1 , n4 } could
(v) 2 is failed zero-forcing number and its corresponded sets are {n1 , n4 }, and
{n2 , n3 };
60

(vi) 2.9 is failed zero-forcing neutrosophic-number and its corresponded set

are {n1 , n4 }, and {n2 , n3 }.


two vertices in same part are only members of S is a maximal set of black

61
2. Modified Notions


neighbors of n1 and n4 , simultaneously. Thus the color-change rule
doesn’t imply n2 and n3 are black vertices. Hence V (G) isn’t turned
black after finitely many applications of “the color-change rule”. Thus
S = {n1 , n4 , n5 } could form failed zero-forcing number;
{n1 , n4 , n5 },{n1 , n4 , n2 },
{n1 , n4 , n3 }, and {n5 , n2 , n3 };
{n1 , n3 , n4 }.

vertex set.
62
2.8. Case 1: Star Model alongside its Failed Zero-Forcing Number and its
Failed Zero-Forcing Neutrosophic-Number

Values (0.7, 0.9, 0.3) (0.4, 0.2, 0.8)· · · (0.3, 0.4, 0.3)
Values (0.4, 0.2, 0.3) (0.5, 0.2, 0.3)· · · (0.3, 0.4, 0.3)
2.8 Case 1: Star Model alongside its Failed

Zero-Forcing Number and its Failed Zero-Forcing
Neutrosophic-Number
Step 4. (Solution) The neutrosophic graph alongside its failed zero-forcing

number and its failed zero-forcing neutrosophic-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
63
2. Modified Notions
some connections as possible. Using the notion of strong on the connection

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 failed zero-forcing 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.18). This model is strong. And the
study proposes using specific number which is called failed zero-forcing
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 (2.18). In Figure (2.18), an star-neutrosophic graph is
illustrated. Some points are represented in follow-up items as follows.

the color-change rule doesn’t imply n1 is black vertex. n1 is only
white neighbor of n5 but n1 ∈ S. Thus the color-change rule doesn’t
imply n1 is black vertex. Hence V (G) isn’t turned black after finitely
many applications of “the color-change rule”. Thus S = {n1 , n4 , n5 }
could form failed zero-forcing number;
(iv) if S = {n2 , n3 , n5 } is a set of black vertices, then n1 is only white
{n1 , n2 , n3 },{n1 , n2 , n4 },
{n1 , n2 , n5 },{n1 , n3 , n4 },
{n1 , n3 , n5 }, and {n1 , n4 , n5 };
set is {n1 , n3 , n4 }.
64
2.9. Case 2: Cycle Model alongside its Failed Zero-Forcing Number and its
Failed Zero-Forcing Neutrosophic-Number


2.9 Case 2: Cycle Model alongside its Failed

Zero-Forcing Number and its Failed Zero-Forcing
Neutrosophic-Number
Step 4. (Solution) The neutrosophic graph alongside its failed zero-forcing

number and its failed zero-forcing neutrosophic-number as model, propose
to use specific number. Every subject has connection with every given
subject in deemed way. Thus the connection is 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 holds for other types such that star, wheel, path, and cycle. The
collection of situations is another application of failed zero-forcing number
and failed zero-forcing neutrosophic-number when the notion of family is
65
2. Modified Notions
applied in the way that all members of family are from same classes of
neutrosophic graphs. As follows, There are six subjects and five subjects
which are represented in the formation of two models as Figures (2.19),
(2.20). These models are neutrosophic strong as individual. And the study
proposes using specific number which is called failed zero-forcing number
and failed zero-forcing neutrosophic-number for these models. 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 Figures (2.19),
(2.20). There is one section for clarifications.
(a) In Figure (2.19), an even-cycle-neutrosophic graph is illustrated.

n1 is black vertex. In other side, n5 is only white neighbor
of n4 . Thus the color-change rule implies n5 is black vertex
and after that n6 is only white neighbor of n5 . Thus the color-
change rule implies n6 is black vertex. Thus n1 , n2 , n5 and n6
are black vertices. Hence V (G) is turned black after finitely
only white neighbors of n2 . Thus the color-change rule doesn’t
imply n1 and n3 are black vertices. In other view, n5 and n3 are
imply n5 and n3 are black vertices. In last view, n5 and n4 are
imply n5 and n4 are black vertices. Hence V (G) isn’t turned
black after finitely many applications of “the color-change rule”.
Thus S = {n2 , n4 , n6 } could form failed zero-forcing number;
{n2 , n4 , n6 } and {n1 , n3 , n5 };
66
2.10. Open Problems
(vi) 4.9 is failed zero-forcing neutrosophic-number and its correspon-

ded set is {n2 , n4 , n6 }.

neighbor of n3 . Thus the color-change rule implies n2 is black
vertex and after that n1 is only white neighbor of n2 . Thus the
color-change rule implies n1 is black vertex. Thus n1 and n2 are
black vertices. Hence V (G) is turned black after finitely many
imply n1 and n3 are black vertices. In other view, n5 and n3 are
imply n5 and n3 are black vertices. In last view, n5 and n4 are
imply n5 and n4 are black vertices. Hence V (G) isn’t turned
black after finitely many applications of “the color-change rule”.
Thus S = {n2 , n4 , n6 } could form failed zero-forcing number;
{n2 , n4 }, {n3 , n5 },
{n2 , n5 }, {n4 , n1 },
and {n1 , n3 };
(vi) 3.7 is failed zero-forcing neutrosophic-number and its correspon-
ded set is {n1 , n3 }.
2.10 Open Problems

Notion concerning failed zero-forcing number and failed zero-forcing
neutrosophic-number are defined in neutrosophic graphs. Neutrosophic number
is also reused. Thus,
67
2. Modified Notions
Question 2.10.1. Is it possible to use other types failed zero-forcing number

and failed zero-forcing neutrosophic-number arising from operations of different
vertices to define new failed zero-forcing number and failed zero-forcing
neutrosophic-number?
Question 2.10.2. Are existed some connections amid different types of failed
zero-forcing number and failed zero-forcing neutrosophic-number in neutrosophic
graphs?
behavior?
independent study?

This study uses two definitions concerning failed zero-forcing number and
failed zero-forcing neutrosophic-number arising operations of different vertices
to study neutrosophic graphs. New neutrosophic number is reused which
is too close to the notion of neutrosophic number but it’s different since it
uses all values as type-summation on them. Comparisons amid number and
edges are done by using neutrosophic tool. The connections of vertices which
aren’t clarified by unique edges differ them from each other and put them
in different categories to represent a number which its value is called either
1. Defining Failed Zero-Forcing Number 1. Wheel-Neutrosophic Graphs
2. Defining Failed Zero-Forcing Neutrosophic-Number
3. Study on Classes 2. Study on Families
4. Using Operations of Vertices
5. Avoid Unique Edges 3. Same Models in Family
failed zero-forcing number or forms failed zero-forcing neutrosophic-number.
68
2.11. Conclusion and Closing Remarks
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.
69
CHAPTER 3
Extended Notions
3.1 (Failed)1-Zero-Forcing Number in Neutrosophic

Graphs
3.2 Abstract
New setting is introduced to study 1-zero-forcing number, 1-zero-forcing
neutrosophic-number, failed 1-zero-forcing number and failed 1-zero-forcing
neutrosophic-number arising operations of different vertices. Leaf-like is a key
term to have these notions. (Not) Forcing a vertex to change its color is a type of
approach to force that vertex to be zero-like. (Not) Forcing a vertex which is only
neighbor for zero-like vertex to be zero-like vertex but now both settings leads to
approach is on demand which is finding biggest (smallest) set which doesn’t force.
Let N T G : (V, E, σ, µ) be a neutrosophic graph. Then 1-zero-forcing number
Z(N T G) for a neutrosophic graph N T G : (V, E, σ, µ) is minimum cardinality
of a set S of black vertices (whereas vertices in V (G) \ S are colored white) such
that V (G) is turned black after finitely many applications of “the color-change
neighbor of a black vertex. The last condition is as follows. For one time, black
can change any vertex from white to black. 1-zero-forcing neutrosophic-number
Zn (N T G) for a neutrosophic graph N T G : (V, E, σ, µ) is minimum neutrosophic
white) such that V (G) is turned black after finitely many applications of “the
color-change rule”: a white vertex is converted to a black vertex if it is the only
white neighbor of a black vertex. The last condition is as follows. For one time,
black can change any vertex from white to black. Failed 1-zero-forcing number
Z 0 (N T G) for a neutrosophic graph N T G : (V, E, σ, µ) is maximum cardinality
of a set S of black vertices (whereas vertices in V (G) \ S are colored white)
such that V (G) isn’t turned black after finitely many applications of “the color-
change rule”: a white vertex is converted to a black vertex if it is the only white
neighbor of a black vertex. The last condition is as follows. For one time, Black
can change any vertex from white to black. The last condition is as follows. For
one time, black can change any vertex from white to black. Failed 1-zero-forcing
neutrosophic-number Zn0 (N T G) for a neutrosophic graph N T G : (V, E, σ, µ) is
71
3. Extended Notions
maximum neutrosophic cardinality of a set S of black vertices (whereas vertices

in V (G) \ S are colored white) such that V (G) isn’t turned black after finitely
many applications of “the color-change rule”: a white vertex is converted to a
black vertex if it is the only white neighbor of a black vertex. The last condition
is as follows. For one time, Black can change any vertex from white to black. The
last condition is as follows. For one time, black can change any vertex from white
to black. 1-zero-forcing number, 1-zero-forcing neutrosophic-number, failed
operations of different vertices are about a set of vertices which are applied
neutrosophic graphs are investigated in the terms of maximal set minimal set
which form 1-zero-forcing number, 1-zero-forcing neutrosophic-number, failed
operations of different vertices. Neutrosophic number is reused in this way. It’s
applied to use the type of neutrosophic number in the way that, three values of
a vertex are used and they’ve same share to construct this number to compare
with other vertices. Summation of three values of vertex makes one number and
applying it to a comparison. This approach facilitates identifying vertices which
form 1-zero-forcing number, 1-zero-forcing neutrosophic-number, failed 1-zero-
of different vertices. In path-neutrosophic graphs, ∅ (1-set), forms maximal
(minimal) set but with slightly differences, in cycle-neutrosophic graphs, ∅ (1-set),
forms maximal (minimal) set. Other classes have same approaches. In complete-
neutrosophic graphs, a set of vertices excluding two (three) vertices leads us to
(failed) 1-zero-forcing number and (failed) 1-zero-forcing neutrosophic-number.
In star-neutrosophic graphs, a set of vertices excluding only two (three) vertices
and containing center, makes (maximal) minimal set. In complete-bipartite-
neutrosophic graphs, a set of vertices excluding three (four) vertices from (same)
different parts as possible makes intended set but with slightly differences, in
complete-t-partite-neutrosophic graphs, a set of vertices excluding three (four)
vertices from (same) different parts makes intended set. In both settings, some
classes of well-known neutrosophic graphs are studied. Some clarifications for
each result and each definition are provided. Using basic set (not) to extend
this set to set of all vertices has key role to have these notions in the form of
1-zero-forcing number, 1-zero-forcing neutrosophic-number, failed 1-zero-forcing
number and failed 1-zero-forcing neutrosophic-number arising operations of
different vertices. The cardinality of a set has eligibility to form (failed) 1-zero-
forcing number but the neutrosophic cardinality of a set has eligibility to call
(failed) 1-zero-forcing neutrosophic-number. Some results get more frameworks
and perspective about these definitions. The way in that, three vertices (don’t)
have unique connection amid each other, opens the way to do some approaches.
72
3.3. Motivation and Contributions
Keywords: (Failed) 1-Zero-Forcing Number, (Maximal) Minimal Set, Vertex

Question 3.3.1. Is it possible to use mixed versions of ideas concerning “(Failed)
1-Zero-Forcing Number”, “(Failed) 1-Zero-Forcing Neutrosophic-Number” and
“Neutrosophic Graph” to define some notions which are applied to neutrosophic
graphs?
which lead to be considered as motivation. Unique connections amid two vertices
have key roles to assign 1-zero-forcing number, 1-zero-forcing neutrosophic-
number, failed 1-zero-forcing number and failed 1-zero-forcing neutrosophic-
number arising operations of different vertices. Thus they’re used to define
new ideas which conclude to the structure 1-zero-forcing number, 1-zero-forcing
neutrosophic-number, failed 1-zero-forcing number and failed 1-zero-forcing
neutrosophic-number arising operations of different vertices. The concept of
(not) having unique edge and extra condition inspire us to study the behavior
of vertices in the way that, some types of numbers, 1-zero-forcing number,
1-zero-forcing neutrosophic-number, failed 1-zero-forcing number and failed
1-zero-forcing neutrosophic-number arising operations of different vertices are
the cases of study in the setting of individuals. In both settings, a corresponded
number 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 (failed) 1-zero-forcing number and (failed) 1-zero-forcing neutrosophic-
number are highlighted, are introduced and are clarified as individuals. In section
“Preliminaries”, sets of vertices have the key role in this way. General results are
obtained and also, the results about the basic notions of (failed) 1-zero-forcing
number and (failed) 1-zero forcing neutrosophic-number are elicited. Some
classes of neutrosophic graphs are studied in the terms of neutrosophic (failed)
1-zero-forcing number, in section “Setting of Neutrosophic (Failed) 1-Zero-
Forcing Number,” as individuals. In section “Setting of Neutrosophic (Failed)
1-Zero-Forcing Number,”, neutrosophic (failed) 1-zero-forcing number is applied
into individuals. As concluding results, there are some statements, remarks,
examples and clarifications about some classes of neutrosophic graphs namely
graphs, star-neutrosophic graphs, complete-bipartite-neutrosophic graphs and
complete-t-partite-neutrosophic graphs. The clarifications are also presented
in both sections “Setting of Neutrosophic (Failed) 1-Zero-Forcing Number,”
and “Setting of (Failed) 1-Zero-Forcing Neutrosophic-Number,” for introduced
results and used classes. In section “Applications in Time Table and Scheduling”,
two applications are posed for star-neutrosophic graphs and star-neutrosophic
graphs concerning time table and scheduling when the suspicions are about
73
3. Extended Notions
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.
3.4 Preliminaries
model.
µ(vi vj ) ≤ σ(vi ) ∧ σ(vj ).
On (N T G).
Sn (N T G).

about them.

E, i = 0, 1, · · · , n − 1;
V
74
3.4. Preliminaries

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

E, i = 0, 1, · · · , V
µ(xy) = µ(uv) = i=0,1,··· ,n−1 µ(vi vi+1 );
s
The main definition is presented in next section. The notions of 1-zero-
forcing number and 1-zero-forcing neutrosophic-number facilitate the ground
to introduce new results. These notions will be applied on some classes of
neutrosophic graphs in upcoming sections and they separate the results in two
different sections based on introduced types. New setting is introduced to study
1-zero-forcing number and 1-zero-forcing neutrosophic-number. Leaf-like is a
key term to have these notions. Forcing a vertex to change its color is a type of
approach to force that vertex to be zero-like. Forcing a vertex which is only
neighbor for zero-like vertex to be zero-like vertex and now approach is on
demand which is finding smallest set which forces.
Definition 3.4.4. (1-Zero-Forcing Number).
(i) 1-zero-forcing number Z(N T G) for a neutrosophic graph N T G :
(V, E, σ, µ) is minimum cardinality of a set S of black vertices (whereas
vertices in V (G) \ S are colored white) such that V (G) is turned black
vertex. The last condition is as follows. For one time, black can change
any vertex from white to black.
(ii) 1-zero-forcing neutrosophic-number Zn (N T G) for a neutrosophic
graph N T G : (V, E, σ, µ) is minimum neutrosophic cardinality of a set S
of black vertices (whereas vertices in V (G) \ S are colored white) such that
neighbor of a black vertex. The last condition is as follows. For one time,
black can change any vertex from white to black.
75
3. Extended Notions

matters of mind.
(i) if S = {n1 , n4 } is a set of black vertices, then n2 and n3 are white
neighbors of n1 and n4 . Thus the color-change rule doesn’t imply n2 is
black vertex but extra condition implies. n2 is white neighbor of n1 and
n4 . Thus the color-change rule implies n3 is black vertex. Thus n2 and
applications of “the color-change rule” and extra condition;
(ii) if S = {n2 , n4 } is a set of black vertices, then n1 and n3 are white
(iii) if S = {n1 } is a set of black vertices, then n2 , n3 and n4 are white neighbors
of n2 . Thus the color-change rule doesn’t imply neither of n2 , n3 and n4
are black vertices and extra condition doesn’t imply, too. Hence V (G)
isn’t turned black after finitely many applications of “the color-change
rule” and extra condition;
(iv) if S = {n3 , n4 } is a set of black vertices, then n1 and n2 are white
(v) 3 is 1-zero-forcing number and its corresponded sets are {n1 , n2 }, {n1 , n3 },
{n1 , n4 }, {n2 , n3 }, {n2 , n4 }, and {n3 , n4 };
(vi) 2.3 is 1-zero-forcing neutrosophic-number and its corresponded set is
{n3 , n4 }.
The main definition is presented in next section. The notions of failed 1-
zero-forcing number and failed 1-zero-forcing neutrosophic-number facilitate the
ground to introduce new results. These notions will be applied on some classes
of neutrosophic graphs in upcoming sections and they separate the results in two
different sections based on introduced types. New setting is introduced to study
failed 1-zero-forcing number and failed 1-zero-forcing neutrosophic-number.
approach is on demand which is finding biggest set which doesn’t force.
76
3.4. Preliminaries
Figure 3.1: A Neutrosophic Graph in the Viewpoint of its 1-Zero-Forcing

Number and its 1-Zero-Forcing Neutrosophic-Number. 49NTG1
Definition 3.4.6. (Failed 1-Zero-Forcing Number).

(i) Failed 1-zero-forcing number Z 0 (N T G) for a neutrosophic graph
N T G : (V, E, σ, µ) is maximum cardinality of a set S of black vertices
(whereas vertices in V (G) \ S are colored white) such that V (G) isn’t
turned black after finitely many applications of “the color-change rule”: a
white vertex is converted to a black vertex if it is the only white neighbor
of a black vertex. The last condition is as follows. For one time, Black can
change any vertex from white to black. The last condition is as follows.
For one time, black can change any vertex from white to black.
(ii) Failed 1-zero-forcing neutrosophic-number Zn0 (N T G) for a neutro-
sophic graph N T G : (V, E, σ, µ) is maximum neutrosophic cardinality of
a set S of black vertices (whereas vertices in V (G) \ S are colored white)
color-change rule”: a white vertex is converted to a black vertex if it is
the only white neighbor of a black vertex. The last condition is as follows.
For one time, Black can change any vertex from white to black. The last
condition is as follows. For one time, black can change any vertex from
white to black.
matters of mind.
77
3. Extended Notions
Figure 3.2: A Neutrosophic Graph in the Viewpoint of its Failed 1-Zero-Forcing

Number and its Failed 1-Zero-Forcing Neutrosophic-Number. 49NTG1

rule” and extra condition. Thus S = {n1 } could form failed 1-zero-forcing
number;

(v) 1 is failed 1-zero-forcing number and its corresponded sets are {n1 , }, {n2 },
{n3 }, and {n4 };
(vi) 2 is failed 1-zero-forcing neutrosophic-number and its corresponded set is

{n2 }.
3.5 Setting of Neutrosophic 1-Zero-Forcing Number

In this section, I provide some results in the setting of neutrosophic 1-
zero-forcing number. Some classes of neutrosophic graphs are chosen.
about them.
78
3.5. Setting of Neutrosophic 1-Zero-Forcing Number
its neutrosophic 1-zero-forcing number and its 1-zero-forcing neutrosophic-

number these models are computed. A complete-neutrosophic graph has specific
Then
Z(N T G) = O(N T G) − 2.

vertex is a neighbor for every given vertex. Assume |S| > 2. If S is a set of black
vertices and |S| < O(N T G) − 1, then there are x and y such that they’ve more
than one neighbor in S. Thus the color-change rule doesn’t imply these vertices
are black vertices but extra condition implies where |S| = O(N T G) − 2. Hence
V (G) is turned black after finitely many applications of “the color-change rule”
and extra condition. So
Z(N T G) = O(N T G) − 2.



79
3. Extended Notions

Number. 49NTG2

{n1 , n4 }, {n2 , n3 }, {n2 , n4 }, and {n3 , n4 };
{n3 , n4 }.
In next result, a path-neutrosophic graph is considered and 1-zero-forcing
number and its 1-zero-forcing neutrosophic-number of this model are computed
for a leaf in specific case. Precisely, equality is proposed for 1-zero-forcing
number in next result where being leaf-like and having its unique edge are key
hypotheses. The set of black forms 1-zero-forcing number and its 1-zero-forcing
Z(N T G) = 1.
vertex is a neighbor for two vertices but extra condition implies one of them to
be black. Color-change rule implies a leaf is only member of S is a set of black
vertices but extra condition implies every vertex is only member of S is a set of
black vertices. Thus the color-change rule and extra condition imply all vertices
are black vertices where one vertex is in S. Hence V (G) is turned black after
finitely many applications of “the color-change rule” and extra condition. So
Z(N T G) = 1.

In next part, one odd-path-neutrosophic graph is depicted. 1-zero-forcing
number and its 1-zero-forcing neutrosophic-number are computed. In next
part, one even-path-neutrosophic graph is applied to compute its 1-zero-forcing
number and its 1-zero-forcing neutrosophic-number, too.
80


are black vertices but extra condition implies. Hence V (G) is turned
black after finitely many applications of “the color-change rule” and
extra condition;
rule”;
(v) 1 is 1-zero-forcing number and its corresponded sets are
{n1 }, {n2 }, {n3 }, {n4 }, and {n5 };
{n3 }.


81
3. Extended Notions

Number. 49NTG3

are black vertices but extra condition implies n1 and n3 are black
vertices. Hence V (G) is turned black after finitely many applications
of “the color-change rule” and extra condition;
{n1 }, {n2 }, {n3 }, {n4 }, {n5 }. and {n6 };
{n3 }.
82

Number. 49NTG4
Z(N T G) = 1.

members of S is a set of black vertices through color-change rule. Thus the
color-change rule implies all vertices are black vertices but extra condition
implies every given vertex is member of S is a set of black vertices. Hence V (G)
is turned black after finitely many applications of “the color-change rule” and
extra condition. So
Z(N T G) = 1.




83
3. Extended Notions

{n1 }, {n2 }, {n3 }, {n4 }, {n5 }. and {n6 };
{n5 }.


84

Number. 49NTG5

Number. 49NTG6

{n1 }, {n2 }, {n3 }, {n4 }, {n5 }. and {n6 };
{n5 }.

center c. Then
Z(N T G) = O(N T G) − 3.

center and other two other are only members of S is a set of black vertices.
Thus the color-change rule and extra condition imply all vertices are black
vertices. Hence V (G) is turned black after finitely many applications of “the
85
3. Extended Notions
color-change rule”. So
Z(N T G) = O(N T G) − 3.

items as follows.
(ii) if S = {n1 , n4 , n5 } is a set of black vertices, then n2 and n3 are white
neighbors of n1 . Thus the color-change rule doesn’t imply n2 and n3 are
black vertices but but extra condition implies n2 and n3 are black vertices
since n2 is black vertex through extra condition and after that n3 is black
vertex through color-change rule. Hence V (G) is turned black after finitely
many applications of “the color-change rule” and extra condition;
(iii) if S = {n4 , n5 } is a set of black vertices, then n1 is black through “the
color-change rule” since n1 in only white neighbor of n4 . After that n3 is
black through extra condition. After that n2 in only white neighbor of
n1 . So n2 is black through “the color-change rule”. Thus the color-change
rule and extra condition imply n1 , n3 , and n2 are black vertices. Hence
(iv) if S = {n2 , n5 } is a set of black vertices, then n1 is black through “the
(v) 2 is 1-zero-forcing number and its corresponded sets are {n2 , n3 },{n2 , n4 },{n2 , n5 },{n3 , n4 },{n3 , n5 }
and {n4 , n5 };
{n2 , n5 }.

Then
Z(N T G) = O(N T G) − 3.
86

Number. 49NTG7

two vertices from different parts and one other vertex are only member of S is
a set of black vertices. Thus the color-change rule and extra condition imply
applications of “the color-change rule” and extra condition. So
Z(N T G) = O(N T G) − 3.

of n1 and n4 , simultaneously. Thus the color-change rule doesn’t imply n2
and n3 are black vertices but extra condition implies n2 and n3 are black
87
3. Extended Notions

Number. 49NTG8
vertices. Hence V (G) is turned black after finitely many applications of

“the color-change rule” and extra condition;
neighbor of n4 . Thus extra condition implies n2 is black vertex. After
that the color-change rule implies n3 is black vertex. After that the
color-change rule implies n1 is black vertex. Thus n1 , n2 and n3 are black
(v) 1 is 1-zero-forcing number and its corresponded sets are {n1 },{n2 },{n3 },
and {n4 };
(vi) 1 is 1-zero-forcing neutrosophic-number and its corresponded set is {n4 }.

Z(N T G) = O(N T G) − 2.

two vertices are only members of S is a set of black vertices. Thus the color-
change rule and extra condition imply all vertices are black vertices. Hence
Z(N T G) = O(N T G) − 2.

88
3.6. Setting of 1-Zero-Forcing Neutrosophic-Number


(iii) if S = {n1 , n2 } is a set of black vertices, then n5 and n3 are white

neighbors of n1 . Thus the color-change rule doesn’t imply n5 , n4 and
n3 are black vertices but extra condition implies n5 , n4 and n3 . n5 and
n3 are white neighbors of n1 . Hence extra condition implies n5 is black.
After that n3 is black through the color-change rule. After that n4 is
only white neighbor of n3 . So n4 is black through the color-change rule.
Thus n3 , n5 and n4 are black vertices through color-change rule and extra
condition. Hence V (G) is turned black after finitely many applications of

(v) 2 is 1-zero-forcing number and its corresponded sets are {n1 , n2 },{n1 , n5 },
{n1 , n3 },{n4 , n2 }, {n4 , n5 }, and {n4 , n3 };
(vi) 2.4 is 1-zero-forcing neutrosophic-number and its corresponded sets are

{n2 , n4 } and {n5 , n4 }.
3.6 Setting of 1-Zero-Forcing Neutrosophic-Number

In this section, I provide some results in the setting of 1-zero-forcing
89
3. Extended Notions

Number. 49NTG9

about them.
neutrosophic 1-zero-forcing number and its 1-zero-forcing neutrosophic-number
Then
Zn (N T G) = On (N T G) − max{Σ3i=1 σi (x) + Σ3i=1 σi (y)}x,y∈V .

Zn (N T G) = On (N T G) − max{Σ3i=1 σi (x) + Σ3i=1 σi (y)}x,y∈V .

90



{n1 , n4 }, {n2 , n3 }, {n2 , n4 }, and {n3 , n4 };

{n3 , n4 }.
Zn (N T G) = min{Σ3i=1 σi (x)}x is a vertex .
91
3. Extended Notions

In next part, one odd-path-neutrosophic graph is depicted. 1-zero-forcing

number and its 1-zero-forcing neutrosophic-number are computed. In next
part, one even-path-neutrosophic graph is applied to compute its 1-zero-forcing
number and its 1-zero-forcing neutrosophic-number, too.
extra condition;
rule”;
92

{n1 }, {n2 }, {n3 }, {n4 }, and {n5 };
{n3 }.
{n1 }, {n2 }, {n3 }, {n4 }, {n5 }. and {n6 };
{n3 }.
The set of vertices forms 1-zero-forcing number and its 1-zero-forcing
93
3. Extended Notions



extra condition. So

94

{n1 }, {n2 }, {n3 }, {n4 }, {n5 }. and {n6 };
{n5 }.
95
3. Extended Notions


{n1 }, {n2 }, {n3 }, {n4 }, {n5 }. and {n6 };
{n5 }.

center c. Then
Zn (N T G) = On (N T G) − max{Σ3i=1 σi (c) + Σ3i=1 σi (x) + Σ3i=1 σi (y)}x,y∈V .
Zn (N T G) = On (N T G) − max{Σ3i=1 σi (c) + Σ3i=1 σi (x) + Σ3i=1 σi (y)}x,y∈V .

96


items as follows.
(iv) if S = {n2 , n5 } is a set of black vertices, then n1 is black through “the
97
3. Extended Notions


(v) 2 is 1-zero-forcing number and its corresponded sets are {n2 , n3 },{n2 , n4 },{n2 , n5 },{n3 , n4 },{n3 , n5 }
and {n4 , n5 };

{n2 , n5 }.

Then
Zn (N T G) = On (N T G) − max{Σ3i=1 σi (x) + Σ3i=1 σi (x0 ) + Σ3i=1 σi (x00 )}x,x0 ,x00 ∈V .

Zn (N T G) = On (N T G) − max{Σ3i=1 σi (x) + Σ3i=1 σi (x0 ) + Σ3i=1 σi (x00 )}x,x0 ,x00 ∈V .

98



neighbor of n4 . Thus extra condition implies n2 is black vertex. After
that the color-change rule implies n3 is black vertex. After that the
color-change rule implies n1 is black vertex. Thus n1 , n2 and n3 are black
(v) 1 is 1-zero-forcing number and its corresponded sets are {n1 },{n2 },{n3 },
and {n4 };
(vi) 1 is 1-zero-forcing neutrosophic-number and its corresponded set is {n4 }.

99
3. Extended Notions


100
3.7. Setting of Neutrosophic Failed 1-Zero-Forcing Number

(v) 2 is 1-zero-forcing number and its corresponded sets are {n1 , n2 },{n1 , n5 },
{n1 , n3 },{n4 , n2 }, {n4 , n5 }, and {n4 , n3 };
(vi) 2.4 is 1-zero-forcing neutrosophic-number and its corresponded sets are

{n2 , n4 } and {n5 , n4 }.
3.7 Setting of Neutrosophic Failed 1-Zero-Forcing Number

In this section, I provide some results in the setting of neutrosophic failed
1-zero-forcing number. Some classes of neutrosophic graphs are chosen.
about them.
its neutrosophic failed 1-zero-forcing number and its failed 1-zero-forcing
neutrosophic-number these models are computed. A complete-neutrosophic
graph has specific attribute which implies every vertex is neighbor to all other
vertices in the way that, two given vertices have edge is incident to these
endpoints.
Then
Z 0 (N T G) = O(N T G) − 3.

101
3. Extended Notions
Z 0 (N T G) = O(N T G) − 3.



isn’t turned black after finitely many applications of “the color-change rule”
and extra condition. Hence S = {n1 } could form failed 1-zero-forcing
number;

(v) 1 is failed 1-zero-forcing number and its corresponded sets are

{n1 }, {n2 },{n3 }, and {n4 };

{n2 }.
In next result, a path-neutrosophic graph is considered and failed 1-zero-

forcing number and its failed 1-zero-forcing neutrosophic-number of this model
102

Number. 49NTG18
are computed for a leaf in specific case. Precisely, equality is proposed for failed
1-zero-forcing number in next result where being leaf-like and having its unique
edge are key hypotheses. The set of black forms failed 1-zero-forcing number
and its failed 1-zero-forcing neutrosophic-number.
Z 0 (N T G) = 0.
Z 0 (N T G) = 0.

In next part, one odd-path-neutrosophic graph is depicted. Failed 1-zero-
forcing number and its failed 1-zero-forcing neutrosophic-number are computed.
1-zero-forcing number and its failed 1-zero-forcing neutrosophic-number, too.
103
3. Extended Notions

extra condition;
(iv) if S = ∅ is a set of black vertices. Thus if extra condition implies
one non-leaf vertex is black, then the color-change rule doesn’t imply
other vertices are black. Hence V (G) isn’t turned black after finitely
many applications of “the color-change rule” and extra condition
Hence S = ∅ could form failed 1-zero-forcing number;
(v) 0 is failed 1-zero-forcing number and its corresponded sets is ∅;
(vi) 0 is failed 1-zero-forcing neutrosophic-number and its corresponded
set is ∅.


104

Number. 49NTG19

Number. 49NTG20

set is ∅.
The set of vertices forms failed 1-zero-forcing number and its failed 1-zero-
forcing neutrosophic-number.
Z 0 (N T G) = 0.

105
3. Extended Notions
extra condition. So
Z 0 (N T G) = 0.


one vertex is black, then the color-change rule doesn’t imply other
vertices are black. Hence V (G) isn’t turned black after finitely many
applications of “the color-change rule” and extra condition Hence
S = ∅ could form failed 1-zero-forcing number;
set is ∅.
106

Number. 49NTG21

set is ∅.

center c. Then
Z 0 (N T G) = O(N T G) − 4.
107
3. Extended Notions

Number. 49NTG22

Z 0 (N T G) = O(N T G) − 4.

items as follows.
108

Number. 49NTG23

(iv) if S = {n2 } is a set of black vertices, then n1 is black through “the

black through extra condition. After that n4 and n5 are white neighbors
of n1 . So n4 isn’t black through “the color-change rule”. Thus the color-
change rule and extra condition don’t imply n5 and n4 are black vertices.
Hence V (G) isn’t turned black after finitely many applications of “the
color-change rule” and extra condition. Hence S = {n2 } could form failed
1-zero-forcing number;

{n1 },{n2 },{n3 },{n4 }, and {n5 };
(vi) 1.9 is failed 1-zero-forcing neutrosophic-number and its corresponded set

is {n1 }.

Then
Z 0 (N T G) = O(N T G) − 4.

Z 0 (N T G) = O(N T G) − 4.
109
3. Extended Notions

(iv) if S = ∅ is a set of black vertices, extra condition implies n4 is black
vertex. Then n2 and n3 are only white neighbors of n4 . Thus After that
the color-change rule don’t imply n2 and n3 are black vertices. Thus
n1 , n2 and n3 aren’t black vertices. Hence V (G) isn’t turned black after
finitely many applications of “the color-change rule” and extra condition.
∅.

Z 0 (N T G) = O(N T G) − 3.
Z 0 (N T G) = O(N T G) − 3.
110

Number. 49NTG24




111
3. Extended Notions

Number. 49NTG25
(iv) if S = {n5 } is a set of black vertices, then n1 and n4 are white neighbors
of n5 . Thus the color-change rule doesn’t imply n1 and n4 are black
vertices but extra condition implies n1 is black vertex. After that, the
color-change rule doesn’t imply either n2 or n3 are black vertices. Thus n3
and n2 aren’t black vertices through color-change rule and extra condition.
(v) 1 is failed 1-zero-forcing number and its corresponded sets are {n1 },{n2 },
{n3 }, {n4 }, and {n5 };
(vi) 1.9 is failed 1-zero-forcing neutrosophic-number and its corresponded sets
are {n1 }.
3.8 Setting of Failed 1-Zero-Forcing Neutrosophic-Number

In this section, I provide some results in the setting of failed 1-zero-forcing
about them.
its neutrosophic failed 1-zero-forcing number and its failed 1-zero-forcing
neutrosophic-number this model are computed. A complete-neutrosophic graph
has specific attribute which implies every vertex is neighbor to all other vertices
in the way that, two given vertices have edge is incident to these endpoints.
Then
Zn0 (N T G) = On (N T G)−
min{Σ3i=1 σi (x) + Σ3i=1 σi (y) + Σ3i=1 σi (z)}x,y,z∈V .
112
3.8. Setting of Failed 1-Zero-Forcing Neutrosophic-Number

min{Σ3i=1 σi (x) + Σ3i=1 σi (y) + Σ3i=1 σi (z)}x,y,z∈V .

isn’t turned black after finitely many applications of “the color-change rule”
and extra condition. Hence S = {n1 } could form failed 1-zero-forcing
number;
{n1 }, {n2 },{n3 }, and {n4 };
113
3. Extended Notions


{n2 }.
Zn0 (N T G) = 0.

Zn0 (N T G) = 0.
In next part, one odd-path-neutrosophic graph is depicted. Failed 1-zero-

forcing number and its failed 1-zero-forcing neutrosophic-number are computed.
1-zero-forcing number and its failed 1-zero-forcing neutrosophic-number, too.


114

extra condition;
set is ∅.


115
3. Extended Notions



set is ∅.
The set of vertices forms 1-zero-forcing number and its 1-zero-forcing

Zn0 (N T G) = 0

116
extra condition. So
Zn0 (N T G) = 0.


set is ∅.
117
3. Extended Notions


set is ∅.

center c. Then
min{Σ3i=1 σi (c) + Σ3i=1 σi (x) + Σ3i=1 σi (y) + Σ3i=1 σi (z)}x,y,z∈V .
118


min{Σ3i=1 σi (c) + Σ3i=1 σi (x) + Σ3i=1 σi (y) + Σ3i=1 σi (z)}x,y,z∈V .


items as follows.


119
3. Extended Notions


black through extra condition. After that n4 and n5 are white neighbors
of n1 . So n4 isn’t black through “the color-change rule”. Thus the color-
change rule and extra condition don’t imply n5 and n4 are black vertices.
{n1 },{n2 },{n3 },{n4 }, and {n5 };
(vi) 1.9 is failed 1-zero-forcing neutrosophic-number and its corresponded set
is {n1 }.

Then
min{Σ3i=1 σi (x) + Σ3i=1 σi (x0 ) + Σ3i=1 σi (x00 ) + Σ3i=1 σi (x000 )}x,x0 ,x00 ,x000 ∈V .
120
min{Σ3i=1 σi (x) + Σ3i=1 σi (x0 ) + Σ3i=1 σi (x00 ) + Σ3i=1 σi (x000 )}x,x0 ,x00 ,x000 ∈V .


(iv) if S = ∅ is a set of black vertices, extra condition implies n4 is black
vertex. Then n2 and n3 are only white neighbors of n4 . Thus After that
the color-change rule don’t imply n2 and n3 are black vertices. Thus
n1 , n2 and n3 aren’t black vertices. Hence V (G) isn’t turned black after
finitely many applications of “the color-change rule” and extra condition.
∅.

Zn0 (N T G) = On (N T G) − min{Σ3i=1 σi (x) + Σ3i=1 σi (x0 ) + Σ3i=1 σi (x00 )}x,x0 ∈V .

121
3. Extended Notions

Zn0 (N T G) = On (N T G) − min{Σ3i=1 σi (x) + Σ3i=1 σi (x0 ) + Σ3i=1 σi (x00 )}x,x0 ∈V .

122
3.9. Applications in Time Table and Scheduling


(iv) if S = {n5 } is a set of black vertices, then n1 and n4 are white neighbors
of n5 . Thus the color-change rule doesn’t imply n1 and n4 are black
vertices but extra condition implies n1 is black vertex. After that, the
color-change rule doesn’t imply either n2 or n3 are black vertices. Thus n3
and n2 aren’t black vertices through color-change rule and extra condition.
(v) 1 is failed 1-zero-forcing number and its corresponded sets are {n1 },{n2 },
{n3 }, {n4 }, and {n5 };
(vi) 1.9 is failed 1-zero-forcing neutrosophic-number and its corresponded sets

are {n1 }.

vertex set.
123
3. Extended Notions

Number and its 1-Zero-Forcing Neutrosophic-Number. 49NTG34

Values (0.7, 0.9, 0.3) (0.4, 0.2, 0.8)· · · (0.3, 0.4, 0.3)
Values (0.4, 0.2, 0.3) (0.5, 0.2, 0.3)· · · (0.3, 0.4, 0.3)
3.10 Case 1: Star Model alongside its 1-Zero-Forcing

Number and its 1-Zero-Forcing Neutrosophic-Number
Step 4. (Solution) The neutrosophic graph alongside its1-zero-forcing number

and its 1-zero-forcing neutrosophic-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 some
connections as possible. Using the notion of strong on the connection
subjects. If the configuration is star, the number is different. Also, it
124
3.11. Case 2: Star Model alongside its Failed 1-Zero-Forcing Number and its
Failed 1-Zero-Forcing Neutrosophic-Number
holds for other types such that complete, wheel, path, and cycle. The
collection of situations is another application of 1-zero-forcing 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.35). This model is
strong. And the study proposes using specific number which is called
1-zero-forcing 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 (3.35). In Figure (3.35), an star-neutrosophic
graph is illustrated. Some points are represented in follow-up items as
follows.


neighbors of n1 . Thus the color-change rule doesn’t imply n2 and
n3 are black vertices but but extra condition implies n2 and n3 are
black vertices since n2 is black vertex through extra condition and
after that n3 is black vertex through color-change rule. Hence V (G)
(iii) if S = {n4 , n5 } is a set of black vertices, then n1 is black through

“the color-change rule” since n1 in only white neighbor of n4 . After
that n3 is black through extra condition. After that n2 in only
white neighbor of n1 . So n2 is black through “the color-change rule”.
Thus the color-change rule and extra condition imply n1 , n3 , and n2
are black vertices. Hence V (G) is turned black after finitely many
(iv) if S = {n2 , n5 } is a set of black vertices, then n1 is black through


{n2 , n3 },{n2 , n4 },{n2 , n5 },{n3 , n4 },{n3 , n5 }, and {n4 , n5 };

{n2 , n5 }.
125
3. Extended Notions

3.11 Case 2: Star Model alongside its Failed

1-Zero-Forcing Number and its Failed 1-Zero-Forcing
Neutrosophic-Number
Step 4. (Solution) The neutrosophic graph alongside its failed 1-zero-forcing

number and its failed 1-zero-forcing neutrosophic-number as model,
propose to use specific number. Every subject has connection with every
given subject in deemed way. Thus the connection isn’t applied as possible
and the model don’t demonstrate 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 holds for other types such that star, wheel, path, and
cycle. The collection of situations is another application of failed 1-zero-
forcing number and 1-failed zero-forcing neutrosophic-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 in the formation of one model as Figure (3.36).
This model is neutrosophic strong as individual. And the study proposes
using specific number which is called failed 1-zero-forcing number and
failed 1-zero-forcing neutrosophic-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 (3.36). There
is one section for clarifications.

126
3.12. Open Problems
neighbors of n1 . Thus the color-change rule doesn’t imply n2 and
n3 are black vertices but but extra condition implies n2 and n3 are
black vertices since n2 is black vertex through extra condition and
after that n3 is black vertex through color-change rule. Hence V (G)
(iii) if S = {n4 , n5 } is a set of black vertices, then n1 is black through
color-change rule” since n1 in only white neighbor of n2 . After that
n3 is black through extra condition. After that n4 and n5 are white
neighbors of n1 . So n4 isn’t black through “the color-change rule”.
Thus the color-change rule and extra condition don’t imply n5 and
n4 are black vertices. Hence V (G) isn’t turned black after finitely
many applications of “the color-change rule” and extra condition.
Hence S = {n2 } could form failed 1-zero-forcing number;
{n1 },{n2 },{n3 },{n4 }, and {n5 };
(vi) 1.9 is failed 1-zero-forcing neutrosophic-number and its corresponded
set is {n1 }.
3.12 Open Problems

Notion concerning 1-zero-forcing number, 1-zero-forcing neutrosophic-number,
failed 1-zero-forcing number and failed 1-zero-forcing neutrosophic-number are
defined in neutrosophic graphs. Neutrosophic number is also reused. Thus,
Question 3.12.1. Is it possible to use other types of 1-zero-forcing number,
1-zero-forcing neutrosophic-number, failed 1-zero-forcing number and failed 1-
zero-forcing neutrosophic-number arising from operations of different vertices
to define new 1-zero-forcing number, 1-zero-forcing neutrosophic-number, failed
1-zero-forcing number and failed 1-zero-forcing neutrosophic-number?
Question 3.12.2. Are existed some connections amid different types of 1-
zero-forcing number, 1-zero-forcing neutrosophic-number, failed 1-zero-forcing
number and failed 1-zero-forcing neutrosophic-number in neutrosophic graphs?
behavior?
127
3. Extended Notions

independent study?

This study uses four definitions concerning 1-zero-forcing number, 1-zero-
forcing neutrosophic-number, failed 1-zero-forcing number and failed 1-zero-
forcing neutrosophic-number arising operations of different vertices to study
neutrosophic graphs. New neutrosophic number is reused which is too close to
the notion of neutrosophic number but it’s different since it uses all values as
type-summation on them. Comparisons amid number and edges are done by
using neutrosophic tool. The connections of vertices which aren’t clarified by
unique edges differ them from each other and put them in different categories
to represent a number which its value is called either 1-zero-forcing number,
1. 1-Zero-Forcing Number 1. Wheel-Neutrosophic Graphs
2. 1-Zero-Forcing Neutrosophic-Number
3. Failed 1-Zero-Forcing Number 2. Study on Families
4. Failed 1-Zero-Forcing Neutrosophic-Number
5. Using Operations of Vertices 3. Same Models in Family
1-zero-forcing neutrosophic-number, failed 1-zero-forcing number or failed 1-

zero-forcing neutrosophic-number. 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.
128
Bibliography
Ref1 [1] Henry Garrett, “Zero Forcing Number in Neutrosophic Graphs”, Re-
searchGate 2022 (doi: 10.13140/RG.2.2.32265.93286).
Ref2 [2] Henry Garrett, “Failed Zero-Forcing Number in Neutrosophic Graphs”,
ResearchGate 2022 (doi: 10.13140/RG 2.2.24873.47209).
Ref3 [3] Henry Garrett, “(Failed)1-Zero-Forcing Number in Neutrosophic Graphs”,
129

0034 - Zero Forcing Number in Neutrosophic Graphs

Uploaded by

Copyright:

Available Formats

You might also like

0034 - Zero Forcing Number in Neutrosophic Graphs

Uploaded by

Document Information

Original Title

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

0034 - Zero Forcing Number in Neutrosophic Graphs

Uploaded by

Copyright:

Available Formats

Zero Forcing Number in

Dr. Henry Garrett

intended set but in complete-t-partite-neutrosophic graphs, a set of vertices

neutrosophic-number Zn0 (N T G) for a neutrosophic graph N T G : (V, E, σ, µ) is

List of Tables xiii

2.10 Open Problems . . . . . . . . . . . . . . . . . . . . . . . . . . 67

1.1 A Neutrosophic Graph in the Viewpoint of its Zero Forcing Number

2.1 A Neutrosophic Graph in the Viewpoint of its Failed Zero-Forcing

2.2 A Neutrosophic Graph in the Viewpoint of its Failed Zero-Forcing

3.1 A Neutrosophic Graph in the Viewpoint of its 1-Zero-Forcing

3.10 A Neutrosophic Graph in the Viewpoint of its 1-Zero-Forcing Number. 90

3.35 A Neutrosophic Graph in the Viewpoint of its 1-Zero-Forcing

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-

1.1 Zero Forcing Number in Neutrosophic Graphs

AMS Subject Classification: 05C17, 05C22, 05E45

1.3 Motivation and Contributions

section “Setting of Neutrosophic Zero Forcing Number,”, neutrosophic zero

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

(i) : a sequence of vertices P : x0 , x1 , · · · , xO is called path where xi xi+1 ∈

(iii) : connectedness amid vertices x0 and xt is

(iv) : a sequence of vertices P : x0 , x1 , · · · , xO is called cycle where xi xi+1 ∈

(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).

The main definition is presented in next section. The notions of quasi-

(i) Zero forcing number Z(N T G) for a neutrosophic graph N T G :

(ii) Zero forcing neutrosophic-number Zn (N T G) for a neutrosophic

1.5 Setting of Neutrosophic Zero Forcing Number

In next result, a complete-neutrosophic graph is considered in the way that,

Proof. Suppose N T G : (V, E, σ, µ) is a complete-neutrosophic graph. Every

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

(i) if S = {n3 , n4 } is a set of black vertices, then n2 is white neighbor of n3

(ii) if S = {n2 , n3 , n4 } is a set of black vertices, then n1 is only white neighbor

(iii) if S = {n1 , n2 , n4 } is a set of black vertices, then n3 is only white neighbor

(iv) if S = {n1 , n3 , n4 } is a set of black vertices, then n2 is only white neighbor

(vi) 3.9 is zero forcing neutrosophic-number and its corresponded set is

In next result, a path-neutrosophic graph is considered and zero forcing

Proposition 1.5.3. Let N T G : (V, E, σ, µ) be a path-neutrosophic graph. Then

Proof. Suppose N T G : (V, E, σ, µ) is a path-neutrosophic graph. Every non-leaf

In next part, one odd-path-neutrosophic graph is depicted. Zero forcing

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

(i) if S = {n3 , n4 } is a set of black vertices, then n2 is only white

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

(i) if S = {n3 , n4 } is a set of black vertices, then n2 is only white

In other side, n5 is only white neighbor of n4 . Thus the color-change

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

Proof. Suppose N T G : (V, E, σ, µ) is a cycle-neutrosophic graph. Every vertex

The clarifications about results are in progress as follows. An odd-cycle-

(a) In Figure (1.5), an even-cycle-neutrosophic graph is illustrated. Some

(i) if S = {n3 , n4 } is a set of black vertices, then n2 is only white

(ii) if S = {n3 , n4 , n5 } is a set of black vertices, then n2 is only white

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

Proof. Suppose N T G : (V, E, σ, µ) is a star-neutrosophic graph. Every vertex is

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

(i) if S = {n2 , n3 , n4 , n5 } is a set of black vertices, then n1 is only white