Neutrosophic Chromatic

Number
Ideas | Approaches | Accessibility | Availability

Dr. Henry Garrett

Report | Exposition | References | Research #22 2021
 Abstract

Different edges define new form of connections amid vertices. Thus defining new
notion of coloring is possible when the connections of vertices which determine
new color and it’s decider whether using new color or not, have been considered
if they’ve special edges. The tools to define specific edges are studied. One
notion is to use the connectedness to have two different types of numbers which
are neutrosophic chromatic number and chromatic number. Other notion is to
use the idea of neutrosophic strong to get specific edges which are eligible to
define new numbers. Some classes of neutrosophic graphs are studied in the
the terms of different types of chromatic numbers and neutrosophic chromatic
numbers. This book is based on neutrosophic graph theory which is designed
to study different types of coloring in that graphs to get new ideas and new
results. The results concern specific classes of neutrosophic graphs.
This book is based on neutrosophic graph theory which is designed to study different
types of coloring in that graphs to get new ideas and new results. The results concern
specific classes of neutrosophic graphs.

i
 Acknowledgements

The author is going to say 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 The words of mind and the
from the words, notions, ideas and approaches to have the material which is minds of words, are too
eligible to be in the stage
only the way to flourish the minds, the growing the notions, advancing ways of aknowledgements
and making the stable ways to be amid the events and storms of minds for
surviving from them and making the outstanding experiences about the tools
and ideas to be on the star lines of words and shining like stars, forever.

iii
 Contents

Abstract i

Acknowledgements iii

Contents v

List of Figures vi

List of Tables vii

1 Definitions 1
1.1 Chromatic Number and Neutrosophic Chromatic Number . . 2
1.2 Neutrosophic Chromatic Number Based on Connectedness . . 10

2 New Ideas 25
2.1 Different Types of Neutrosophic Chromatic Number . . . . . . 25

3 New Results 31
3.1 Different Types of Neutrosophic Chromatic Number . . . . . . 31

Bibliography 57

v
 List of Figures

1.1 Neutrosophic Graph, N1 . . . . . . . . . . . . . . . . . . . . . . . . 4

1.2 Black vertices are suspicions about choosing them. . . . . . . . . 8
1.3 Neutrosophic graph N1 is considered with respect to first order.
It’s complete but it isn’t neutrosophic complete. It’s cycle but it
isn’t neutrosophic cycle. It’s neutrosophic 3-partite but it isn’t
neutrosophic complete 3-partite. . . . . . . . . . . . . . . . . . . . 12
1.4 Black vertices are suspicions about choosing them. . . . . . . . . 22

2.1 Two edges aren’t type-I. . . . . . . . . . . . . . . . . . . . . . . . 27

2.2 Neutrosophic graph which is fixed-edge but not strong fixed-vertex. 28

3.1 Black vertices are suspicions about choosing them. . . . . . . . . 55

vi
 List of Tables

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

sophic Graph in a Model. . . . . . . . . . . . . . . . . . . . . . . . 9
1.2 A Brief Overview about Advantages and Limitations of this study 10
1.3 Scheduling concerns its Subjects and its Connections as a Neutro-
sophic Graph in a Model. . . . . . . . . . . . . . . . . . . . . . . . 23
1.4 A Brief Overview about Advantages and Limitations of this study 24

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

sophic Graph in a Model. . . . . . . . . . . . . . . . . . . . . . . . 55
3.2 A Brief Overview about Advantages and Limitations of this study 56

vii
 CHAPTER 1

Definitions

To clarify about
the definitions, The reference [Ref4] is used to write the contents of this chapter. For further
I use some studies, the references [Ref1; Ref2; Ref3; Ref4; Ref5; Ref6; Ref7; Ref8;
examples and in
Ref9; Ref10] are suggested.
this way,
exemplifying has
Definition 1.0.1. G : (V, E) is called a crisp graph where V is a set of objects
key role to make
sense about the and E is a subset of V × V such that this subset is symmetric.
definitions and
to introduce new Definition 1.0.2. A crisp graph G : (V, E) is called a neutrosophic graph
ways to use on G : (σ, µ) where σ = (σ1 , σ2 , σ3 ) : V → [0, 1] and µ = (µ1 , µ2 .µ3 ) : E → [0, 1]
these models in such that µ(xy) ≤ σ(x) ∧ σ(y) for all xy ∈ E.
the terms of new
notions. Definition 1.0.3. A neutrosophic graph is called neutrosophic empty if it
has no edge. It’s also called neutrosophic trivial. A neutrosophic graph
which isn’t neutrosophic empty, is called neutrosophic nontrivial.
Definition 1.0.4. A neutrosophic graph G : (σ, µ) is called a neutrosophic
complete where it’s complete and µ(xy) = σ(x) ∧ σ(y) for all xy ∈ E.
Definition 1.0.5. A neutrosophic graph G : (σ, µ) is called a neutrosophic
strong where µ(xy) = σ(x) ∧ σ(y) for all xy ∈ E.
Definition 1.0.6. A path v0 , v1 , · · · , vn is called neutrosophic path where
µ(vi vi+1 ) > 0, i = 0, 1, · · · , n − 1. i-path is a path with i edges, it’s also called
length of path.
Definition 1.0.7. A crisp cycle v0 , v1 , · · · , vn , v0 is called neutrosophic
cycle
V where there are two edges xy and uv such that µ(xy) = µ(uv) =
i=0,1,··· ,n−1 µ(vi vi+1 ).

Definition 1.0.8. A neutrosophic graph is called neutrosophic t-partite if

V is partitioned to t parts, V1 , V2 , · · · , Vt and the edge xy implies x ∈ Vi
and y ∈ Vj where i 6= j. If it’s neutrosophic complete, then it’s denoted by
Kσ1 ,σ2 ,··· ,σt where σi is σ on Vi instead V which mean x 6∈ Vi induces σi (x) = 0.
If t = 2, then it’s called neutrosophic complete bipartite and it’s denoted
by Kσ1 ,σ2 especially, if |V1 | = 1, then it’s called neutrosophic star and it’s
denoted by S1,σ2 . In this case, the vertex in V1 is called center and if a vertex
joins to all vertices of neutrosophic cycle, it’s called neutrosophic wheel and
it’s denoted by W1,σ2 .
Definition 1.0.9. Let G : (σ, µ) be a neutrosophic graph. For any given subset
N of V, Σn∈N σ(n) is called neutrosophic cardinality of N and it’s denoted

1
1. Definitions

by |N |n .
Definition 1.0.10. Let G : (σ, µ) be a neutrosophic graph. Neutrosophic
cardinality of V is called neutrosophic order of G and it’s denoted by On (G).
Definition 1.0.11. Let G : (σ, µ) be a neutrosophic graph. The number of
vertices is denoted by n and the number of edges is denoted by m.
Definition 1.0.12. Let N = (σ, µ) be a neutrosophic graph. It’s called
neutrosophic connected if for every given couple of vertices, there’s at
least one neutrosophic path amid them.
Definition 1.0.13. Let N = (σ, µ) be a neutrosophic graph. Suppose a path
P : v0 , v1 , · · · , vn−1 , vn from v0 to vn . mini=0,1,2,··· ,n−1 µ(vi vi+1 ) is called
neutrosophic strength of P and it’s denoted by Sn (P ).
Definition 1.0.14. Let N = (σ, µ) be a neutrosophic graph. The number of
maximum edges for a vertex, amid all vertices, is denoted by ∆(N ).
First case for the contents is to use the article from [Ref10]. The contents
are used in the way that, usages of new contents are preferences and the
preliminaries are passed in the beginning of this chapter.

1.1 Chromatic Number and Neutrosophic Chromatic

Number

Abstract
New setting is introduced to study chromatic number. Neutrosophic chromatic
number and chromatic number are proposed in this way, some results are
obtained. Classes of neutrosophic graphs are used to obtains these numbers
and the representatives of the colors. Using colors to assign to the vertices
of neutrosophic graphs is applied. Some questions and problems are posed
concerning ways to do further studies on this topic. Using strong edge to define
the relation amid vertices which implies having different colors amid them and
as consequences, choosing one vertex as a representative of each color to use
them in a set of representatives and finally, using neutrosophic cardinality of
this set to compute neutrosophic chromatic number. This specific relation amid
edges is necessary to compute both chromatic number concerning the number of
representative in the set of representatives and neutrosophic chromatic number
concerning neutrosophic cardinality of set of representatives. If two vertices
have no strong edge, then they can be assigned to same color even they’ve
common edge. Basic familiarities with neutrosophic graph theory and graph
theory are proposed for this article.
Keywords: Neutrosophic Strong, Neutrosophic Graphs, Chromatic Number

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

Motivation and Contributions

In this study, there’s an idea which could be considered as a motivation.

2
 1.1. Chromatic Number and Neutrosophic Chromatic Number

Question 1.1.1. Is it possible to use mixed versions of ideas concerning

“neutrosophic strong edges”, “neutrosophic graphs” and “neutrosophic coloring”
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. Connections amid two items have
key roles to assign colors. Thus they’re used to define new ideas which conclude
to the structure of coloring. The concept of having strong edge inspires to
study the behavior of strong edge in the way that, both neutrosophic chromatic
number and chromatic number are the cases of study.
The framework of this study is as follows. In the beginning of chapter, I
introduced basic definitions to clarify about preliminaries. In subsection
“Chromatic Number and Neutrosophic Chromatic Number”, new notion of
coloring is applied to the vertices of neutrosophic graphs. Neutrosophic strong
edge has the key role in this way. Classes of neutrosophic graphs are studied when
the edges are neutrosophic strong. In subsection “Applications in Time Table
and Scheduling”, one application is posed for neutrosophic graphs concerning
time table and scheduling when the suspicions are about choosing some subjects.
In subsection “Open Problems”, some problems and questions for further
studies are proposed. In subsection “Conclusion and Closing Remarks”, gentle
discussion about results and applications are featured. In subsection “Conclusion
and Closing Remarks”, a brief overview concerning advantages and limitations
of this study alongside conclusions are formed.

Chromatic Number and Neutrosophic Chromatic Number

sec2
Definition 1.1.2. Let N = (σ, µ) be a neutrosophic graph. Chromatic
number is minimum number of distinct colors which are used to color the
vertices which have neutrosophic strong edge. Neutrosophic cardinality of the
set of these distinct colors when it’s minimum amid all of these sets, is called
neutrosophic chromatic number with respect with first order.
Example 1.1.3. Consider Figure (1.1). The chromatic number is three and
neutrosophic chromatic number is 2.57 with respect to first order.
Neutrosophic chromatic number of some classes of neutrosophic graphs are
computed.
Proposition 1.1.4. Let N = (σ, µ) be a neutrosophic complete. Then chromatic
number is n and neutrosophic chromatic number is neutrosophic order.

Proof. All edges are neutrosophic strong. Every vertex has edge with n − 1
vertices. Thus n is chromatic number. Since any given vertex has different color
in comparison to another vertex, neutrosophic cardinality of V is neutrosophic
chromatic number. Therefore, neutrosophic chromatic number is neutrosophic
order. 

Proposition 1.1.5. Let N = (σ, µ) be a neutrosophic strong path. Then

chromatic number is two and neutrosophic chromatic number is

min {σ(x) + σ(y)}.

x and y have different colors

3
1. Definitions

Figure 1.1: Neutrosophic Graph, N1 nsc1

Proof. With alternative colors, neutrosophic strong path has distinct color
for every vertices which have one edge in common. Thus if x and y are two
vertices which have one edge in common, then x and y have different color.
Therefore, chromatic number is two. The representative of colors are a vertex
with minimum value amid all vertices which have same color with it. Thus,

min {σ(x) + σ(y)}.

x and y have different colors

Proposition 1.1.6. Let N = (σ, µ) be an even neutrosophic strong cycle. Then

chromatic number is two and neutrosophic chromatic number is

min {σ(x) + σ(y)}.

x and y have different colors

Proof. All edges are neutrosophic strong. Since the cycle has even vertices,
with alternative coloring of vertices, the vertices which have common edge, have
different colors. So chromatic number is two. With every color, the vertex which
has minimum value amid vertices with same color with it, is representative of
that color. Thus,

min {σ(x) + σ(y)}.

x and y have different colors

Proposition 1.1.7. Let N = (σ, µ) be an odd neutrosophic strong cycle. Then

chromatic number is three and neutrosophic chromatic number is

min {σ(x) + σ(y) + σ(z)}.

x,y and z have different colors

4
 1.1. Chromatic Number and Neutrosophic Chromatic Number

Proof. With alternative coloring on vertices, at end, two vertices have same
color, and they’ve same edge. So, chromatic number is three. Since the colors
are three, the vertices with minimum values in every color, are representatives.
Hence,
min {σ(x) + σ(y) + σ(z)}.
x,y and z have different colors

Proposition 1.1.8. Let N = (σ, µ) be a neutrosophic strong star with c as

center. Then chromatic number is two and neutrosophic chromatic number is

min {σ(c) + σ(x)}.

x is non-center vertex

Proof. All edges are neutrosophic strong. Center vertex has common edge with
every given vertex. So it has different color in comparison to other vertices. So
one color has only one vertex which has that color. All non-center vertices have
no common edge amid each other. Then they’ve same color. The representative
of this color is a non-center vertex which has minimum value amid all non-center
vertices. Hence,
min {σ(c) + σ(x)}.
x is non-center vertex

Proposition 1.1.9. Let N = (σ, µ) be a neutrosophic strong wheel with c as

center. Then chromatic number is three where neutrosophic cycle has even
number as its length and neutrosophic chromatic number is

min {σ(c) + σ(x) + σ(y)}.

x,y are non-center vertices and have different colors

Proof. Center vertex has unique color. So it’s only representative of this color.
Non-center vertices form a neutrosophic cycle which have distinct colors for the
vertices which have common edge with each other when the number of colors is
two. So a color for center vertex and two colors for non-center vertices, make
neutrosophic strong wheel has distinct colors for vertices which have common
edge. Hence, chromatic number is three when the non-center vertices form odd
cycle. Therefore,

min {σ(c) + σ(x) + σ(y)}.

x,y are non-center vertices and have different colors

Proposition 1.1.10. Let N = (σ, µ) be a neutrosophic strong wheel with c as

center. Then chromatic number is four where neutrosophic cycle has odd number
as its length and neutrosophic chromatic number is

min {σ(c) + σ(x) + σ(y) + σ(z)}.

x,y,z are non-center vertices and have different colors

Proof. All edges are neutrosophic strong and non-center vertices form odd
neutrosophic strong cycles. Odd neutrosophic strong cycle have chromatic
number which is three. Non-center vertex has same edges with all non-center
vertices. Thus non-center vertex has different colors with non-center vertices.

5
1. Definitions

Therefore, chromatic number is four. Four representatives of colors form

neutrosophic chromatic number where one representative is center vertex and
other three representatives are non-center vertices. So,

min {σ(c) + σ(x) + σ(y) + σ(z)}.

x,y,z are non-center vertices and have different colors

Proposition 1.1.11. Let N = (σ, µ) be a neutrosophic complete bipartite. Then

chromatic number is two and neutrosophic chromatic number is

min {σ(x) + σ(y)}.

x and y are in different parts

Proof. Every given vertex has neutrosophic strong edge with all vertices from
another part. So the color of every vertex which is in a same part is same.
Hence, two parts implies two different colors. It induces chromatic number is
two. The minimum value of a vertex amid all vertices in every part, identify
the representative of every color. Therefore,

min {σ(x) + σ(y)}.

x and y are in different parts

Proposition 1.1.12. Let N = (σ, µ) be a neutrosophic complete t−partite. Then

chromatic number is t and neutrosophic chromatic number is

min {σ(x1 ) + σ(x2 ) + · · · + σ(xt )}.

x1 ,x2 ,··· ,xt are in different parts

Proof. Every part has same color for its vertices. So chromatic number is
t. Every part introduces one vertex as a representative of its color. Thus,
neutrosophic chromatic number is

min {σ(x1 ) + σ(x2 ) + · · · + σ(xt )}.

x1 ,x2 ,··· ,xt are in different parts

Proposition 1.1.13. Let N = (σ, µ) be a neutrosophic strong. Then chromatic

number is 1 if and only if N = (σ, µ) is neutrosophic empty.

Proof. (⇒). Let chromatic number be 1. It implies there’s no vertex which

has same edge with a vertex. So there’s no neutrosophic strong edge. Since
N = (σ, µ) is a neutrosophic strong, N = (σ, µ) is a neutrosophic empty.
(⇐). Let N = (σ, µ) be neutrosophic empty and neutrosophic strong. Hence
there’s no edge. It implies for every given vertex, there’s no common
neutrosophic strong edge. It induces there’s only one color for vertices. Hence
the representative of this color is chosen from n vertices. Thus chromatic
number is 1. 

Proposition 1.1.14. Let N = (σ, µ) be a neutrosophic strong. Then chromatic

number is 2 if and only if N = (σ, µ) is neutrosophic complete bipartite.

6
 1.1. Chromatic Number and Neutrosophic Chromatic Number

Proof. (⇒). Let chromatic number be two. So every vertex has either one
vertex or two vertices with a common edge. The number of colors are two so
there are two sets which each set has the vertices which same color. If two
vertices have same color, then they don’t have a common edge. So every set is
a part in that, no vertex has common edge. The number of these sets is two.
Hence there are two parts in each of them, every vertex has no common edge
with other vertices. Since N = (σ, µ) is a neutrosophic strong, N = (σ, µ) is
neutrosophic complete bipartite.
(⇐). Assume N = (σ, µ) is neutrosophic complete bipartite. Then all edges
are neutrosophic strong. Every part has the vertices which have no edge in
common. So they’re assigned to have same color. There are two parts. Thus
there are two colors to assign to the vertices in that, the vertices with common
edge, have different colors. It induces chromatic number is 2. 

Proposition 1.1.15. Let N = (σ, µ) be a neutrosophic strong. Then chromatic

number is n if and only if N = (σ, µ) is neutrosophic complete.

Proof. (⇒). Let chromatic number be n. So any given vertex has n vertices
which have common edge with them and every of them have common edge with
each other. It implies every vertex has n vertices which have common edge with
them. Since N = (σ, µ) is a neutrosophic strong, N = (σ, µ) is neutrosophic
complete.
(⇐). Suppose N = (σ, µ) is neutrosophic complete. Every vertex has n vertices
which have common edge with them. Since all edges are neutrosophic strong,
the minimum number of colors are n. Thus chromatic number is n. 

General bounds for neutrosophic chromatic number are computed.

Proposition 1.1.16. Let N = (σ, µ) be a neutrosophic graph. Then chromatic
number is at most the number of vertices and neutrosophic chromatic number is
at most neutrosophic order.

Proof. When every vertex is a representative of each color, chromatic number

is the number of vertices and it happens in chromatic number of neutrosophic
complete which is n. When all vertices have distinct colors, neutrosophic
chromatic number is neutrosophic order and it’s sharp for neutrosophic
complete. 

The relation amid neutrosophic chromatic number and main parameters of

neutrosophic graphs is computed.
Proposition 1.1.17. Let N = (σ, µ) be a neutrosophic strong. Then chromatic
number is at most ∆ + 1 and at least 2.

Proof. Neutrosophic strong is neutrosophic nontrivial. So it isn’t neutrosophic

empty which induces there’s no edge. It implies chromatic number is two. Since
chromatic number is one if and only if N = (σ, µ) is neutrosophic empty if
and only if N = (σ, µ) is neutrosophic trivial. A vertex with degree ∆, has ∆
vertices which have common edges with them. If these vertices have no edge
amid each other, then chromatic number is two especially, neutrosophic star. If
not, then in the case, all vertices have edge amid each other, chromatic number
is ∆ + 1, especially, neutrosophic complete. 

7
 1. Definitions

Proposition 1.1.18. Let N = (σ, µ) be a neutrosophic r−regular. Then

chromatic number is at most r + 1.

Proof. N = (σ, µ) is a neutrosophic r−regular. So any of vertex has r vertices

which have common edge with it. If these vertices have no common edge with
each other, for instance neutrosophic star, chromatic number is two. But since
the vertices have common edge with each other, chromatic number is r + 1, for
instance, neutrosophic complete. 

Applications in Time Table and Scheduling

sec3
Designing the programs to achieve some goals is general approach to apply on
some issues to function properly. Separation has key role in the context of this
style. Separating the duration of work which are consecutive, is the matter and
it has important 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 section. Beyond that, sometimes sections are not the same.

Step 3. (Model) As Figure (1.2), the situation is designed as a model. The

model uses data to assign every section and to assign to relation amid
section, three numbers belong unit interval to state indeterminacy,
possibilities and determinacy. There’s one restriction in that, the numbers
amid two section is at least the number of the relation amid them. Table
(1.1), clarifies about the assigned numbers to these situation.

Figure 1.2: Black vertices are suspicions about choosing them. fgr1

Step 4. (Solution) As Figure (1.2) shows, neutrosophic model, propose to use

chromatic number 2 in the case with is titled T 0 . In this case, i1 and
c1 are representative of these two colors and neutrosophic chromatic
number is 1.4. The set {i1 , c1 } contains representatives of colors which
pose chromatic number and neutrosophic chromatic number. Thus the

8
 1.1. Chromatic Number and Neutrosophic Chromatic Number

Table 1.1: Scheduling concerns its Subjects and its Connections as a

Neutrosophic Graph in a Model. tbl1

Sections of T s1 s2 s3 s4 s5 s6 s7 s8 s9 , s10
Values 0.1 0.8 0.7 0.8 0.1 0.3 0.6 0.5 0.2
Connections of T s1 s2 s2 s3 s3 s4 s4 s5 s5 s6 s6 s7 s7 s8 s8 s9 s9 s10
Values 0.1 0.6 0.4 0.1 0.1 0.2 0.4 0.2 0.1

decision amid choosing the subject c1 an c2 is concluded to choose c1 . To

get brief overview, neutrosophic model uses one number for every array
so 0.9 means (0.9, 0.9, 0.9). In Figure (1.2), the neutrosophic model T
introduce the common situation. The representatives of colors are i2 and
c1 . Thus chromatic number is two and neutrosophic chromatic number is
1.4. Thus suspicion about choosing i1 and i2 is determined to be i2 . The
sets of representative for colors are {i2 , c1 }.

Open Problems
sec4
The two notions of coloring of vertices concerning neutrosophic chromatic
number and chromatic number are defined on neutrosophic graphs when
neutrosophic strong edges have key role to have these notions. Thus
Question 1.1.19. Is it possible to use other types edges to define chromatic
number and neutrosophic chromatic number?
Question 1.1.20. Is it possible to use other types of ways to make number to
define chromatic number and neutrosophic chromatic number?
Question 1.1.21. Which classes of neutrosophic graphs have the eligibility to
pursue independent study in this way?
Question 1.1.22. Which applications do make an independent study to define
chromatic number and neutrosophic chromatic number?
Problem 1.1.23. Which approaches do work to construct classes of neutrosophic
graphs to continue this study?
Problem 1.1.24. Which approaches do work to construct applications to create
independent study?
Problem 1.1.25. Which approaches do work to construct definitions which use
all three arrays and the relations amid them instead of one array of three arrays
to create independent study?

Conclusion and Closing Remarks

sec5
This study uses mixed combinations of neutrosophic chromatic number and
chromatic number to study on neutrosophic graphs. The connections of vertices
which are clarified by neutrosophic strong edges, differ them from each other
and and put them in different categories to represent one representative for
each color. Further studies could be about changes in the settings to compare
this notion amid different settings of graph theory. One way is finding some

9
1. Definitions

relations amid array of vertices to make sensible definitions. In Table (1.2),

some limitations and advantages of this study is pointed out. Second case for

Table 1.2: A Brief Overview about Advantages and Limitations of this study tbl2

Advantages Limitations
1. Using neutrosophic strong edges 1. Using only one array of three arrays

2. Using neutrosophic cardinality

3. Using cardinality 2. Study on a few classes

4. Characterizing smallest number

5. Characterizing biggest number 3. Quality of Results

the contents is to use the article from [Ref11]. The contents are used in the way
that, usages of new contents are preferences and the preliminaries are passed in
the beginning of this chapter.

1.2 Neutrosophic Chromatic Number Based on

Connectedness
Abstract
New setting is introduced to study chromatic number. vital chromatic number
and n-vital chromatic number are proposed in this way, some results are
obtained. Classes of neutrosophic graphs are used to obtains these numbers
and the representatives of the colors. Using colors to assign to the vertices
of neutrosophic graphs is applied. Some questions and problems are posed
concerning ways to do further studies on this topic. Using vital edge from
connectedness to define the relation amid vertices which implies having different
colors amid them and as consequences, choosing one vertex as a representative of
each color to use them in a set of representatives and finally, using neutrosophic
cardinality of this set to compute vital chromatic number. This specific relation
amid edges is necessary to compute both vital chromatic number concerning
the number of representative in the set of representatives and n-vital chromatic
number concerning neutrosophic cardinality of set of representatives. If two
vertices have no vital edge, then they can be assigned to same color even they’ve
common edge. Basic familiarities with neutrosophic graph theory and graph
theory are proposed for this article.
Keywords: Neutrosophic Connctedness, Neutrosophic Graphs, Chromatic

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

Motivation and Contributions

In this study, there’s an idea which could be considered as a motivation.

10
 1.2. Neutrosophic Chromatic Number Based on Connectedness

Question 1.2.1. Is it possible to use mixed versions of ideas concerning

“connectedness”, “neutrosophic graphs” and “neutrosophic coloring” 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. Connections amid two items have key
roles to assign colors. Thus they’re used to define new ideas which conclude to
the structure of coloring. The concept of having vital edge from connectedness
inspires me to study the behavior of vital edge in the way that, both vital
chromatic number and n-vital number are the cases of study.
The framework of this study is as follows. In the beginning of chapter, I
introduced basic definitions to clarify about preliminaries. In subsection
“Definitions and Clarification”, new notion of coloring is applied to the vertices
of neutrosophic graphs. Vital edge from connectedness has the key role
in this way. Classes of neutrosophic graphs are studied in the terms of
vital edges. In subsection “Applications in Time Table and Scheduling”,
one application is posed for neutrosophic graphs concerning time table and
scheduling when the suspicions are about choosing some subjects. In subsection
“Open Problems”, some problems and questions for further studies are proposed.
In subsection “Conclusion and Closing Remarks”, gentle discussion about results
and applications are featured. In subsection “Conclusion and Closing Remarks”,
a brief overview concerning advantages and limitations of this study alongside
conclusions are formed.

Definitions and Clarification

Definition 1.2.2. Let N = (σ, µ) be a neutrosophic graph. A neutrosophic edge
xy is called vital if deletion of xy has no change on its connectedness which
is a maximum strength of paths amid them.
Definition 1.2.3. Let N = (σ, µ) be a neutrosophic graph. A vertex which has
common vital edge with another vertex, has assigned different color from that
vertex. The number of different colors, is called vital chromatic number and
its neutrosophic cardinality is called n-vital chromatic number.
Example 1.2.4. Assume Figure (1.3) with respect to first order.

(i) : Only vital edge is n2 n3 . Other edges aren’t vital.

(ii) : The vertices n2 and n3 have different colors.

(iii) : The vertex n1 could get any color.

(iv) : The vertex n1 has no vital edge with any given vertex.

(v) : The set of representatives of colors is {n1 , n2 }.

(vi) : Amid n2 and n3 , n2 has minimum value.

(vii) : Deletion of edge n1 n2 has no change in the connectedness of obtained

neutrosophic graph.

(viii) : The vital number is two.

11
 1. Definitions

(ix) : n-vital chromatic number is 2.57.

Figure 1.3: Neutrosophic graph N1 is considered with respect to first order. It’s
complete but it isn’t neutrosophic complete. It’s cycle but it isn’t neutrosophic
cycle. It’s neutrosophic 3-partite but it isn’t neutrosophic complete 3-partite. nsc1b

Basic Properties
prp5b Proposition 1.2.5. Let N = (σ, µ) be a neutrosophic cycle. Then all edges are
vital.

Proof. Consider N = (σ, µ) be a neutrosophic cycle. Hence, there are at least

two edges which are weakest, it means there are xy, uv ∈ E such that

µ(uv) = µ(xy) = min µ(e).

e∈E

In other hand, for every given vertices x and y, there are two paths from x to
y. So for every given path,

S(P ) = min µ(e).

e∈E

Thus for every x, y ∈ V, xy ∈ E, the value µ(xy) forms the connectedness amid
x to y. Therefore connectedness amid any given couple of vertices, doesn’t
change when they form an edge and they’re deleted. It induces every edge is
vital. 

prp6b Proposition 1.2.6. Let N = (σ, µ) be a neutrosophic complete which is neither

neutrosophic empty nor neutrosophic path. Then all edges are vital.

12
 1.2. Neutrosophic Chromatic Number Based on Connectedness

Proof. Suppose N = (σ, µ) is a neutrosophic complete which is neither

neutrosophic empty nor neutrosophic path. If x, y ∈ V, then xy ∈ E. Thus
P : x, y is a path for every given couple of vertices. Hence

S(P ) = µ(xy).

Therefore, connectedness ≥ µ(xy). In other hands, assume P 0 : x, · · · , y is an

arbitrary path from x to y. By N = (σ, µ) is a neutrosophic complete, N = (σ, µ)
is a neutrosophic strong. By N = (σ, µ) is a neutrosophic strong,

S(P 0 ) ≤ µ(xy).

Then connectedness ≤ S(P ). It implies connectedness ≤ µ(xy). To sum it up,

connectedness = µ(xy). It induces xy is vital. 

Proposition 1.2.7. Let N = (σ, µ) be a neutrosophic graph which is fixed-edge

and which is neither neutrosophic empty nor neutrosophic path. Then all edges
are vital.

Proof. Assume N = (σ, µ) is a neutrosophic graph which is fixed-edge and

which is neither neutrosophic empty nor neutrosophic path. ByN = (σ, µ) is a
fixed-edge,
∀e, e0 ∈ E, µ(e) = µ(e0 ).
It induces for every given edge e and every given paths P, P 0

S(P ) = S(P 0 ) = µ(e).

It implies connectedness is fixed and it equals to µ(e) where e ∈ E. Therefore,

the deletion of e has no change on connectedness amid every couple of vertices.
It means every edge is vital. 

prp8b Proposition 1.2.8. Let N = (σ, µ) be a neutrosophic graph which is neither

neutrosophic empty nor neutrosophic path. Then there’s at least one vital edge.

Proof. Consider N = (σ, µ) is a neutrosophic graph which is neither

neutrosophic empty nor neutrosophic path. Assume N = (σ, µ) is a neutrosophic
graph which is either fixed-edge or fixed-vertex and neutrosophic strong. Hence,
all edges have same value. It means

∀e, e0 ∈ E, µ(e) = µ(e0 ).

It induces for every given edge e and every given paths P, P 0

S(P ) = S(P 0 ) = µ(e).

It implies connectedness is fixed and it equals to µ(e) where e ∈ E. Therefore,

the deletion of e has no change on connectedness amid every couple of vertices.
It means every edge is vital. In other hand, suppose otherwise. So by |E| > 2,
there’s one edge e such that for every edge e0 6= e,

µ(e) > µ(e0 ).

Let a number µ(e0 ) be

min µ(e).
e∈E

13
 1. Definitions

Then connectedness is ≥ µ(e0 ). But there’s a cycle which implies |E| > 3.
It induces there are at least two paths corresponded to e0 . By µ(e) > µ(e0 ),
connectedness ≥ µ(e0 ). It implies corresponded connectedness to e0 isn’t changed
when the deletion of e0 is done. Thus the edge e0 ∈ E is vital. 

prp9b Proposition 1.2.9. Let N = (σ, µ) be a neutrosophic strong which is fixed-vertex

and which is neither neutrosophic empty nor neutrosophic path. Then all edges
are vital.

Proof. Assume N = (σ, µ) is a neutrosophic strong which is fixed-vertex and

which is neither neutrosophic empty nor neutrosophic path. Thus by N = (σ, µ)
is a neutrosophic fixed-vertex, for all v, v 0 ∈ V,

σ(v) = σ(v 0 ).

By N = (σ, µ) is a neutrosophic strong, for all e, e0 ∈ V,

µ(e) = µ(e0 ).

It induces for every couple of vertices which form an edge, connectedness amid
them is same and equals µ(e) where e is a given edge. It implies at least there
are two paths with strength µ(e). Thus deletion of every edge has no change
on connectedness amid its vertices. Therefore, every edge is vital. 

Proposition 1.2.10. Let N = (σ, µ) be a neutrosophic graph which is fixed-

vertex and complete. Then all edges are vital.

Proof. By N = (σ, µ) is neutrosophic complete, N = (σ, µ) is neutrosophic

strong. By N = (σ, µ) is a neutrosophic graph which is fixed-vertex, complete
and applying Proposition (1.2.9), all edges are vital. 

prp11b Proposition 1.2.11. Let N = (σ, µ) be a neutrosophic graph which is fixed-edge.

Then all edges are vital.

Proof. Suppose N = (σ, µ) is a neutrosophic graph which is fixed-edge. Then

for every edges e and e0 ,
µ(e) = µ(e0 ).
It means all paths has same strength which is the value of an edge since all
edges have same values. It means the connectedness amid all given couple of
vertices is the same. There are at least two paths. So deletion any edge has no
change on the connectedness amid all given couple of vertices. 

Vital Chromatic Number

Proposition 1.2.12. Let N = (σ, µ) be a neutrosophic graph which is neither
neutrosophic empty nor neutrosophic path. Then vital chromatic number is at
most n and at least 1.

Proof. These bounds are sharp and tight as they’ll be shown in upcoming
results. If there’s no edge, then vital chromatic number is 1 but if the number of
vertices are n and they’re connected to each other, then vital chromatic number
is n. 

14
 1.2. Neutrosophic Chromatic Number Based on Connectedness

Largest Vital Chromatic Number

Proposition 1.2.13. Let N = (σ, µ) be a neutrosophic complete which is neither
neutrosophic empty nor neutrosophic path. Then vital chromatic number is n.

Proof. Consider N = (σ, µ) is a neutrosophic complete which is neither

neutrosophic empty nor neutrosophic path. By Proposition (1.2.6), all edges
are vital. By N = (σ, µ) isn’t a neutrosophic path, there are at least two path
amid two given edges. In other words, there is at least one cycle. By N = (σ, µ)
is a neutrosophic complete, all vertices are connected to each other. It implies,

∀v, v 0 ∈ V, vv 0 ∈ E.

It induces all vertices have different colors. The number of vertices are n. So
vital chromatic number is n. 

Proposition 1.2.14. Let N = (σ, µ) be a neutrosophic path. Then vital

chromatic number aren’t computable.

Proof. Assume N = (σ, µ) is a neutrosophic path. Then there’s only one path
amid two given vertices. So deletion of an edge makes the connectedness amid
its vertices, to be incomputable. 

Proposition 1.2.15. Let N = (σ, µ) be a neutrosophic star. Then vital

chromatic number aren’t computable.

Proof. Consider N = (σ, µ) is a neutrosophic star. Hence there’s only one path
amid two given vertices. Thus deletion of an edge makes the connectedness
amid its vertices, to be incomputable. 

Smallest Vital Chromatic Number

Proposition 1.2.16. Let N = (σ, µ) be a neutrosophic empty. Then vital
chromatic number is 1.

Proof. Let N = (σ, µ) be a neutrosophic empty. Then there’s no edge. It

implies all vertices have same colors where the minimum number of colors are
applied. Thus vital chromatic number is 1. 

prp17b Proposition 1.2.17. Let N = (σ, µ) be a neutrosophic graph which is neither

neutrosophic empty nor neutrosophic path. Then vital chromatic number isn’t 1.

Proof. Assume N = (σ, µ) is a neutrosophic graph which is neither neutrosophic

empty nor neutrosophic path. By Proposition (1.2.8), there’s at least one vital
edge. 

Proposition 1.2.18. Let N = (σ, µ) be a neutrosophic cycle. Then vital

chromatic number is at least 2 and at most 3.

Proof. Suppose N = (σ, µ) is a neutrosophic cycle. There’s at least amid two

vertices. By Proposition (1.2.5), all edges are vital. So at least the colors
of two vertices are different. It implies vital chromatic number is at least 2.
By applying colors on vertices in alternative ways, at most two vertices have
common edges with same color. Hence vital chromatic number is at most 3. 

15
 1. Definitions

Proposition 1.2.19. Let N = (σ, µ) be an even neutrosophic cycle. Then vital

chromatic number is 2.

Proof. Assume N = (σ, µ) is an even neutrosophic cycle. By Proposition

(1.2.17), vital chromatic number is at least 2. By applying coloring on vertices
in alternative ways, two vertices with common edge, has different colors. Since
the cycle has even number of edges. Thus vital chromatic number is 2. 

Proposition 1.2.20. Let N = (σ, µ) be an odd neutrosophic cycle. Then vital

chromatic number is 3.

Proof. Consider N = (σ, µ) is an odd neutrosophic cycle. By Proposition

(1.2.5), all edges are vital. So by using coloring in alternative way, there are two
vertices which have common edge and have same color. Thus vital chromatic
number is 3. 

prp21b Proposition 1.2.21. Let N = (σ, µ) be a neutrosophic bipartite which is fixed-

edge and complete. Then vital chromatic number is 2.

Proof. Suppose N = (σ, µ) is a neutrosophic bipartite which is fixed-edge and

complete. Thus strength of every path is as same as connectedness amid two
vertices is. Thus all edges are vital. By N = (σ, µ) is complete, all vertices
from one part are connected to all vertices of another part. Every part has no
connection amid its vertices so all vertices from every part, have same color.
There are two parts. Thus vital chromatic number is 2. 

Proposition 1.2.22. Let N = (σ, µ) be a neutrosophic bipartite which is fixed-

vertex and complete. Then vital chromatic number is 2.

Proof. By N = (σ, µ) is fixed-vertex and complete, N = (σ, µ) is fixed-edge and

complete. Therefore, by Proposition (1.2.21), vital chromatic number is 2. 

prp23b Proposition 1.2.23. Let N = (σ, µ) be a neutrosophic t−partite which is fixed-

edge and complete. Then vital chromatic number is t.

Proof. By N = (σ, µ) is fixed-edge, all edges have same value. Thus all paths
have same strength. So connectedness amid two given vertices are same.
Therefore all edges are vital. Inside every part, there’s no edge amid two
vertices. It induces the vertices of every part have same color. There are t parts.
It implies t different colors are applied. Therefore vital chromatic number is
t. 

Proposition 1.2.24. Let N = (σ, µ) be a neutrosophic t−partite which is fixed-

vertex and complete. Then vital chromatic number is t.

Proof. It’s fixed-vertex and complete. So It’s fixed-edge and complete. By

Proposition (1.2.23), vital chromatic number is t. 

Proposition 1.2.25. Let N = (σ, µ) be a neutrosophic wheel which is fixed-

vertex and neutrosophic strong. Then vital chromatic number is 3 or 4.

16
 1.2. Neutrosophic Chromatic Number Based on Connectedness

Proof. Consider N = (σ, µ) is a neutrosophic wheel which is fixed-vertex and

neutrosophic strong. By it’s fixed-vertex and neutrosophic strong, it’s fixed-edge.
Every edges have same value. So strength of paths and connectedness are same
and equal to each other. Thus all edges are vital. Then the center has one
color and since it’s connected to all other vertices, the color of center is unique.
Therefore, vital chromatic number is at least 2. Non-center vertices form a path
which are colored by two colors when applying colors are in alternative ways.
Thus vital chromatic number is 3 if the non-center vertices form even color and
vital chromatic number is 4 if the non-center vertices form odd color. 

Proposition 1.2.26. Let N = (σ, µ) be a neutrosophic wheel which is fixed-edge

and neutrosophic strong. Then vital chromatic number is 3 or 4.

Proof. Consider N = (σ, µ) is a neutrosophic wheel which is fixed-vertex and

neutrosophic strong. It’s fixed-edge. Every edges have same value. So strength
of paths and connectedness are same and equal to each other. Thus all edges
are vital. Then the center has one color and since it’s connected to all other
vertices, the color of center is unique. Therefore, vital chromatic number is at
least 2. Non-center vertices form a path which are colored by two colors when
applying colors are in alternative ways. Thus vital chromatic number is 3 if
the non-center vertices form even color and vital chromatic number is 4 if the
non-center vertices form odd color. 

n-Vital Chromatic Number

Proposition 1.2.27. Let N = (σ, µ) be a neutrosophic graph which is neither
neutrosophic empty nor neutrosophic path. Then n-vital chromatic number is at
most order of N which is neutrosophic cardinality of V.

Proof. Assume N = (σ, µ) is a neutrosophic graph which is neither neutrosophic

empty nor neutrosophic path. If all edges are vital and all vertices are connected
to each other, then vital chromatic number is n. Thus n-vital chromatic number
is at most order of N which is neutrosophic cardinality of V. 

Largest n-Vital Chromatic Number

Proposition 1.2.28. Let N = (σ, µ) be a neutrosophic complete which is neither
neutrosophic empty nor neutrosophic path. Then n-vital chromatic number is
order of N which is neutrosophic cardinality of V.

Proof. Suppose N = (σ, µ) is a neutrosophic complete which is neither

neutrosophic empty nor neutrosophic path. By it’s complete, then all vertices
are connected to each other and all edges are vital. Thus n colors are used. It
means n-vital chromatic number is order of N which is neutrosophic cardinality
of V. 

Proposition 1.2.29. Let N = (σ, µ) be a neutrosophic path. Then n-vital

chromatic number aren’t computable.

Proof. Deletion of one edge, make N = (σ, µ) be in the situation where n-vital
chromatic number aren’t computable. Since there’s need to have at least two

17
1. Definitions

paths to compute n-vital chromatic number. In other words, this notion is

computable in neutrosophic graph which has at least one cycle. 

Proposition 1.2.30. Let N = (σ, µ) be a neutrosophic star. Then n-vital

chromatic number aren’t computable.

Proof. Assume N = (σ, µ) is a neutrosophic star. Then there’s only one path
amid two given vertices. Deletion one edge causes the connectedness to be
incomputable. Thus n-vital chromatic number aren’t computable. 

Smallest n-Vital Chromatic Number

Proposition 1.2.31. Let N = (σ, µ) be a neutrosophic empty. Then n-vital
chromatic number is
min σ(x).
x∈V

Proof. Suppose N = (σ, µ) is a neutrosophic empty. Then there’s no edge. It

induces there’s no vital edge. So all vertices are colored by one color. Hence
all vertices have same color. It means the number of color is one. It induces
the cardinality of set includes the representative of color is one. To find the
representative of color, we have 1 choice from n options. Thus n-vital chromatic
number is
min σ(x).
x∈V

Proposition 1.2.32. Let N = (σ, µ) be a neutrosophic graph which is neither

neutrosophic empty nor neutrosophic path. Then n-vital chromatic number isn’t

min σ(x).
x∈V

Proof. Consider N = (σ, µ) is a neutrosophic graph which is neither

neutrosophic empty nor neutrosophic path. Then there’s at least one edge. By
Proposition (1.2.8), there’s at least one vital edge. It induces the number of
color is at least two. Therefore, the cardinality of set of representative is at
least two. It implies n-vital chromatic number isn’t

min σ(x).
x∈V

Proposition 1.2.33. Let N = (σ, µ) be a neutrosophic cycle. Then n-vital

chromatic number is at least

min σ(x) + σ(y).

x,y∈V, xy∈E

And at most
min σ(x) + σ(y) + σ(z).
x,y,z∈V,xy,yz,xz∈E

18
 1.2. Neutrosophic Chromatic Number Based on Connectedness

Proof. Suppose N = (σ, µ) is a neutrosophic cycle. By using alternative coloring

of vertices, two or three numbers of colors are used. So the cardinality of set
of representative is two or three. There are only these possibilities. Therefore
n-vital chromatic number is at least

min σ(x) + σ(y).

x,y∈V, xy∈E

And at most
min σ(x) + σ(y) + σ(z).
x,y,z∈V,xy,yz,xz∈E

Proposition 1.2.34. Let N = (σ, µ) be an even neutrosophic cycle. Then n-vital

chromatic number is
min σ(x) + σ(y).
x,y∈V, xy∈E

Proof. Assume N = (σ, µ) is an even neutrosophic cycle. If colors are applied

on vertices in alternative ways which cause two vertices with a common edge,
have different colors, then by it’s even neutrosophic cycle, the representatives of
colors are two. Since there are even edges which by Proposition (1.2.5), all are
vital. It induces the cardinality of set of representatives is two. Thus n-vital
chromatic number is n-vital chromatic number is

min σ(x) + σ(y).

x,y∈V, xy∈E

Proposition 1.2.35. Let N = (σ, µ) be an odd neutrosophic cycle. Then n-vital

chromatic number is

min σ(x) + σ(y) + σ(z).

x,y,z∈V, xy∈E

Proof. Consider N = (σ, µ) is an odd neutrosophic cycle. Then number of edges

are odd. By Proposition (1.2.5), all edges are vital. Using different colors on the
vertices which have common edges, implies usage of three colors. Hence the set
of representatives has the cardinality three. To choose, the representatives, in
every color, minimum value of vertices, introduces the representative of specific
color. Then n-vital chromatic number is

min σ(x) + σ(y) + σ(z).

x,y,z∈V, xy∈E

prp36b Proposition 1.2.36. Let N = (σ, µ) be neutrosophic bipartite which is fixed-edge

and complete. Then n-vital chromatic number is

min σ(x) + σ(y).

x,y∈V, xy∈E

19
 1. Definitions

Proof. Assume N = (σ, µ) is neutrosophic bipartite which is fixed-edge and

complete. It’s fixed-edge so all edges have same value and as its consequences,
all paths have same strength and all connectedness are same. Hence all edges
are vital. By it’s complete, all vertices from one part are connected to all
vertices from another part. By it’s bipartite, there are two colors to use on
vertices such that every part has same color. So the set of representatives has
the cardinality two which implies n-vital chromatic number is

min σ(x) + σ(y).

x,y∈V, xy∈E

Proposition 1.2.37. Let N = (σ, µ) be neutrosophic bipartite which is fixed-

vertex and complete. Then n-vital chromatic number is

min σ(x) + σ(y).

x,y∈V, xy∈E

Proof. Assume N = (σ, µ) is neutrosophic bipartite which is fixed-vertex and

complete. By it’s fixed-vertex and complete, it’s fixed-edge and complete. By
Proposition (1.2.36), n-vital chromatic number is

min σ(x) + σ(y).

x,y∈V, xy∈E

prp38b Proposition 1.2.38. Let N = (σ, µ) be neutrosophic t−partite which is fixed-

edge and complete. Then n-vital chromatic number is

min σ(x1 ) + σ(x2 ) + · · · + σ(xt ).

x1 ,x2 ,··· ,xt ∈V, xi xj ∈E

Proof. Assume N = (σ, µ) is neutrosophic t−partite which is fixed-edge and

complete. All parts have same color on their vertices. By it’s fixed-edge and
applying Proposition (1.2.11), all edges are vital. Thus minimum number of
colors is t. And the set of representatives has the cardinality t. It means n-vital
chromatic number is

min σ(x1 ) + σ(x2 ) + · · · + σ(xt ).

x1 ,x2 ,··· ,xt ∈V, xi xj ∈E

Proposition 1.2.39. Let N = (σ, µ) be neutrosophic t−partite which is fixed-

vertex and complete. Then n-vital chromatic number is

min σ(x1 ) + σ(x2 ) + · · · + σ(xt ).

x1 ,x2 ,··· ,xt ∈V, xi xj ∈E

Proof. Assume N = (σ, µ) is neutrosophic t−partite which is fixed-vertex and

complete. Then by it’s fixed-vertex and complete, it’s it’s fixed-edge and
complete. By Proposition (1.2.38), n-vital chromatic number is

min σ(x1 ) + σ(x2 ) + · · · + σ(xt ).

x1 ,x2 ,··· ,xt ∈V, xi xj ∈E

20
 1.2. Neutrosophic Chromatic Number Based on Connectedness

prp40b Proposition 1.2.40. Let N = (σ, µ) be neutrosophic wheel which is fixed-vertex

and neutrosophic strong. Then n-vital chromatic number is
min σ(c) + σ(y) + σ(z).
y,z∈V,yz∈E

Or
min σ(c) + σ(y) + σ(z) + σ(t).
y,z∈V,yz,zt∈E

Proof. Consider N = (σ, µ) is neutrosophic wheel which is fixed-vertex and

neutrosophic strong. By fixed-vertex and neutrosophic strong, it’s fixed-edge.
By it’s fixed-edge and applying Proposition (1.2.11), all edges are vital. Center
is connected to non-center vertices. So center uses unique color. Non-center
vertices form a cycle. If the cycle is even, then n-vital chromatic number is
min σ(c) + σ(y) + σ(z).
y,z∈V,yz∈E

If it’s odd, then n-vital chromatic number is

min σ(c) + σ(y) + σ(z).
y,z∈V,yz∈E

Or
min σ(c) + σ(y) + σ(z) + σ(t).
y,z∈V,yz,zt∈E

Proposition 1.2.41. Let N = (σ, µ) be neutrosophic wheel which is fixed-edge
and neutrosophic strong. Then n-vital chromatic number is
min σ(c) + σ(y) + σ(z).
y,z∈V,yz∈E

Proof. Assume N = (σ, µ) is neutrosophic wheel which is fixed-edge and

neutrosophic strong. By it’s fixed-edge and neutrosophic strong, it’s fixed-
vertex and neutrosophic strong. By Proposition (1.2.40),
min σ(c) + σ(y) + σ(z).
y,z∈V,yz∈E

Or
min σ(c) + σ(y) + σ(z) + σ(t).
y,z∈V,yz,zt∈E

The relation amid neutrosophic chromatic number and main parameters of
neutrosophic graphs is computed.
Proposition 1.2.42. Let N = (σ, µ) be a neutrosophic strong. Then vital
chromatic number is at most ∆ + 1 and at least 2.
Proof. Neutrosophic strong is neutrosophic nontrivial. So it isn’t neutrosophic
empty which induces there’s no edge. It implies chromatic number is two. Since
chromatic number is one if and only if N = (σ, µ) is neutrosophic empty if
and only if N = (σ, µ) is neutrosophic trivial. A vertex with degree ∆, has ∆
vertices which have common edges with them. If these vertices have no edge
amid each other, then chromatic number is two especially, neutrosophic star. If
not, then in the case, all vertices have edge amid each other, chromatic number
is ∆ + 1, especially, neutrosophic complete. 

21
 1. Definitions

Proposition 1.2.43. Let N = (σ, µ) be a neutrosophic r−regular. Then vital

chromatic number is at most r + 1.

Proof. N = (σ, µ) is a neutrosophic r−regular. So any of vertex has r vertices

which have common edge with it. If these vertices have no common edge with
each other, for instance neutrosophic star, chromatic number is two. But since
the vertices have common edge with each other, chromatic number is r + 1, for
instance, neutrosophic complete. 

Applications in Time Table and Scheduling

sec3b
Designing the programs to achieve some goals is general approach to apply on
some issues to function properly. Separation has key role in the context of this
style. Separating the duration of work which are consecutive, is the matter and
it has important 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 section. Beyond that, sometimes sections are not the same.

Step 3. (Model) As Figure (1.4), the situation is designed as a model. The

model uses data to assign every section and to assign to relation amid
section, 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 relation amid them.
Table (1.3), clarifies about the assigned numbers to these situation.

Figure 1.4: Black vertices are suspicions about choosing them. fgr1b

Step 4. (Solution) As Figure (1.4) shows, neutrosophic model, proposes to

use vital chromatic number which is incomputable in the case which is
titled T 0 . In this case, i1 and c1 aren’t representative of these two colors
and n-vital chromatic number is incomputable. The set {i1 , c1 } doesn’t
contain representatives of colors which pose vital chromatic number and

22
 1.2. Neutrosophic Chromatic Number Based on Connectedness

Table 1.3: Scheduling concerns its Subjects and its Connections as a

Neutrosophic Graph in a Model. tbl1b

Sections of T s1 s2 s3 s4 s5 s6 s7 s8 s9 , s10
Values 0.1 0.8 0.7 0.8 0.1 0.3 0.6 0.5 0.2
Connections of T s1 s2 s2 s3 s3 s4 s4 s5 s5 s6 s6 s7 s7 s8 s8 s9 s9 s10
Values 0.1 0.6 0.4 0.1 0.1 0.2 0.4 0.2 0.1

n-vital chromatic number. Thus the decision amid choosing the subject
c1 an c2 isn’t concluded to choose c1 . To get brief overview, neutrosophic
model uses one number for every array so 0.9 means (0.9, 0.9, 0.9). In
Figure (1.4), the neutrosophic model T introduces the common situation.
The representatives of colors are i2 and c1 . Thus vital chromatic number
is two and n-vital chromatic number is 1.4. Thus suspicion about choosing
i1 and i2 is determined to be i2 . The sets of representative for colors are
{i2 , c1 }.

Open Problems
sec4b
The two notions of coloring of vertices concerning vital chromatic number and n-
vital chromatic number are defined on neutrosophic graphs when connectedness
and as its consequences, vital edges have key role to have these notions. Thus
Question 1.2.44. Is it possible to use other types edges via connectedness to
define vital chromatic number and n-vital chromatic number?
Question 1.2.45. Are existed some connections amid the coloring from
connectedness inside this concept and external connections with other types
of coloring from other notions?
Question 1.2.46. Is it possible to construct some classes neutrosophic graphs
which have “nice” behavior?
Question 1.2.47. Which applications do make an independent study to apply
vital chromatic number and n-vital chromatic number?
Problem 1.2.48. Which parameters are related to this parameter?
Problem 1.2.49. Which approaches do work to construct applications to create
independent study?
Problem 1.2.50. Which approaches do work to construct definitions which use
all three arrays and the relations amid them instead of one array of three arrays
to create independent study?

Conclusion and Closing Remarks

sec5b
This study uses mixed combinations of vital chromatic number and n-vital
chromatic number to study on neutrosophic graphs. The connections of vertices
which are clarified by vital edges from connectedness, differ them from each
other and and put them in different categories to represent one representative for
each color. Further studies could be about changes in the settings to compare

23
1. Definitions

this notion amid different settings of graph theory. One way is finding some
relations amid array of vertices to make sensible definitions. In Table (1.4),
some limitations and advantages of this study is pointed out.

Table 1.4: A Brief Overview about Advantages and Limitations of this study tbl2b

Advantages Limitations
1. Using connectedness for vital edges 1. Acyclic neutrosophic graphs

2. Using neutrosophic cardinality

3. Using cardinality 2. Connections with parameters

4. Characterizing smallest number

5. Characterizing biggest number 3. Star and path

24
 CHAPTER 2

New Ideas

New ideas are

applied on this Having different colors when two vertices have common “connection”. Common
model to explore connection can only be an edge. An edge with special attribute can be common
behaviors of
“connection”. Using neutrosophic attributes are expected to make sense about
these models in
the mathematical the study in this framework. In what follows, some definitions are introduced
perspective. to be in the form of common “connection”.
Another ways to
make sense about
them, are used
by relatively 2.1 Different Types of Neutrosophic Chromatic Number
comparable
results to
conclude Third case for the contents is to use the article from [Ref12]. The contents
analysis. are used in the way that, usages of new contents are preferences and the
preliminaries are passed in the beginning of this chapter.

Abstract
New setting is introduced to study chromatic number. Different types of
chromatic numbers and neutrosophic chromatic number are proposed in this
way, some results are obtained. Classes of neutrosophic graphs are used to
obtains these numbers and the representatives of the colors. Using colors to
assign to the vertices of neutrosophic graphs is applied. Some questions and
problems are posed concerning ways to do further studies on this topic. Using
different types of edges from connectedness in same neutrosophic graphs and in
modified neutrosophic graphs to define the relation amid vertices which implies
having different colors amid them and as consequences, choosing one vertex as
a representative of each color to use them in a set of representatives and finally,
using neutrosophic cardinality of this set to compute types of chromatic numbers.
This specific relation amid edges is necessary to compute both types of chromatic
number concerning the number of representative in the set of representatives and
types of neutrosophic chromatic number concerning neutrosophic cardinality
of set of representatives. If two vertices have no intended edge, then they can
be assigned to same color even they’ve common edge. Basic familiarities with
neutrosophic graph theory and graph theory are proposed for this article.
Keywords: Neutrosophic Connctedness, Neutrosophic Graphs, Chromatic

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

25
2. New Ideas

Motivation and Contributions

In this study, there’s an idea which could be considered as a motivation.
Question 2.1.1. Is it possible to use mixed versions of ideas concerning
“connectedness”, “neutrosophic graphs” and “neutrosophic coloring” 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. Connections amid two items have key
roles to assign colors. Thus they’re used to define new ideas which conclude to
the structure of coloring. The concept of having specific edge from connectedness
inspires me to study the behavior of specific edge in the way that, both types of
chromatic numbers and types of neutrosophic chromatic numbers are the cases
of study.
The framework of this study is as follows. In the beginning, I introduced basic
definitions to clarify about preliminaries. In section “New Ideas”, new notion
of coloring is applied to the vertices of neutrosophic graphs. Specific edge from
connectedness has the key role in this way. Classes of neutrosophic graphs
are studied in the terms of different types of edges in section “New Results”.
In section “Applications in Time Table and Scheduling”, one application is
posed for neutrosophic graphs concerning time table and scheduling when the
suspicions are about choosing some subjects. 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 are
featured. In section “Conclusion and Closing Remarks”, a brief overview
concerning advantages and limitations of this study alongside conclusions are
formed.

New Ideas
Question 2.1.2. What-if the common “connection” is beyond having one
common edge?
The first step is the definition of common “connection”.
Definition 2.1.3. Let N = (σ, µ) be a neutrosophic graph. A neutrosophic
edge xy is called type-I if value of xy is connectedness which is a maximum
strength of paths amid them.
Example 2.1.4. Consider Figure (2.1).
(i) : From n1 to n2 , there’s no edge which is type-I but n2 n3 .
(ii) : From n2 to n3 , there’s no edge which is type-I but n2 n3 .
(iii) : From n1 to n3 , there’s no edge which is type-I but n1 n3 .
There’s a curious question.
Question 2.1.5. Is there a neutrosophic graph whose edges are type-I?
Yes but only one class. Two upcoming Propositions give simple answers
about a class of neutrosophic graphs. Other classes of neutrosophic graphs have
at least one edge which isn’t type-I.

26
 2.1. Different Types of Neutrosophic Chromatic Number

Figure 2.1: Two edges aren’t type-I. ncs1c2

Proposition 2.1.6. Let N = (σ, µ) be a neutrosophic graph which is fixed-edge.

Then all edges are type-I.
Proposition 2.1.7. Let N = (σ, µ) be a neutrosophic graph which is strong
fixed-vertex. Then N = (σ, µ) is fixed-edge.
Proposition 2.1.8. Let N = (σ, µ) be a neutrosophic graph which is strong
fixed-vertex. Then all edges are type-I.
Example 2.1.9. Consider Figure (2.2). All edges are type-I.

Definition 2.1.10. Let N = (σ, µ) be a neutrosophic graph. A neutrosophic

edge xy is called type-II if value of xy is lower than connectedness which is
a maximum strength of paths amid them.
Example 2.1.11. The comparison amid the variant of edges which are either
type-I or type-II, is possible when common neutrosophic graphs are studied.
(a) : Consider Figure (2.1).
(i) : From n1 to n2 , there’s no edge which is type-II but n1 n2 .
(ii) : From n2 to n3 , there’s no edge which is type-II but n1 n2 .
(iii) : From n1 to n3 , there’s no edge which is type-II but n1 n2 and n2 n3 .
(b) : Consider Figure (2.2). There’s no edge which is type-II.
Definition 2.1.12. Let N = (σ, µ) be a neutrosophic graph. A neutrosophic edge
xy is called type-III if value of xy is the only value which is connectedness
which is a maximum strength of paths amid them.
Example 2.1.13. The comparison amid the variant of edges which are either
type-I or type-II or type-III, is possible when common neutrosophic graphs are
studied.

27
2. New Ideas

Figure 2.2: Neutrosophic graph which is fixed-edge but not strong fixed-vertex. ncs2c2

(a) : Consider Figure (2.1).

(i) : From n1 to n2 , there’s no edge which is type-III but n2 n3 .

(ii) : From n2 to n3 , there’s no edge which is type-III but n2 n3 .
(iii) : From n1 to n3 , there’s no edge which is type-III but n1 n3 and n2 n3 .

(b) : Consider Figure (2.2). There’s no edge which is type-III.

Definition 2.1.14. Let N = (σ, µ) be a neutrosophic graph. A neutrosophic

edge xy is called type-IV if value of xy is connectedness which is a maximum
strength of paths amid them but in N = (σ, µ) doesn’t have xy.
Example 2.1.15. The comparison amid the variant of edges which are either
type-I or...or type-IV, is possible when common neutrosophic graphs are studied.

(a) : Consider Figure (2.1).

(i) : From n1 to n2 , there’s no edge which is type-IV.

(ii) : From n2 to n3 , there’s no edge which is type-IV.
(iii) : From n1 to n3 , there’s no edge which is type-IV.

(b) : Consider Figure (2.2). All edges are type-IV.

Definition 2.1.16. Let N = (σ, µ) be a neutrosophic graph. A neutrosophic

edge xy is called type-V if value of xy is lower than connectedness which is
a maximum strength of paths amid them but in N = (σ, µ) doesn’t have xy.
Example 2.1.17. The comparison amid the variant of edges which are either
type-I or...or type-V, is possible when common neutrosophic graphs are studied.

(a) : Consider Figure (2.1).

28
 2.1. Different Types of Neutrosophic Chromatic Number

(i) : From n1 to n2 , edge n1 n2 is type-V.

(ii) : From n2 to n3 , there’s no edge which is type-V.
(iii) : From n1 to n3 , there’s no edge which is type-V.

(b) : Consider Figure (2.2). There’s no edge which is type-V.

Definition 2.1.18. Let N = (σ, µ) be a neutrosophic graph. A neutrosophic

edge xy is called type-VI if value of xy is greater than connectedness which
is a maximum strength of paths amid them but in N = (σ, µ) doesn’t have xy.
Example 2.1.19. The comparison amid the variant of edges which are either
type-I or...or type-VI, is possible when common neutrosophic graphs are studied.

(a) : Consider Figure (2.1).

(i) : From n1 to n2 , there’s no edge which is type-VI.

(ii) : From n2 to n3 , edges n2 n3 and n1 n3 are type-VI.
(iii) : From n1 to n3 , edges n2 n3 and n1 n3 are type-VI.

(b) : Consider Figure (2.2). There’s no edge which is type-VI.

Definition 2.1.20. Let N = (σ, µ) be a neutrosophic graph. A neutrosophic edge

xy is called type-VII if value of xy is the only value which is connectedness
which is a maximum strength of paths amid them but in N = (σ, µ) doesn’t
have xy.
Example 2.1.21. The comparison amid the variant of edges which are either
type-I or...or type-VII, is possible when common neutrosophic graphs are
studied.

(a) : Consider Figure (2.1).

(i) : From n1 to n2 , there’s no edge which is type-VII.

(ii) : From n2 to n3 , there’s no edge which is type-VII.
(iii) : From n1 to n3 , there’s no edge which is type-VII.

(b) : Consider Figure (2.2). There’s no edge which is type-VII.

Common way to define the number, could be twofold. One is about the
cardinality and another is about neutrosophic cardinality.
Definition 2.1.22. Let N = (σ, µ) be a neutrosophic graph. A vertex which
has common type edge with another vertex, has assigned different color from
that vertex. The cardinality of the set of representatives of colors, is called
type chromatic number and its neutrosophic cardinality concerning the set
of representatives of colors is called n-type chromatic number.
Definition 2.1.23. It’s worthy to note that there are two types of definitions.
One is about the comparison amid edges and connectedness. Another is about
one edge when it’s deleted, new connectedness is compared to deleted edge.
Thus in first type, all edges are compared to connectedness but in second type,
for every edge, there’s a computation to have connectedness. So in first type,
connectedness is unique and there’s one number for all edges as connectedness

29
2. New Ideas

but in second type, for every edge, there’s a new connectedness to decide about
the edge whether has intended attribute or not. To avoid confusion, chromatic
number is computed with respect to n1 and n2 where second style is used and
all edges are labelled even they’re not deleted edges so third type is introduced
when deletion of one edge, is enough to label all edges. Also first order is used
to have these concepts.
In following example, third type of definitions which are except from type-
IV,V,VI,VII, are studied.
Example 2.1.24. The comparison amid the variant of numbers which are either
type-I or...or type-VII, is possible when common neutrosophic graphs are studied.
Chromatic number is computed with respect to n1 and n2 . Also first order is
used to have these concepts.
(a) : Consider Figure (2.1).
(i) : The set of representatives of colors is {n1 , n2 }. Thus type-I chromatic
number is 2 and n-type-I chromatic number is 1.73.
(ii) : The set of representatives of colors is {n1 , n2 }. Thus type-II chromatic
number is 2 and n-type-II chromatic number is 1.73.
(iii) : The set of representatives of colors is {n2 , n3 }. Thus type-III
chromatic number is 2 and n-type-III chromatic number is 1.28.
(iv) : The set of representatives of colors is {n2 , n3 }. Thus type-IV
chromatic number is 2 and n-type-IV chromatic number is 1.28.
(v) : The set of representatives of colors is {n1 , n2 }. Thus type-V chromatic
number is 2 and n-type-V chromatic number is 1.73.
(vi) : The set of representatives of colors is {n2 , n3 }. Thus type-VI
chromatic number is 2 and n-type-VI chromatic number is 1.28.
(vii) : The set of representatives of colors is {n2 , n3 }. Thus type-VII
chromatic number is 2 and n-type-VII chromatic number is 1.28.
(b) : Consider Figure (2.2).
(i) : The set of representatives of colors is {n1 , n2 , n3 }. Thus type-I
chromatic number is 3 and n-type-I chromatic number is 3.01.
(ii) : The set of representatives of colors is {}. Thus type-II chromatic
number is 0 and n-type-II chromatic number is 0.
(iii) : The set of representatives of colors is {}. Thus type-III chromatic
number is 0 and n-type-III chromatic number is 0.
(iv) : The set of representatives of colors is {}. Thus type-IV chromatic
number is 0 and n-type-IV chromatic number is 0.
(v) : The set of representatives of colors is {}. Thus type-V chromatic
number is 0 and n-type-V chromatic number is 0.
(vi) : The set of representatives of colors is {}. Thus type-VI chromatic
number is 0 and n-type-VI chromatic number is 0.
(vii) : The set of representatives of colors is {}. Thus type-VII chromatic
number is 0 and n-type-VII chromatic number is 0.

30
 CHAPTER 3

New Results

In this chapter,
I introduce some 3.1 Different Types of Neutrosophic Chromatic Number
results
concerning new Third case for the contents is to use the article from [Ref12]. The contents
ideas and in
this ways, the
are used in the way that, usages of new contents are preferences and the
results make preliminaries are passed in the beginning of this chapter.
sense more about
their impacts on
different New Results
models.
Proposition 3.1.1. Let N = (σ, µ) be a neutrosophic graph which is complete.
If it’s fixed-edge, then

(i) : The set of representatives of colors is {v1 , v2 , · · · , vn }. Thus type-I

chromatic number is n and n-type-I chromatic number is neutrosophic
cardinality of V.

(ii) : The set of representatives of colors is {}. Thus type-II chromatic number
is 0 and n-type-II chromatic number is 0.

(iii) : The set of representatives of colors is {}. Thus type-III chromatic number
is 0 and n-type-III chromatic number is 0.

(iv) : The set of representatives of colors is {v1 , v2 , · · · , vn }. Thus type-IV

chromatic number is n and n-type-IV chromatic number is neutrosophic
cardinality of V.

(v) : The set of representatives of colors is {}. Thus type-V chromatic number
is 0 and n-type-V chromatic number is 0.

(vi) : The set of representatives of colors is {}. Thus type-VI chromatic number
is 0 and n-type-VI chromatic number is 0.

(vii) : The set of representatives of colors is {}. Thus type-VII chromatic number
is 0 and n-type-VII chromatic number is 0.

Proof. (i). All edges have same amount so the connectedness amid two given
edges is the same. All edges are type-I. By it’s neutrosophic complete, every
vertex has n − 1 vertices which have common edges which are type-I. Thus the
set of representatives of colors is {v1 , v2 , · · · , vn }. The type-I chromatic number
is n and n-type-I chromatic number is neutrosophic cardinality of V.
(ii). All edges have same amount so the connectedness amid two given edges is

31
3. New Results

the same. All edges aren’t type-II. By it’s neutrosophic complete, every vertex
has n − 1 vertices which have common edges which aren’t type-II. Thus the
set of representatives of colors is {}. The type-II chromatic number is 0 and
n-type-II chromatic number is 0.
(iii). All edges have same amount so the connectedness amid two given edges is
the same. All edges aren’t type-III. By it’s neutrosophic complete, every vertex
has n − 1 vertices which have common edges which aren’t type-III. Thus the
set of representatives of colors is {}. The type-III chromatic number is 0 and
n-type-III chromatic number is 0.
(iv). All edges have same amount so the connectedness amid two given edges is
the same. All edges are type-IV. By it’s neutrosophic complete, every vertex
has n − 1 vertices which have common edges which are type-IV. Thus the set
of representatives of colors is {v1 , v2 , · · · , vn }. The type-IV chromatic number
is n and n-type-IV chromatic number is neutrosophic cardinality of V.
(v). All edges have same amount so the connectedness amid two given edges is
the same. All edges aren’t type-V. By it’s neutrosophic complete, every vertex
has n − 1 vertices which have common edges which aren’t type-V. Thus the
set of representatives of colors is {}. The type-V chromatic number is 0 and
n-type-V chromatic number is 0.
(vi). All edges have same amount so the connectedness amid two given edges is
the same. All edges aren’t type-VI. By it’s neutrosophic complete, every vertex
has n − 1 vertices which have common edges which aren’t type-VI. Thus the
set of representatives of colors is {}. The type-VI chromatic number is 0 and
n-type-VI chromatic number is 0.
(vii). All edges have same amount so the connectedness amid two given edges
is the same. All edges aren’t type-VII. By it’s neutrosophic complete, every
vertex has n − 1 vertices which have common edges which aren’t type-VII. Thus
the set of representatives of colors is {}. The type-VII chromatic number is 0
and n-type-VII chromatic number is 0.


Proposition 3.1.2. Let N = (σ, µ) be a neutrosophic graph which is complete.

If it’s fixed-vertex, then

(i) : The set of representatives of colors is {v1 , v2 , · · · , vn }. Thus type-I

chromatic number is n and n-type-I chromatic number is nσ(vi ).

(ii) : The set of representatives of colors is {}. Thus type-II chromatic number
is 0 and n-type-II chromatic number is 0.

(iii) : The set of representatives of colors is {}. Thus type-III chromatic number
is 0 and n-type-III chromatic number is 0.

(iv) : The set of representatives of colors is {v1 , v2 , · · · , vn }. Thus type-IV

chromatic number is n and n-type-IV chromatic number is nσ(vi ).

(v) : The set of representatives of colors is {}. Thus type-V chromatic number
is 0 and n-type-V chromatic number is 0.

(vi) : The set of representatives of colors is {}. Thus type-VI chromatic number
is 0 and n-type-VI chromatic number is 0.

32
 3.1. Different Types of Neutrosophic Chromatic Number

(vii) : The set of representatives of colors is {}. Thus type-VII chromatic number
is 0 and n-type-VII chromatic number is 0.

Proof. (i). By it’s fixed-vertex and it’s neutrosophic complete, all edges have
same amount so the connectedness amid two given edges is the same. All edges
are type-I. By it’s neutrosophic complete, every vertex has n − 1 vertices which
have common edges which are type-I. Thus the set of representatives of colors
is {v1 , v2 , · · · , vn }. The type-I chromatic number is n and n-type-I chromatic
number is nσ(vi ).
(ii). By it’s fixed-vertex and it’s neutrosophic complete, all edges have same
amount so the connectedness amid two given edges is the same. All edges aren’t
type-II. By it’s neutrosophic complete, every vertex has n − 1 vertices which
have common edges which aren’t type-II. Thus the set of representatives of
colors is {}. The type-II chromatic number is 0 and n-type-II chromatic number
is 0.
(iii). By it’s fixed-vertex and it’s neutrosophic complete, all edges have same
amount so the connectedness amid two given edges is the same. All edges
aren’t type-III. By it’s neutrosophic complete, every vertex has n − 1 vertices
which have common edges which aren’t type-III. Thus the set of representatives
of colors is {}. The type-III chromatic number is 0 and n-type-III chromatic
number is 0.
(iv). By it’s fixed-vertex and it’s neutrosophic complete, all edges have same
amount so the connectedness amid two given edges is the same. All edges are
type-IV. By it’s neutrosophic complete, every vertex has n − 1 vertices which
have common edges which are type-IV. Thus the set of representatives of colors
is {v1 , v2 , · · · , vn }. The type-IV chromatic number is n and n-type-IV chromatic
number is nσ(vi ).
(v). By it’s fixed-vertex and it’s neutrosophic complete, all edges have same
amount so the connectedness amid two given edges is the same. All edges aren’t
type-V. By it’s neutrosophic complete, every vertex has n − 1 vertices which
have common edges which aren’t type-V. Thus the set of representatives of
colors is {}. The type-V chromatic number is 0 and n-type-V chromatic number
is 0.
(vi). By it’s fixed-vertex and it’s neutrosophic complete, all edges have same
amount so the connectedness amid two given edges is the same. All edges
aren’t type-VI. By it’s neutrosophic complete, every vertex has n − 1 vertices
which have common edges which aren’t type-VI. Thus the set of representatives
of colors is {}. The type-VI chromatic number is 0 and n-type-VI chromatic
number is 0.
(vii). By it’s fixed-vertex and it’s neutrosophic complete, all edges have same
amount so the connectedness amid two given edges is the same. All edges aren’t
type-VII. By it’s neutrosophic complete, every vertex has n − 1 vertices which
have common edges which aren’t type-VII. Thus the set of representatives of
colors is {}. The type-VII chromatic number is 0 and n-type-VII chromatic
number is 0.


Proposition 3.1.3. Let N = (σ, µ) be a neutrosophic graph which is strong. If

it’s fixed-edge, then

33
 3. New Results

(i) : The set of representatives of colors is {v1 , v2 , · · · , vt } where t = ∆(N ).

Thus type-I chromatic number is t and n-type-I chromatic number is
neutrosophic cardinality of {v1 , v2 , · · · , vt }.

(ii) : The set of representatives of colors is {}. Thus type-II chromatic number
is 0 and n-type-II chromatic number is 0.

(iii) : The set of representatives of colors is {}. Thus type-III chromatic number
is 0 and n-type-III chromatic number is 0.

(iv) : The set of representatives of colors is {v1 , v2 , · · · , vt } where t = ∆(N ).

Thus type-IV chromatic number is t and n-type-IV chromatic number is
neutrosophic cardinality of {v1 , v2 , · · · , vt }.

(v) : The set of representatives of colors is {}. Thus type-V chromatic number
is 0 and n-type-V chromatic number is 0.

(vi) : The set of representatives of colors is {}. Thus type-VI chromatic number
is 0 and n-type-VI chromatic number is 0.

(vii) : The set of representatives of colors is {}. Thus type-VII chromatic number
is 0 and n-type-VII chromatic number is 0.

Proof. (i). All edges have same amount so the connectedness amid two given
edges is the same. All edges are type-I. By it’s neutrosophic strong, there’s
a vertex has t = ∆(N ) vertices which have common edges which are type-I.
Thus the set of representatives of colors is {v1 , v2 , · · · , vt }. The type-I chromatic
number is t and n-type-I chromatic number is neutrosophic cardinality of
{v1 , v2 , · · · , vt }.
(ii). All edges have same amount so the connectedness amid two given edges is
the same. All edges aren’t type-II. By it’s neutrosophic strong, there’s a vertex
has t = ∆(N ) vertices which have common edges which aren’t type-II. Thus
the set of representatives of colors is {}. The type-II chromatic number is 0 and
n-type-II chromatic number is 0.
(iii). All edges have same amount so the connectedness amid two given edges
is the same. All edges aren’t type-III. By it’s neutrosophic strong, there’s a
vertex has t = ∆(N ) vertices which have common edges which aren’t type-III.
Thus the set of representatives of colors is {}. The type-III chromatic number
is 0 and n-type-III chromatic number is 0.
(iv). All edges have same amount so the connectedness amid two given edges is
the same. All edges are type-IV. By it’s neutrosophic strong, there’s a vertex
has t = ∆(N ) vertices which have common edges which are type-IV. Thus
the set of representatives of colors is {v1 , v2 , · · · , vt }. The type-IV chromatic
number is t and n-type-IV chromatic number is neutrosophic cardinality of
{v1 , v2 , · · · , vt }.
(v). All edges have same amount so the connectedness amid two given edges is
the same. All edges aren’t type-V. By it’s neutrosophic strong, there’s a vertex
has t = ∆(N ) vertices which have common edges which aren’t type-V. Thus
the set of representatives of colors is {}. The type-V chromatic number is 0 and
n-type-V chromatic number is 0.
(vi). All edges have same amount so the connectedness amid two given edges is
the same. All edges aren’t type-VI. By it’s neutrosophic strong, there’s a vertex

34
 3.1. Different Types of Neutrosophic Chromatic Number

has t = ∆(N ) vertices which have common edges which aren’t type-VI. Thus
the set of representatives of colors is {}. The type-VI chromatic number is 0
and n-type-VI chromatic number is 0.
(vii). All edges have same amount so the connectedness amid two given edges
is the same. All edges aren’t type-VII. By it’s neutrosophic strong, there’s a
vertex has t = ∆(N ) vertices which have common edges which aren’t type-VII.
Thus the set of representatives of colors is {}. The type-VII chromatic number
is 0 and n-type-VII chromatic number is 0. 

Proposition 3.1.4. Let N = (σ, µ) be a neutrosophic graph which is strong. If

it’s fixed-vertex, then
(i) : The set of representatives of colors is {v1 , v2 , · · · , vt } where t = ∆(N ).
Thus type-I chromatic number is t and n-type-I chromatic number is tσ(vi ).
(ii) : The set of representatives of colors is {}. Thus type-II chromatic number
is 0 and n-type-II chromatic number is 0.
(iii) : The set of representatives of colors is {}. Thus type-III chromatic number
is 0 and n-type-III chromatic number is 0.
(iv) : The set of representatives of colors is {v1 , v2 , · · · , vt } where t = ∆(N ).
Thus type-IV chromatic number is t and n-type-IV chromatic number is
tσ(vi ).
(v) : The set of representatives of colors is {}. Thus type-V chromatic number
is 0 and n-type-V chromatic number is 0.
(vi) : The set of representatives of colors is {}. Thus type-VI chromatic number
is 0 and n-type-VI chromatic number is 0.
(vii) : The set of representatives of colors is {}. Thus type-VII chromatic number
is 0 and n-type-VII chromatic number is 0.

Proof. (i). By it’s fixed-vertex and it’s neutrosophic strong, all edges have same
amount so the connectedness amid two given edges is the same. All edges are
type-I. By it’s neutrosophic strong, there’s a vertex has t = ∆(N ) vertices which
have common edges which are type-I. Thus the set of representatives of colors
is {v1 , v2 , · · · , vt }. The type-I chromatic number is t and n-type-I chromatic
number is tσ(vi ).
(ii). By it’s fixed-vertex and it’s neutrosophic strong, all edges have same amount
so the connectedness amid two given edges is the same. All edges aren’t type-II.
By it’s neutrosophic strong, there’s a vertex has t = ∆(N ) vertices which have
common edges which aren’t type-II. Thus the set of representatives of colors is
{}. The type-II chromatic number is 0 and n-type-II chromatic number is 0.
(iii). By it’s fixed-vertex and it’s neutrosophic strong, all edges have same
amount so the connectedness amid two given edges is the same. All edges aren’t
type-III. By it’s neutrosophic strong, there’s a vertex has t = ∆(N ) vertices
which have common edges which aren’t type-III. Thus the set of representatives
of colors is {}. The type-III chromatic number is 0 and n-type-III chromatic
number is 0.
(iv). By it’s fixed-vertex and it’s neutrosophic strong, all edges have same
amount so the connectedness amid two given edges is the same. All edges are

35
 3. New Results

type-IV. By it’s neutrosophic strong, there’s a vertex has t = ∆(N ) vertices

which have common edges which are type-IV. Thus the set of representatives
of colors is {v1 , v2 , · · · , vt }. The type-IV chromatic number is t and n-type-IV
chromatic number is tσ(vi ).
(v). By it’s fixed-vertex and it’s neutrosophic strong, all edges have same amount
so the connectedness amid two given edges is the same. All edges aren’t type-V.
By it’s neutrosophic strong, there’s a vertex has t = ∆(N ) vertices which have
common edges which aren’t type-V. Thus the set of representatives of colors is
{}. The type-V chromatic number is 0 and n-type-V chromatic number is 0.
(vi). By it’s fixed-vertex and it’s neutrosophic strong, all edges have same
amount so the connectedness amid two given edges is the same. All edges aren’t
type-VI. By it’s neutrosophic strong, there’s a vertex has t = ∆(N ) vertices
which have common edges which aren’t type-VI. Thus the set of representatives
of colors is {}. The type-VI chromatic number is 0 and n-type-VI chromatic
number is 0.
(vii). By it’s fixed-vertex and it’s neutrosophic strong, all edges have same
amount so the connectedness amid two given edges is the same. All edges aren’t
type-VII. By it’s neutrosophic strong, there’s a vertex has t = ∆(N ) vertices
which have common edges which aren’t type-VII. Thus the set of representatives
of colors is {}. The type-VII chromatic number is 0 and n-type-VII chromatic
number is 0. 

Proposition 3.1.5. Let N = (σ, µ) be a neutrosophic graph which is strong and

path. If it’s fixed-edge, then
(i) : The set of representatives of colors is {vi , vj }. Thus type-I chromatic
number is 2 and n-type-I chromatic number is σ(vi ) + σ(vj ).
(ii) : The set of representatives of colors is {}. Thus type-II chromatic number
is 0 and n-type-II chromatic number is 0.
(iii) : The set of representatives of colors is {}. Thus type-III chromatic number
is 0 and n-type-III chromatic number is 0.
(iv) : The set of representatives of colors, type-IV chromatic number and n-type-
IV chromatic number aren’t defined.
(v) : The set of representatives of colors, type-V chromatic number and n-type-V
chromatic number aren’t defined.
(vi) : The set of representatives of colors, type-VI chromatic number and n-type-
VI chromatic number aren’t defined.
(vii) : The set of representatives of colors, type-VII chromatic number and n-
type-VII chromatic number aren’t defined.

Proof. (i). All edges have same amount so the connectedness amid two given
edges is the same. All edges are type-I. By it’s neutrosophic strong, there’s a
vertex has 2 vertices which have common edges which are type-I. Thus the set
of representatives of colors is {vi , vj }. The type-I chromatic number is 2 and
n-type-I chromatic number is neutrosophic cardinality of {vi , vj }.
(ii). All edges have same amount so the connectedness amid two given edges is
the same. All edges aren’t type-II. By it’s neutrosophic strong, there’s a vertex

36
 3.1. Different Types of Neutrosophic Chromatic Number

has 2 vertices which have common edges which aren’t type-II. Thus the set of
representatives of colors is {}. The type-II chromatic number is 0 and n-type-II
chromatic number is 0.
(iii). All edges have same amount so the connectedness amid two given edges
is the same. All edges aren’t type-III. By it’s neutrosophic strong, there’s a
vertex has 2 vertices which have common edges which aren’t type-III. Thus the
set of representatives of colors is {}. The type-III chromatic number is 0 and
n-type-III chromatic number is 0.
(iv). All edges have same amount so the connectedness amid two given edges is
the same. All edges aren’t type-IV. Since it’s impossible to define when there’s
no cycle in neutrosophic graph.
(v). All edges have same amount so the connectedness amid two given edges is
the same. All edges aren’t type-V. Since it’s impossible to define when there’s
no cycle in neutrosophic graph.
(vi). All edges have same amount so the connectedness amid two given edges is
the same. All edges aren’t type-VI. Since it’s impossible to define when there’s
no cycle in neutrosophic graph.
(vii). All edges have same amount so the connectedness amid two given edges is
the same. All edges aren’t type-VII. Since it’s impossible to define when there’s
no cycle in neutrosophic graph. 

Proposition 3.1.6. Let N = (σ, µ) be a neutrosophic graph which is strong and

path. If it’s fixed-vertex, then
(i) : The set of representatives of colors is {vi , vj }. Thus type-I chromatic
number is 2 and n-type-I chromatic number is 2σ(vi ).
(ii) : The set of representatives of colors is {}. Thus type-II chromatic number
is 0 and n-type-II chromatic number is 0.
(iii) : The set of representatives of colors is {}. Thus type-III chromatic number
is 0 and n-type-III chromatic number is 0.
(iv) : The set of representatives of colors, type-IV chromatic number and n-type-
IV chromatic number aren’t defined.
(v) : The set of representatives of colors, type-V chromatic number and n-type-V
chromatic number aren’t defined.
(vi) : The set of representatives of colors, type-VI chromatic number and n-type-
VI chromatic number aren’t defined.
(vii) : The set of representatives of colors, type-VII chromatic number and n-
type-VII chromatic number aren’t defined.

Proof. (i). By it’s fixed-vertex and it’s neutrosophic strong, all edges have same
amount so the connectedness amid two given edges is the same. All edges are
type-I. By it’s neutrosophic strong, there’s a vertex has 2 vertices which have
common edges which are type-I. Thus the set of representatives of colors is
{vi , vj }. The type-I chromatic number is 2 and n-type-I chromatic number is
2σ(vi ).
(ii). By it’s fixed-vertex and it’s neutrosophic strong, all edges have same amount
so the connectedness amid two given edges is the same. All edges aren’t type-II.

37
 3. New Results

By it’s neutrosophic strong, there’s a vertex has 2 vertices which have common
edges which aren’t type-II. Thus the set of representatives of colors is {}. The
type-II chromatic number is 0 and n-type-II chromatic number is 0.
(iii). By it’s fixed-vertex and it’s neutrosophic strong, all edges have same
amount so the connectedness amid two given edges is the same. All edges aren’t
type-III. By it’s neutrosophic strong, there’s a vertex has 2 vertices which have
common edges which aren’t type-III. Thus the set of representatives of colors is
{}. The type-III chromatic number is 0 and n-type-III chromatic number is 0.
(iv). By it’s fixed-vertex and it’s neutrosophic strong, all edges have same
amount so the connectedness amid two given edges is the same. All edges aren’t
type-IV. Since it’s impossible to define when there’s no cycle in neutrosophic
graph.
(v). By it’s fixed-vertex and it’s neutrosophic strong, all edges have same amount
so the connectedness amid two given edges is the same. All edges aren’t type-V.
Since it’s impossible to define when there’s no cycle in neutrosophic graph.
(vi). By it’s fixed-vertex and it’s neutrosophic strong, all edges have same
amount so the connectedness amid two given edges is the same. All edges aren’t
type-VI. Since it’s impossible to define when there’s no cycle in neutrosophic
graph.
(vii). By it’s fixed-vertex and it’s neutrosophic strong, all edges have same
amount so the connectedness amid two given edges is the same. All edges aren’t
type-VII. Since it’s impossible to define when there’s no cycle in neutrosophic
graph. 

Proposition 3.1.7. Let N = (σ, µ) be an even cycle. If it’s fixed-edge, then

(i) : The set of representatives of colors is {vi , vj }. Thus type-I chromatic
number is 2 and n-type-I chromatic number is σ(vi ) + σ(vj ).
(ii) : The set of representatives of colors is {}. Thus type-II chromatic number
is 0 and n-type-II chromatic number is 0.
(iii) : The set of representatives of colors is {}. Thus type-III chromatic number
is 0 and n-type-III chromatic number is 0.
(iv) : The set of representatives of colors is {vi , vj }. Thus type-IV chromatic
number is 2 and n-type-IV chromatic number is σ(vi ) + σ(vj ).
(v) : The set of representatives of colors is {}. Thus type-V chromatic number
is 0 and n-type-V chromatic number is 0.
(vi) : The set of representatives of colors is {}. Thus type-VI chromatic number
is 0 and n-type-VI chromatic number is 0.
(vii) : The set of representatives of colors is {}. Thus type-VII chromatic number
is 0 and n-type-VII chromatic number is 0.

Proof. (i). All edges have same amount so the connectedness amid two given
edges is the same. All edges are type-I. By it’s cycle, all vertices have 2 vertices
which have common edges which are type-I. Thus the set of representatives
of colors is {vi , vj }. The type-I chromatic number is 2 and n-type-I chromatic
number is neutrosophic cardinality of {vi , vj }.
(ii). All edges have same amount so the connectedness amid two given edges

38
 3.1. Different Types of Neutrosophic Chromatic Number

is the same. All edges aren’t type-II. By it’s cycle, all vertices have 2 vertices
which have common edges which aren’t type-II. Thus the set of representatives
of colors is {}. The type-II chromatic number is 0 and n-type-II chromatic
number is 0.
(iii). All edges have same amount so the connectedness amid two given edges is
the same. All edges aren’t type-III. By it’s cycle, all vertices have 2 vertices
which have common edges which aren’t type-III. Thus the set of representatives
of colors is {}. The type-III chromatic number is 0 and n-type-III chromatic
number is 0.
(iv). All edges have same amount so the connectedness amid two given edges
is the same. All edges are type-IV. By it’s cycle, all vertices have 2 vertices
which have common edges which are type-IV. By deletion of one edge, it’s
possible to compute connectedness. Thus the set of representatives of colors is
{vi , vj }. The type-IV chromatic number is 2 and n-type-IV chromatic number
is neutrosophic cardinality of {vi , vj }.
(v). All edges have same amount so the connectedness amid two given edges is
the same. All edges aren’t type-III. By it’s cycle, all vertices have 2 vertices
which have common edges which aren’t type-III. Thus the set of representatives
of colors is {}. The type-III chromatic number is 0 and n-type-III chromatic
number is 0.
(vi). All edges have same amount so the connectedness amid two given edges is
the same. All edges aren’t type-III. By it’s cycle, all vertices have 2 vertices
which have common edges which aren’t type-III. Thus the set of representatives
of colors is {}. The type-III chromatic number is 0 and n-type-III chromatic
number is 0.
(vii). All edges have same amount so the connectedness amid two given edges
is the same. All edges aren’t type-III. By it’s cycle, all vertices have 2 vertices
which have common edges which aren’t type-III. Thus the set of representatives
of colors is {}. The type-III chromatic number is 0 and n-type-III chromatic
number is 0. 

Proposition 3.1.8. Let N = (σ, µ) be a neutrosophic graph which is strong and

even cycle. If it’s fixed-vertex, then

(i) : The set of representatives of colors is {vi , vj }. Thus type-I chromatic

number is 2 and n-type-I chromatic number is 2σ(vi ).

(ii) : The set of representatives of colors is {}. Thus type-II chromatic number
is 0 and n-type-II chromatic number is 0.

(iii) : The set of representatives of colors is {}. Thus type-III chromatic number
is 0 and n-type-III chromatic number is 0.

(iv) : The set of representatives of colors is {vi , vj }. Thus type-IV chromatic

number is 2 and n-type-IV chromatic number is 2σ(vi ).

(v) : The set of representatives of colors is {}. Thus type-V chromatic number
is 0 and n-type-V chromatic number is 0.

(vi) : The set of representatives of colors is {}. Thus type-VI chromatic number
is 0 and n-type-VI chromatic number is 0.

39
 3. New Results

(vii) : The set of representatives of colors is {}. Thus type-VII chromatic number
is 0 and n-type-VII chromatic number is 0.

Proof. (i). All edges have same amount so the connectedness amid two given
edges is the same. All edges are type-I. By it’s cycle, all vertices have 2 vertices
which have common edges which are type-I. Thus the set of representatives
of colors is {vi , vj }. The type-I chromatic number is 2 and n-type-I chromatic
number is neutrosophic cardinality of {vi , vj } which is 2σ(vi ).
(ii). All edges have same amount so the connectedness amid two given edges
is the same. All edges aren’t type-II. By it’s cycle, all vertices have 2 vertices
which have common edges which aren’t type-II. Thus the set of representatives
of colors is {}. The type-II chromatic number is 0 and n-type-II chromatic
number is 0.
(iii). All edges have same amount so the connectedness amid two given edges is
the same. All edges aren’t type-III. By it’s cycle, all vertices have 2 vertices
which have common edges which aren’t type-III. Thus the set of representatives
of colors is {}. The type-III chromatic number is 0 and n-type-III chromatic
number is 0.
(iv). All edges have same amount so the connectedness amid two given edges
is the same. All edges are type-IV. By it’s cycle, all vertices have 2 vertices
which have common edges which are type-IV. By deletion of one edge, it’s
possible to compute connectedness. Thus the set of representatives of colors is
{vi , vj }. The type-IV chromatic number is 2 and n-type-IV chromatic number
is neutrosophic cardinality of {vi , vj } which is 2σ(vi ).
(v). All edges have same amount so the connectedness amid two given edges is
the same. All edges aren’t type-III. By it’s cycle, all vertices have 2 vertices
which have common edges which aren’t type-III. Thus the set of representatives
of colors is {}. The type-III chromatic number is 0 and n-type-III chromatic
number is 0.
(vi). All edges have same amount so the connectedness amid two given edges is
the same. All edges aren’t type-III. By it’s cycle, all vertices have 2 vertices
which have common edges which aren’t type-III. Thus the set of representatives
of colors is {}. The type-III chromatic number is 0 and n-type-III chromatic
number is 0.
(vii). All edges have same amount so the connectedness amid two given edges
is the same. All edges aren’t type-III. By it’s cycle, all vertices have 2 vertices
which have common edges which aren’t type-III. Thus the set of representatives
of colors is {}. The type-III chromatic number is 0 and n-type-III chromatic
number is 0. 

Proposition 3.1.9. Let N = (σ, µ) be a neutrosophic graph which is an odd

cycle. If it’s fixed-edge, then

(i) : The set of representatives of colors is {vi , vj , vk }. Thus type-I chromatic

number is 2 and n-type-I chromatic number is σ(vi ) + σ(vj ) + σ(vk ).

(ii) : The set of representatives of colors is {}. Thus type-II chromatic number
is 0 and n-type-II chromatic number is 0.

(iii) : The set of representatives of colors is {}. Thus type-III chromatic number
is 0 and n-type-III chromatic number is 0.

40
 3.1. Different Types of Neutrosophic Chromatic Number

(iv) : The set of representatives of colors is {vi , vj , vk }. Thus type-IV chromatic

number is 2 and n-type-IV chromatic number is σ(vi ) + σ(vj ) + σ(vk ).

(v) : The set of representatives of colors is {}. Thus type-V chromatic number
is 0 and n-type-V chromatic number is 0.

(vi) : The set of representatives of colors is {}. Thus type-VI chromatic number
is 0 and n-type-VI chromatic number is 0.

(vii) : The set of representatives of colors is {}. Thus type-VII chromatic number
is 0 and n-type-VII chromatic number is 0.

Proof. (i). All edges have same amount so the connectedness amid two given
edges is the same. All edges are type-I. By it’s cycle, all vertices have 2 vertices
which have common edges which are type-I. Thus the set of representatives
of colors is {vi , vj }. The type-I chromatic number is 2 and n-type-I chromatic
number is neutrosophic cardinality of {vi , vj , vk } which is σ(vi ) + σ(vj ) + σ(vk ).
(ii). All edges have same amount so the connectedness amid two given edges is
the same. All edges aren’t type-II. By it’s neutrosophic strong, there’s a vertex
has 2 vertices which have common edges which aren’t type-II. Thus the set of
representatives of colors is {}. The type-II chromatic number is 0 and n-type-II
chromatic number is 0.
(iii). All edges have same amount so the connectedness amid two given edges
is the same. All edges aren’t type-III. By it’s neutrosophic strong, there’s a
vertex has 2 vertices which have common edges which aren’t type-III. Thus the
set of representatives of colors is {}. The type-III chromatic number is 0 and
n-type-III chromatic number is 0.
(iv). All edges have same amount so the connectedness amid two given edges
is the same. All edges are type-IV. By it’s cycle, all vertices have 2 vertices
which have common edges which are type-IV. Thus the set of representatives of
colors is {vi , vj }. The type-IV chromatic number is 2 and n-type-IV chromatic
number is neutrosophic cardinality of {vi , vj , vk } which is σ(vi ) + σ(vj ) + σ(vk ).
(v). All edges have same amount so the connectedness amid two given edges is
the same. All edges aren’t type-V. By it’s neutrosophic strong, there’s a vertex
has 2 vertices which have common edges which aren’t type-V. Thus the set of
representatives of colors is {}. The type-V chromatic number is 0 and n-type-V
chromatic number is 0.
(vi). All edges have same amount so the connectedness amid two given edges is
the same. All edges aren’t type-VI. By it’s cycle, all vertices have 2 vertices
which have common edges which aren’t type-VI. Thus the set of representatives
of colors is {}. The type-VI chromatic number is 0 and n-type-VI chromatic
number is 0.
(vii). All edges have same amount so the connectedness amid two given edges
is the same. All edges aren’t type-VII. By it’s cycle, all vertices have 2 vertices
which have common edges which aren’t type-VII. Thus the set of representatives
of colors is {}. The type-VII chromatic number is 0 and n-type-VII chromatic
number is 0. 

Proposition 3.1.10. Let N = (σ, µ) be a neutrosophic graph which is strong

and odd cycle. If it’s fixed-vertex, then

41
 3. New Results

(i) : The set of representatives of colors is {vi , vj , vk }. Thus type-I chromatic

number is 2 and n-type-I chromatic number is 3σ(vi ).

(ii) : The set of representatives of colors is {}. Thus type-II chromatic number
is 0 and n-type-II chromatic number is 0.

(iii) : The set of representatives of colors is {}. Thus type-III chromatic number
is 0 and n-type-III chromatic number is 0.

(iv) : The set of representatives of colors is {vi , vj , vk }. Thus type-IV chromatic

number is 2 and n-type-IV chromatic number is 3σ(vi ).

(v) : The set of representatives of colors is {}. Thus type-V chromatic number
is 0 and n-type-V chromatic number is 0.

(vi) : The set of representatives of colors is {}. Thus type-VI chromatic number
is 0 and n-type-VI chromatic number is 0.

(vii) : The set of representatives of colors is {}. Thus type-VII chromatic number
is 0 and n-type-VII chromatic number is 0.

Proof. (i). All edges have same amount so the connectedness amid two given
edges is the same. All edges are type-I. By it’s cycle, all vertices have 2 vertices
which have common edges which are type-I. Thus the set of representatives
of colors is {vi , vj }. The type-I chromatic number is 2 and n-type-I chromatic
number is neutrosophic cardinality of {vi , vj , vk } which is 3σ(vi ).
(ii). All edges have same amount so the connectedness amid two given edges is
the same. All edges aren’t type-II. By it’s neutrosophic strong, there’s a vertex
has 2 vertices which have common edges which aren’t type-II. Thus the set of
representatives of colors is {}. The type-II chromatic number is 0 and n-type-II
chromatic number is 0.
(iii). All edges have same amount so the connectedness amid two given edges
is the same. All edges aren’t type-III. By it’s neutrosophic strong, there’s a
vertex has 2 vertices which have common edges which aren’t type-III. Thus the
set of representatives of colors is {}. The type-III chromatic number is 0 and
n-type-III chromatic number is 0.
(iv). All edges have same amount so the connectedness amid two given edges
is the same. All edges are type-IV. By it’s cycle, all vertices have 2 vertices
which have common edges which are type-IV. Thus the set of representatives of
colors is {vi , vj }. The type-IV chromatic number is 2 and n-type-IV chromatic
number is neutrosophic cardinality of {vi , vj , vk } which is 3σ(vi ).
(v). All edges have same amount so the connectedness amid two given edges is
the same. All edges aren’t type-V. By it’s neutrosophic strong, there’s a vertex
has 2 vertices which have common edges which aren’t type-V. Thus the set of
representatives of colors is {}. The type-V chromatic number is 0 and n-type-V
chromatic number is 0.
(vi). All edges have same amount so the connectedness amid two given edges is
the same. All edges aren’t type-VI. By it’s cycle, all vertices have 2 vertices
which have common edges which aren’t type-VI. Thus the set of representatives
of colors is {}. The type-VI chromatic number is 0 and n-type-VI chromatic
number is 0.
(vii). All edges have same amount so the connectedness amid two given edges

42
 3.1. Different Types of Neutrosophic Chromatic Number

is the same. All edges aren’t type-VII. By it’s cycle, all vertices have 2 vertices
which have common edges which aren’t type-VII. Thus the set of representatives
of colors is {}. The type-VII chromatic number is 0 and n-type-VII chromatic
number is 0. 

Proposition 3.1.11. Let N = (σ, µ) be an even wheel. If it’s fixed-edge, then

(i) : The set of representatives of colors is {vi , vj , vk }. Thus type-I chromatic
number is 2 and n-type-I chromatic number is σ(vi ) + σ(vj ) + σ(vk ).
(ii) : The set of representatives of colors is {}. Thus type-II chromatic number
is 0 and n-type-II chromatic number is 0.
(iii) : The set of representatives of colors is {}. Thus type-III chromatic number
is 0 and n-type-III chromatic number is 0.
(iv) : The set of representatives of colors is {vi , vj , vk }. Thus type-IV chromatic
number is 3 and n-type-IV chromatic number is σ(vi ) + σ(vj ) + σ(vk ).
(v) : The set of representatives of colors is {}. Thus type-V chromatic number
is 0 and n-type-V chromatic number is 0.
(vi) : The set of representatives of colors is {}. Thus type-VI chromatic number
is 0 and n-type-VI chromatic number is 0.
(vii) : The set of representatives of colors is {}. Thus type-VII chromatic number
is 0 and n-type-VII chromatic number is 0.

Proof. (i). All edges have same amount so the connectedness amid two given
edges is the same. All edges are type-I. By it’s cycle, all vertices have 2 vertices
which have common edges which are type-I. Thus the set of representatives of
colors is {vi , vj , vk }. The type-I chromatic number is 3 and n-type-I chromatic
number is neutrosophic cardinality of {vi , vj , vk } which is σ(vi ) + σ(vj ) + σ(vk ).
(ii). All edges have same amount so the connectedness amid two given edges
is the same. All edges aren’t type-II. By it’s cycle, all vertices have 2 vertices
which have common edges which aren’t type-II. Thus the set of representatives
of colors is {}. The type-II chromatic number is 0 and n-type-II chromatic
number is 0.
(iii). All edges have same amount so the connectedness amid two given edges is
the same. All edges aren’t type-III. By it’s cycle, all vertices have 2 vertices
which have common edges which aren’t type-III. Thus the set of representatives
of colors is {}. The type-III chromatic number is 0 and n-type-III chromatic
number is 0.
(iv). All edges have same amount so the connectedness amid two given edges
is the same. All edges are type-IV. By it’s cycle, all vertices have 2 vertices
which have common edges which are type-IV. By deletion of one edge, it’s
possible to compute connectedness. Thus the set of representatives of colors
is {vi , vj , vk }. The type-IV chromatic number is 3 and n-type-IV chromatic
number is neutrosophic cardinality of {vi , vj , vk } which is σ(vi ) + σ(vj ) + σ(vk ).
(v). All edges have same amount so the connectedness amid two given edges is
the same. All edges aren’t type-III. By it’s cycle, all vertices have 2 vertices
which have common edges which aren’t type-III. Thus the set of representatives
of colors is {}. The type-III chromatic number is 0 and n-type-III chromatic

43
 3. New Results

number is 0.
(vi). All edges have same amount so the connectedness amid two given edges is
the same. All edges aren’t type-III. By it’s cycle, all vertices have 2 vertices
which have common edges which aren’t type-III. Thus the set of representatives
of colors is {}. The type-III chromatic number is 0 and n-type-III chromatic
number is 0.
(vii). All edges have same amount so the connectedness amid two given edges
is the same. All edges aren’t type-III. By it’s cycle, all vertices have 2 vertices
which have common edges which aren’t type-III. Thus the set of representatives
of colors is {}. The type-III chromatic number is 0 and n-type-III chromatic
number is 0. 

Proposition 3.1.12. Let N = (σ, µ) be a neutrosophic graph which is strong

and even wheel. If it’s fixed-vertex, then
(i) : The set of representatives of colors is {vi , vj , vk }. Thus type-I chromatic
number is 3 and n-type-I chromatic number is 3σ(vi ).
(ii) : The set of representatives of colors is {}. Thus type-II chromatic number
is 0 and n-type-II chromatic number is 0.
(iii) : The set of representatives of colors is {}. Thus type-III chromatic number
is 0 and n-type-III chromatic number is 0.
(iv) : The set of representatives of colors is {vi , vj , vk }. Thus type-IV chromatic
number is 3 and n-type-IV chromatic number is 3σ(vi ).
(v) : The set of representatives of colors is {}. Thus type-V chromatic number
is 0 and n-type-V chromatic number is 0.
(vi) : The set of representatives of colors is {}. Thus type-VI chromatic number
is 0 and n-type-VI chromatic number is 0.
(vii) : The set of representatives of colors is {}. Thus type-VII chromatic number
is 0 and n-type-VII chromatic number is 0.

Proof. (i). All edges have same amount so the connectedness amid two given
edges is the same. All edges are type-I. By it’s cycle, all vertices have 2 vertices
which have common edges which are type-I. Thus the set of representatives of
colors is {vi , vj , vk }. The type-I chromatic number is 3 and n-type-I chromatic
number is neutrosophic cardinality of {vi , vj , vk } which is 3σ(vi ).
(ii). All edges have same amount so the connectedness amid two given edges
is the same. All edges aren’t type-II. By it’s cycle, all vertices have 2 vertices
which have common edges which aren’t type-II. Thus the set of representatives
of colors is {}. The type-II chromatic number is 0 and n-type-II chromatic
number is 0.
(iii). All edges have same amount so the connectedness amid two given edges is
the same. All edges aren’t type-III. By it’s cycle, all vertices have 2 vertices
which have common edges which aren’t type-III. Thus the set of representatives
of colors is {}. The type-III chromatic number is 0 and n-type-III chromatic
number is 0.
(iv). All edges have same amount so the connectedness amid two given edges
is the same. All edges are type-IV. By it’s cycle, all vertices have 3 vertices

44
 3.1. Different Types of Neutrosophic Chromatic Number

which have common edges which are type-IV. By deletion of one edge, it’s
possible to compute connectedness. Thus the set of representatives of colors
is {vi , vj , vk }. The type-IV chromatic number is 3 and n-type-IV chromatic
number is neutrosophic cardinality of {vi , vj , vk } which is 3σ(vi ).
(v). All edges have same amount so the connectedness amid two given edges is
the same. All edges aren’t type-III. By it’s cycle, all vertices have 2 vertices
which have common edges which aren’t type-III. Thus the set of representatives
of colors is {}. The type-III chromatic number is 0 and n-type-III chromatic
number is 0.
(vi). All edges have same amount so the connectedness amid two given edges is
the same. All edges aren’t type-III. By it’s cycle, all vertices have 2 vertices
which have common edges which aren’t type-III. Thus the set of representatives
of colors is {}. The type-III chromatic number is 0 and n-type-III chromatic
number is 0.
(vii). All edges have same amount so the connectedness amid two given edges
is the same. All edges aren’t type-III. By it’s cycle, all vertices have 2 vertices
which have common edges which aren’t type-III. Thus the set of representatives
of colors is {}. The type-III chromatic number is 0 and n-type-III chromatic
number is 0. 

Proposition 3.1.13. Let N = (σ, µ) be a neutrosophic graph which is an odd

wheel. If it’s fixed-edge, then
(i) : The set of representatives of colors is {vi , vj , vk , vs }. Thus type-I chromatic
number is 4 and n-type-I chromatic number is σ(vi )+σ(vj )+σ(vk )+σ(vs ).
(ii) : The set of representatives of colors is {}. Thus type-II chromatic number
is 0 and n-type-II chromatic number is 0.
(iii) : The set of representatives of colors is {}. Thus type-III chromatic number
is 0 and n-type-III chromatic number is 0.
(iv) : The set of representatives of colors is {vi , vj , vk , vs }. Thus type-IV
chromatic number is 2 and n-type-IV chromatic number is σ(vi ) + σ(vj ) +
σ(vk ) + σ(vs ).
(v) : The set of representatives of colors is {}. Thus type-V chromatic number
is 0 and n-type-V chromatic number is 0.
(vi) : The set of representatives of colors is {}. Thus type-VI chromatic number
is 0 and n-type-VI chromatic number is 0.
(vii) : The set of representatives of colors is {}. Thus type-VII chromatic number
is 0 and n-type-VII chromatic number is 0.

Proof. (i). All edges have same amount so the connectedness amid two given
edges is the same. All edges are type-I. By it’s cycle, all vertices have 2 vertices
which have common edges which are type-I. Thus the set of representatives
of colors is {vi , vj , vk , vs }. The type-I chromatic number is 4 and n-type-
I chromatic number is neutrosophic cardinality of {vi , vj , vk , vs } which is
σ(vi ) + σ(vj ) + σ(vk ) + σ(vs ).
(ii). All edges have same amount so the connectedness amid two given edges is
the same. All edges aren’t type-II. By it’s neutrosophic strong, there’s a vertex

45
 3. New Results

has 2 vertices which have common edges which aren’t type-II. Thus the set of
representatives of colors is {}. The type-II chromatic number is 0 and n-type-II
chromatic number is 0.
(iii). All edges have same amount so the connectedness amid two given edges
is the same. All edges aren’t type-III. By it’s neutrosophic strong, there’s a
vertex has 2 vertices which have common edges which aren’t type-III. Thus the
set of representatives of colors is {}. The type-III chromatic number is 0 and
n-type-III chromatic number is 0.
(iv). All edges have same amount so the connectedness amid two given edges
is the same. All edges are type-IV. By it’s cycle, all vertices have 2 vertices
which have common edges which are type-IV. Thus the set of representatives
of colors is {vi , vj , vk , vs }. The type-IV chromatic number is 4 and n-type-
IV chromatic number is neutrosophic cardinality of {vi , vj , vk , vs } which is
σ(vi ) + σ(vj ) + σ(vk ) + σ(vs ).
(v). All edges have same amount so the connectedness amid two given edges is
the same. All edges aren’t type-V. By it’s neutrosophic strong, there’s a vertex
has 2 vertices which have common edges which aren’t type-V. Thus the set of
representatives of colors is {}. The type-V chromatic number is 0 and n-type-V
chromatic number is 0.
(vi). All edges have same amount so the connectedness amid two given edges is
the same. All edges aren’t type-VI. By it’s cycle, all vertices have 2 vertices
which have common edges which aren’t type-VI. Thus the set of representatives
of colors is {}. The type-VI chromatic number is 0 and n-type-VI chromatic
number is 0.
(vii). All edges have same amount so the connectedness amid two given edges
is the same. All edges aren’t type-VII. By it’s cycle, all vertices have 2 vertices
which have common edges which aren’t type-VII. Thus the set of representatives
of colors is {}. The type-VII chromatic number is 0 and n-type-VII chromatic
number is 0. 

Proposition 3.1.14. Let N = (σ, µ) be a neutrosophic graph which is strong

and odd wheel. If it’s fixed-vertex, then
(i) : The set of representatives of colors is {vi , vj , vk , vs }. Thus type-I chromatic
number is 4 and n-type-I chromatic number is 4σ(vi ).
(ii) : The set of representatives of colors is {}. Thus type-II chromatic number
is 0 and n-type-II chromatic number is 0.
(iii) : The set of representatives of colors is {}. Thus type-III chromatic number
is 0 and n-type-III chromatic number is 0.
(iv) : The set of representatives of colors is {vi , vj , vk , vs }. Thus type-IV
chromatic number is 4 and n-type-IV chromatic number is 4σ(vi ).
(v) : The set of representatives of colors is {}. Thus type-V chromatic number
is 0 and n-type-V chromatic number is 0.
(vi) : The set of representatives of colors is {}. Thus type-VI chromatic number
is 0 and n-type-VI chromatic number is 0.
(vii) : The set of representatives of colors is {}. Thus type-VII chromatic number
is 0 and n-type-VII chromatic number is 0.

46
 3.1. Different Types of Neutrosophic Chromatic Number

Proof. (i). All edges have same amount so the connectedness amid two given
edges is the same. All edges are type-I. By it’s cycle, all vertices have 2 vertices
which have common edges which are type-I. Thus the set of representatives of
colors is {vi , vj , vk , vs }. The type-I chromatic number is 4 and n-type-I chromatic
number is neutrosophic cardinality of {vi , vj , vk , vs } which is 4σ(vi ).
(ii). All edges have same amount so the connectedness amid two given edges is
the same. All edges aren’t type-II. By it’s neutrosophic strong, there’s a vertex
has 2 vertices which have common edges which aren’t type-II. Thus the set of
representatives of colors is {}. The type-II chromatic number is 0 and n-type-II
chromatic number is 0.
(iii). All edges have same amount so the connectedness amid two given edges
is the same. All edges aren’t type-III. By it’s neutrosophic strong, there’s a
vertex has 2 vertices which have common edges which aren’t type-III. Thus the
set of representatives of colors is {}. The type-III chromatic number is 0 and
n-type-III chromatic number is 0.
(iv). All edges have same amount so the connectedness amid two given edges is
the same. All edges are type-IV. By it’s cycle, all vertices have 2 vertices which
have common edges which are type-IV. Thus the set of representatives of colors
is {vi , vj , vk , vs }. The type-IV chromatic number is 4 and n-type-IV chromatic
number is neutrosophic cardinality of {vi , vj , vk , vs } which is 4σ(vi ).
(v). All edges have same amount so the connectedness amid two given edges is
the same. All edges aren’t type-V. By it’s neutrosophic strong, there’s a vertex
has 2 vertices which have common edges which aren’t type-V. Thus the set of
representatives of colors is {}. The type-V chromatic number is 0 and n-type-V
chromatic number is 0.
(vi). All edges have same amount so the connectedness amid two given edges is
the same. All edges aren’t type-VI. By it’s cycle, all vertices have 2 vertices
which have common edges which aren’t type-VI. Thus the set of representatives
of colors is {}. The type-VI chromatic number is 0 and n-type-VI chromatic
number is 0.
(vii). All edges have same amount so the connectedness amid two given edges
is the same. All edges aren’t type-VII. By it’s cycle, all vertices have 2 vertices
which have common edges which aren’t type-VII. Thus the set of representatives
of colors is {}. The type-VII chromatic number is 0 and n-type-VII chromatic
number is 0. 
Proposition 3.1.15. Let N = (σ, µ) be a neutrosophic graph which is complete
t−partite. If it’s fixed-edge, then
(i) : The set of representatives of colors is {v1 , v2 , · · · , vt }. Thus type-I
chromatic number is t and n-type-I chromatic number is σ(v1 ) + σ(v2 ) +
· · · + σ(vt ).
(ii) : The set of representatives of colors is {}. Thus type-II chromatic number
is 0 and n-type-II chromatic number is 0.
(iii) : The set of representatives of colors is {}. Thus type-III chromatic number
is 0 and n-type-III chromatic number is 0.
(iv) : The set of representatives of colors is {v1 , v2 , · · · , vt }. Thus type-IV
chromatic number is t and n-type-IV chromatic number is σ(v1 ) + σ(v2 ) +
· · · + σ(vt ).

47
 3. New Results

(v) : The set of representatives of colors is {}. Thus type-V chromatic number
is 0 and n-type-V chromatic number is 0.
(vi) : The set of representatives of colors is {}. Thus type-VI chromatic number
is 0 and n-type-VI chromatic number is 0.
(vii) : The set of representatives of colors is {}. Thus type-VII chromatic number
is 0 and n-type-VII chromatic number is 0.
Proof. (i). All edges have same amount so the connectedness amid two given
edges is the same. All edges are type-I. By it’s neutrosophic complete, there’s a
vertex has t − 1 which have common edges which are type-I. Thus the set of
representatives of colors is {v1 , v2 , · · · , vt }. The type-I chromatic number is t
and n-type-I chromatic number is neutrosophic cardinality of {v1 , v2 , · · · , vt }
which is σ(v1 ) + σ(v2 ) + · · · + σ(vt ).
(ii). All edges have same amount so the connectedness amid two given edges
is the same. All edges aren’t type-II. By it’s neutrosophic complete, there’s a
vertex has t − 1 vertices which have common edges which aren’t type-II. Thus
the set of representatives of colors is {}. The type-II chromatic number is 0 and
n-type-II chromatic number is 0.
(iii). All edges have same amount so the connectedness amid two given edges is
the same. All edges aren’t type-III. By it’s neutrosophic complete, there’s a
vertex has t − 1 vertices which have common edges which aren’t type-III. Thus
the set of representatives of colors is {}. The type-III chromatic number is 0
and n-type-III chromatic number is 0.
(iv). All edges have same amount so the connectedness amid two given edges is
the same. All edges are type-IV. By it’s neutrosophic complete, there’s a vertex
has t − 1 vertices which have common edges which are type-IV. Thus the set of
representatives of colors is {v1 , v2 , · · · , vt }. The type-IV chromatic number is t
and n-type-IV chromatic number is neutrosophic cardinality of {v1 , v2 , · · · , vt }
which is σ(v1 ) + σ(v2 ) + · · · + σ(vt ).
(v). All edges have same amount so the connectedness amid two given edges
is the same. All edges aren’t type-V. By it’s neutrosophic complete, there’s a
vertex has t − 1 vertices which have common edges which aren’t type-V. Thus
the set of representatives of colors is {}. The type-V chromatic number is 0 and
n-type-V chromatic number is 0.
(vi). All edges have same amount so the connectedness amid two given edges is
the same. All edges aren’t type-VI. By it’s neutrosophic complete, there’s a
vertex has t − 1 vertices which have common edges which aren’t type-VI. Thus
the set of representatives of colors is {}. The type-VI chromatic number is 0
and n-type-VI chromatic number is 0.
(vii). All edges have same amount so the connectedness amid two given edges
is the same. All edges aren’t type-VII. By it’s neutrosophic complete, there’s a
vertex has t − 1 vertices which have common edges which aren’t type-VII. Thus
the set of representatives of colors is {}. The type-VII chromatic number is 0
and n-type-VII chromatic number is 0. 
Proposition 3.1.16. Let N = (σ, µ) be a neutrosophic graph which is complete
t−partite. If it’s fixed-vertex, then
(i) : The set of representatives of colors is {v1 , v2 , · · · , vt }. Thus type-I
chromatic number is t and n-type-I chromatic number is tσ(vi ).

48
 3.1. Different Types of Neutrosophic Chromatic Number

(ii) : The set of representatives of colors is {}. Thus type-II chromatic number
is 0 and n-type-II chromatic number is 0.
(iii) : The set of representatives of colors is {}. Thus type-III chromatic number
is 0 and n-type-III chromatic number is 0.
(iv) : The set of representatives of colors is {v1 , v2 , · · · , vt }. Thus type-IV
chromatic number is t and n-type-IV chromatic number is tσ(vi ).
(v) : The set of representatives of colors is {}. Thus type-V chromatic number
is 0 and n-type-V chromatic number is 0.
(vi) : The set of representatives of colors is {}. Thus type-VI chromatic number
is 0 and n-type-VI chromatic number is 0.
(vii) : The set of representatives of colors is {}. Thus type-VII chromatic number
is 0 and n-type-VII chromatic number is 0.

Proof. (i). All edges have same amount so the connectedness amid two given
edges is the same. All edges are type-I. By it’s neutrosophic complete, there’s a
vertex has t−1 vertices which have common edges which are type-I. Thus the set
of representatives of colors is {v1 , v2 , · · · , vt }. The type-I chromatic number is t
and n-type-I chromatic number is neutrosophic cardinality of {v1 , v2 , · · · , vt }.
which is tσ(vi ).
(ii). All edges have same amount so the connectedness amid two given edges
is the same. All edges aren’t type-II. By it’s neutrosophic complete, there’s a
vertex has t − 1 vertices which have common edges which aren’t type-II. Thus
the set of representatives of colors is {}. The type-II chromatic number is 0 and
n-type-II chromatic number is 0.
(iii). All edges have same amount so the connectedness amid two given edges is
the same. All edges aren’t type-III. By it’s neutrosophic complete, there’s a
vertex has t − 1 vertices which have common edges which aren’t type-III. Thus
the set of representatives of colors is {}. The type-III chromatic number is 0
and n-type-III chromatic number is 0.
(iv). All edges have same amount so the connectedness amid two given edges is
the same. All edges are type-IV. By it’s neutrosophic complete, there’s a vertex
has t − 1 vertices which have common edges which are type-IV. Thus the set of
representatives of colors is {v1 , v2 , · · · , vt }. The type-IV chromatic number is t
and n-type-IV chromatic number is neutrosophic c{v1 , v2 , · · · , vt }.{vi , vj , vk , vs }
which is tσ(vi ).
(v). All edges have same amount so the connectedness amid two given edges
is the same. All edges aren’t type-V. By it’s neutrosophic complete, there’s a
vertex has t − 1 vertices which have common edges which aren’t type-V. Thus
the set of representatives of colors is {}. The type-V chromatic number is 0 and
n-type-V chromatic number is 0.
(vi). All edges have same amount so the connectedness amid two given edges is
the same. All edges aren’t type-VI. By it’s neutrosophic complete, there’s a
vertex has t − 1 vertices which have common edges which aren’t type-VI. Thus
the set of representatives of colors is {}. The type-VI chromatic number is 0
and n-type-VI chromatic number is 0.
(vii). All edges have same amount so the connectedness amid two given edges
is the same. All edges aren’t type-VII. By it’s neutrosophic complete, there’s a

49
 3. New Results

vertex has t − 1 vertices which have common edges which aren’t type-VII. Thus
the set of representatives of colors is {}. The type-VII chromatic number is 0
and n-type-VII chromatic number is 0. 

Corollary 3.1.17. Let N = (σ, µ) be a neutrosophic graph which is complete

bipartite. If it’s fixed-edge, then
(i) : The set of representatives of colors is {v1 , v2 }. Thus type-I chromatic
number is 2 and n-type-I chromatic number is σ(v1 ) + σ(v2 ).
(ii) : The set of representatives of colors is {}. Thus type-II chromatic number
is 0 and n-type-II chromatic number is 0.
(iii) : The set of representatives of colors is {}. Thus type-III chromatic number
is 0 and n-type-III chromatic number is 0.
(iv) : The set of representatives of colors is {v1 , v2 }. Thus type-IV chromatic
number is 2 and n-type-IV chromatic number is σ(v1 ) + σ(v2 ).
(v) : The set of representatives of colors is {}. Thus type-V chromatic number
is 0 and n-type-V chromatic number is 0.
(vi) : The set of representatives of colors is {}. Thus type-VI chromatic number
is 0 and n-type-VI chromatic number is 0.
(vii) : The set of representatives of colors is {}. Thus type-VII chromatic number
is 0 and n-type-VII chromatic number is 0.

Proof. (i). All edges have same amount so the connectedness amid two given
edges is the same. All edges are type-I. By it’s neutrosophic complete, there’s
a vertex has 1 which have common edges which are type-I. Thus the set of
representatives of colors is {v1 , v2 }. The type-I chromatic number is 2 and
n-type-I chromatic number is neutrosophic cardinality of {v1 , v2 } which is
σ(v1 ) + σ(v2 ).
(ii). All edges have same amount so the connectedness amid two given edges
is the same. All edges aren’t type-II. By it’s neutrosophic complete, there’s a
vertex has 1 vertices which have common edges which aren’t type-II. Thus the
set of representatives of colors is {}. The type-II chromatic number is 0 and
n-type-II chromatic number is 0.
(iii). All edges have same amount so the connectedness amid two given edges is
the same. All edges aren’t type-III. By it’s neutrosophic complete, there’s a
vertex has 1 vertices which have common edges which aren’t type-III. Thus the
set of representatives of colors is {}. The type-III chromatic number is 0 and
n-type-III chromatic number is 0.
(iv). All edges have same amount so the connectedness amid two given edges
is the same. All edges are type-IV. By it’s neutrosophic complete, there’s a
vertex has 1 vertices which have common edges which are type-IV. Thus the
set of representatives of colors is {v1 , v2 }. The type-IV chromatic number is 2
and n-type-IV chromatic number is neutrosophic cardinality of {v1 , v2 } which
is σ(v1 ) + σ(v2 ).
(v). All edges have same amount so the connectedness amid two given edges
is the same. All edges aren’t type-V. By it’s neutrosophic complete, there’s a
vertex has 1 vertices which have common edges which aren’t type-V. Thus the

50
 3.1. Different Types of Neutrosophic Chromatic Number

set of representatives of colors is {}. The type-V chromatic number is 0 and

n-type-V chromatic number is 0.
(vi). All edges have same amount so the connectedness amid two given edges is
the same. All edges aren’t type-VI. By it’s neutrosophic complete, there’s a
vertex has 1 vertices which have common edges which aren’t type-VI. Thus the
set of representatives of colors is {}. The type-VI chromatic number is 0 and
n-type-VI chromatic number is 0.
(vii). All edges have same amount so the connectedness amid two given edges
is the same. All edges aren’t type-VII. By it’s neutrosophic complete, there’s a
vertex has 1 vertices which have common edges which aren’t type-VII. Thus
the set of representatives of colors is {}. The type-VII chromatic number is 0
and n-type-VII chromatic number is 0. 

Corollary 3.1.18. Let N = (σ, µ) be a neutrosophic graph which is complete

bipartite. If it’s fixed-vertex, then
(i) : The set of representatives of colors is {v1 , v2 }. Thus type-I chromatic
number is 2 and n-type-I chromatic number is 2σ(vi ).
(ii) : The set of representatives of colors is {}. Thus type-II chromatic number
is 0 and n-type-II chromatic number is 0.
(iii) : The set of representatives of colors is {}. Thus type-III chromatic number
is 0 and n-type-III chromatic number is 0.
(iv) : The set of representatives of colors is {v1 , v2 }. Thus type-IV chromatic
number is t and n-type-IV chromatic number is 2σ(vi ).
(v) : The set of representatives of colors is {}. Thus type-V chromatic number
is 0 and n-type-V chromatic number is 0.
(vi) : The set of representatives of colors is {}. Thus type-VI chromatic number
is 0 and n-type-VI chromatic number is 0.
(vii) : The set of representatives of colors is {}. Thus type-VII chromatic number
is 0 and n-type-VII chromatic number is 0.

Proof. (i). All edges have same amount so the connectedness amid two given
edges is the same. All edges are type-I. By it’s neutrosophic complete, there’s
a vertex has 1 vertices which have common edges which are type-I. Thus the
set of representatives of colors is {v1 , v2 }. The type-I chromatic number is 2
and n-type-I chromatic number is neutrosophic cardinality of {v1 , v2 }. which is
2σ(vi ).
(ii). All edges have same amount so the connectedness amid two given edges
is the same. All edges aren’t type-II. By it’s neutrosophic complete, there’s a
vertex has 1 vertices which have common edges which aren’t type-II. Thus the
set of representatives of colors is {}. The type-II chromatic number is 0 and
n-type-II chromatic number is 0.
(iii). All edges have same amount so the connectedness amid two given edges is
the same. All edges aren’t type-III. By it’s neutrosophic complete, there’s a
vertex has 1 vertices which have common edges which aren’t type-III. Thus the
set of representatives of colors is {}. The type-III chromatic number is 0 and
n-type-III chromatic number is 0.

51
 3. New Results

(iv). All edges have same amount so the connectedness amid two given edges
is the same. All edges are type-IV. By it’s neutrosophic complete, there’s a
vertex has 1 vertices which have common edges which are type-IV. Thus the
set of representatives of colors is {v1 , v2 }. The type-IV chromatic number is 2
and n-type-IV chromatic number is neutrosophic {v1 , v2 } which is 2σ(vi ).
(v). All edges have same amount so the connectedness amid two given edges
is the same. All edges aren’t type-V. By it’s neutrosophic complete, there’s a
vertex has 1 vertices which have common edges which aren’t type-V. Thus the
set of representatives of colors is {}. The type-V chromatic number is 0 and
n-type-V chromatic number is 0.
(vi). All edges have same amount so the connectedness amid two given edges is
the same. All edges aren’t type-VI. By it’s neutrosophic complete, there’s a
vertex has 1 vertices which have common edges which aren’t type-VI. Thus the
set of representatives of colors is {}. The type-VI chromatic number is 0 and
n-type-VI chromatic number is 0.
(vii). All edges have same amount so the connectedness amid two given edges
is the same. All edges aren’t type-VII. By it’s neutrosophic complete, there’s a
vertex has 1 vertices which have common edges which aren’t type-VII. Thus
the set of representatives of colors is {}. The type-VII chromatic number is 0
and n-type-VII chromatic number is 0. 

Corollary 3.1.19. Let N = (σ, µ) be a neutrosophic graph which is star. If it’s

fixed-edge, then
(i) : The set of representatives of colors is {c, v2 }. Thus type-I chromatic
number is 2 and n-type-I chromatic number is σ(c) + σ(v2 ).
(ii) : The set of representatives of colors is {}. Thus type-II chromatic number
is 0 and n-type-II chromatic number is 0.
(iii) : The set of representatives of colors is {}. Thus type-III chromatic number
is 0 and n-type-III chromatic number is 0.
(iv) : The set of representatives of colors, type-IV chromatic number and n-type-
IV chromatic number aren’t defined.
(v) : The set of representatives of colors, type-V chromatic number and n-type-V
chromatic number aren’t defined.
(vi) : The set of representatives of colors, type-VI chromatic number and n-type-
VI chromatic number aren’t defined.
(vii) : The set of representatives of colors, type-VII chromatic number and n-
type-VII chromatic number aren’t defined.

Proof. (i). All edges have same amount so the connectedness amid two given
edges is the same. All edges are type-I. By it’s neutrosophic complete, there’s
a vertex has 1 which have common edges which are type-I. Thus the set of
representatives of colors is {v1 , v2 }. The type-I chromatic number is 2 and
n-type-I chromatic number is neutrosophic cardinality of {v1 , v2 } which is
σ(v1 ) + σ(v2 ).
(ii). All edges have same amount so the connectedness amid two given edges
is the same. All edges aren’t type-II. By it’s neutrosophic complete, there’s a

52
 3.1. Different Types of Neutrosophic Chromatic Number

vertex has 1 vertices which have common edges which aren’t type-II. Thus the
set of representatives of colors is {}. The type-II chromatic number is 0 and
n-type-II chromatic number is 0.
(iii). All edges have same amount so the connectedness amid two given edges is
the same. All edges aren’t type-III. By it’s neutrosophic complete, there’s a
vertex has 1 vertices which have common edges which aren’t type-III. Thus the
set of representatives of colors is {}. The type-III chromatic number is 0 and
n-type-III chromatic number is 0.
(iv). By it’s fixed-vertex and it’s neutrosophic strong, all edges have same
amount so the connectedness amid two given edges is the same. All edges aren’t
type-IV. Since it’s impossible to define when there’s no cycle in neutrosophic
graph.
(v). By it’s fixed-vertex and it’s neutrosophic strong, all edges have same amount
so the connectedness amid two given edges is the same. All edges aren’t type-V.
Since it’s impossible to define when there’s no cycle in neutrosophic graph.
(vi). By it’s fixed-vertex and it’s neutrosophic strong, all edges have same
amount so the connectedness amid two given edges is the same. All edges aren’t
type-VI. Since it’s impossible to define when there’s no cycle in neutrosophic
graph.
(vii). By it’s fixed-vertex and it’s neutrosophic strong, all edges have same
amount so the connectedness amid two given edges is the same. All edges aren’t
type-VII. Since it’s impossible to define when there’s no cycle in neutrosophic
graph.


Corollary 3.1.20. Let N = (σ, µ) be a neutrosophic graph which is star. If it’s

fixed-vertex, then
(i) : The set of representatives of colors is {v1 , c}. Thus type-I chromatic
number is 2 and n-type-I chromatic number is 2σ(c).
(ii) : The set of representatives of colors is {}. Thus type-II chromatic number
is 0 and n-type-II chromatic number is 0.
(iii) : The set of representatives of colors is {}. Thus type-III chromatic number
is 0 and n-type-III chromatic number is 0.
(iv) : The set of representatives of colors, type-IV chromatic number and n-type-
IV chromatic number aren’t defined.
(v) : The set of representatives of colors, type-V chromatic number and n-type-V
chromatic number aren’t defined.
(vi) : The set of representatives of colors, type-VI chromatic number and n-type-
VI chromatic number aren’t defined.
(vii) : The set of representatives of colors, type-VII chromatic number and n-
type-VII chromatic number aren’t defined.

Proof. (i). All edges have same amount so the connectedness amid two given
edges is the same. All edges are type-I. By it’s neutrosophic complete, there’s
a vertex has 1 vertices which have common edges which are type-I. Thus the
set of representatives of colors is {c, v2 }. The type-I chromatic number is 2 and

53
3. New Results

n-type-I chromatic number is neutrosophic cardinality of {c, v2 }. which is 2σ(c).

(ii). All edges have same amount so the connectedness amid two given edges
is the same. All edges aren’t type-II. By it’s neutrosophic complete, there’s a
vertex has 1 vertices which have common edges which aren’t type-II. Thus the
set of representatives of colors is {}. The type-II chromatic number is 0 and
n-type-II chromatic number is 0.
(iii). All edges have same amount so the connectedness amid two given edges is
the same. All edges aren’t type-III. By it’s neutrosophic complete, there’s a
vertex has 1 vertices which have common edges which aren’t type-III. Thus the
set of representatives of colors is {}. The type-III chromatic number is 0 and
n-type-III chromatic number is 0.
(iv). By it’s fixed-vertex and it’s neutrosophic strong, all edges have same
amount so the connectedness amid two given edges is the same. All edges aren’t
type-IV. Since it’s impossible to define when there’s no cycle in neutrosophic
graph.
(v). By it’s fixed-vertex and it’s neutrosophic strong, all edges have same amount
so the connectedness amid two given edges is the same. All edges aren’t type-V.
Since it’s impossible to define when there’s no cycle in neutrosophic graph.
(vi). By it’s fixed-vertex and it’s neutrosophic strong, all edges have same
amount so the connectedness amid two given edges is the same. All edges aren’t
type-VI. Since it’s impossible to define when there’s no cycle in neutrosophic
graph.
(vii). By it’s fixed-vertex and it’s neutrosophic strong, all edges have same
amount so the connectedness amid two given edges is the same. All edges aren’t
type-VII. Since it’s impossible to define when there’s no cycle in neutrosophic
graph. 

Applications in Time Table and Scheduling

Designing the programs to achieve some goals is general approach to apply on
some issues to function properly. Separation has key role in the context of this
style. Separating the duration of work which are consecutive, is the matter and
it has important 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 section. Beyond that, sometimes sections are not the same.

Step 3. (Model) As Figure (3.1), the situation is designed as a model. The

model uses data to assign every section and to assign to relation amid
section, 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 relation amid them.
Table (3.1), clarifies about the assigned numbers to these situation.

Step 4. (Solution) As Figure (3.1) shows, neutrosophic model, proposes to

use different types of chromatic number which is incomputable for types
IV,V,VI,VII in the case which is titled T 0 . In this case, i1 and c1 aren’t

54
 3.1. Different Types of Neutrosophic Chromatic Number

Figure 3.1: Black vertices are suspicions about choosing them. fgr1c

Table 3.1: Scheduling concerns its Subjects and its Connections as a

Neutrosophic Graph in a Model. tbl1c

Sections of T s1 s2 s3 s4 s5 s6 s7 s8 s9 , s10
Values 0.1 0.8 0.7 0.8 0.1 0.3 0.6 0.5 0.2
Connections of T s1 s2 s2 s3 s3 s4 s4 s5 s5 s6 s6 s7 s7 s8 s8 s9 s9 s10
Values 0.1 0.6 0.4 0.1 0.1 0.2 0.4 0.2 0.1

representative of these two colors and different types of chromatic number

is incomputable for types IV,V,VI,VII. The set {i1 , c1 } doesn’t contain
representatives of colors which pose different types of chromatic number
and different types of chromatic number for types IV,V,VI,VII. Thus the
decision amid choosing the subject c1 an c2 isn’t concluded to choose
c1 for types IV,V,VI,VII. To get brief overview, neutrosophic model
uses one number for every array so 0.9 means (0.9, 0.9, 0.9). In Figure
(3.1), the neutrosophic model T introduces the common situation. The
representatives of colors are i2 and c1 . Thus different types of chromatic
numbers is two for types I and IV and different types of neutrosophic
chromatic number is 1.4 for types I and IV. Thus suspicion about choosing
i1 and i2 is determined to be i2 . The sets of representative for colors
are {i2 , c1 } for types I and IV. Thus the comparative studies based on
different types of chromatic number and neutrosophic chromatic number
are concluded.

Open Problems
The two notions of coloring of vertices concerning different types of chromatic
number and different types of neutrosophic chromatic number are defined on
neutrosophic graphs when connectedness and as its consequences, different types
of edges have key role to have these notions. Thus
Question 3.1.21. Is it possible to use other types edges via connectedness to
define different types of chromatic number and different types of neutrosophic
chromatic number?

55
3. New Results

Question 3.1.22. Are existed some connections amid the coloring from
connectedness inside this concept and external connections with other types
of coloring from other notions?
Question 3.1.23. Is it possible to construct some classes neutrosophic graphs
which have “nice” behavior?
Question 3.1.24. Which applications do make an independent study to apply
different types of chromatic number and different types of neutrosophic chromatic
number?
Problem 3.1.25. Which parameters are related to this parameter?
Problem 3.1.26. Which approaches do work to construct applications to create
independent study?
Problem 3.1.27. Which approaches do work to construct definitions which use
all three arrays and the relations amid them instead of one array of three arrays
to create independent study?

Conclusion and Closing Remarks

This study uses mixed combinations of different types of chromatic number
and different types of neutrosophic chromatic number to study on neutrosophic
graphs. The connections of vertices which are clarified by special edges and
different edges from connectedness, differ them from each other and and put
them in different categories to represent one representative for each color.
Further studies could be about changes in the settings to compare this notion
amid different settings of graph theory. One way is finding some relations amid
array of vertices to make sensible definitions. In Table (1.4), some limitations
and advantages of this study is pointed out.

Table 3.2: A Brief Overview about Advantages and Limitations of this study tbl2c

Advantages Limitations
1. Using connectedness for labelling edges 1. General Results

2. Using neutrosophic cardinality

3. Using cardinality 2. Connections with parameters

4. Applying Different Types of Edges

5. Different Types of Chromatic Notions 3. Connections of Results

56
 Bibliography

Ref1 [1] Henry Garrett, Big Sets Of Vertices, Preprints 2021, 2021060189 (doi:
10.20944/preprints202106.0189.v1).
Ref10 [2] Henry Garrett, Chromatic Number and Neutrosophic Chromatic Number,
ResearchGate 2021 (doi: 10.13140/RG.2.2.36035.73766).
Ref12 [3] Henry Garrett, Different Types of Neutrosophic Chromatic Number,
ResearchGate 2021 (doi: 10.13140/RG.2.2.19068.46723).
Ref2 [4] Henry Garrett, Locating And Location Number, Preprints 2021,
2021060206 (doi: 10.20944/preprints202106.0206.v1).
Ref9 [5] Henry Garrett, Matroid And Its Outlines, Preprints 2021, 2021060146
(doi: 10.20944/preprints202106.0146.v1).
Ref3 [6] Henry Garrett, Metric Dimension in Fuzzy Graphs and Neutro-
sophic Graphs, Preprints 2021, 2021110142 (doi: 10.20944/pre-
prints202111.0142.v1).
Ref4 [7] Henry Garrett, Metric Dimension in fuzzy (neutrsophic) Graphs-II,
Preprints 2021, 2021110142 (doi: 10.20944/preprints202111.0142.v2).
Ref6 [8] Henry Garrett, Metric Dimensions Of Graphs, Preprints 2021, 2021060392
(doi: 10.20944/preprints202106.0392.v1).
Ref5 [9] Henry Garrett, Metric Dimensions Of Graphs #12, ResearchGate 2021
(doi: 10.13140/RG.2.2.20690.48322).
Ref11 [10] Henry Garrett, Neutrosophic Chromatic Number Based on Connectedness,
ResearchGate 2021 (doi: 10.13140/RG.2.2.18563.84001).
Ref7 [11] Henry Garrett, New Graph Of Graph, Preprints 2021, 2021060323 (doi:
10.20944/preprints202106.0323.v1).
Ref8 [12] Henry Garrett, Numbers Based On Edges, Preprints 2021, 2021060315
(doi: 10.20944/preprints202106.0315.v1).

57