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

net/publication/356894673

Chromatic Number and Neutrosophic Chromatic Number

Preprint · December 2021

DOI: 10.13140/RG.2.2.36035.73766

CITATIONS READS
0 5

1 author:

Henry Garrett

71 PUBLICATIONS   17 CITATIONS   

SEE PROFILE

Some of the authors of this publication are also working on these related projects:

On Combinatorics View project

On Algebraic Structures and Algebraic Hyperstructures View project

All content following this page was uploaded by Henry Garrett on 09 December 2021.

The user has requested enhancement of the downloaded file.

Chromatic Number and Neutrosophic Chromatic Number
Henry Garrett

Independent Researcher

[email protected]

Twitter’s ID: @DrHenryGarrett | DrHenryGarrett.wordpress.com

c

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 assigns 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: Fuzzy Graphs, Neutrosophic Graphs, Dimension

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

1 Background 1

Fuzzy set in Ref. [15], neutrosophic set in Ref. [2], related definitions of other sets in 2

Refs. [2, 13, 14], graphs and new notions on them in Refs. [5–11], neutrosophic graphs 3

in Ref. [3], studies on neutrosophic graphs in Ref. [1], relevant definitions of other 4

graphs based on fuzzy graphs in Ref. [12], related definitions of other graphs based on 5

neutrosophic graphs in Ref. [4], are proposed. 6

In this section, I use two subsections to illustrate a perspective about the 7

background of this study. 8

1.1 Motivation and Contributions 9

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

Question 1.1. Is it possible to use mixed versions of ideas concerning “neutrosophic 11

strong edges”, “neutrosophic graphs” and “neutrosophic coloring” to define some 12

notions which are applied to neutrosophic graphs? 13

1/10
 It’s motivation to find notions to use in any classes of neutrosophic graphs. 14

Real-world applications about time table and scheduling are another thoughts which 15

lead to be considered as motivation. Connections amid two items have key roles to 16

assign colors. Thus they’re used to define new ideas which conclude to the structure of 17

coloring. The concept of having strong edge inspire to study the behavior of strong edge 18

in the way that, both neutrosophic chromatic number and chromatic number are the 19

cases of study. 20

The framework of this study is as follows. In section (1.2), I introduce basic 21

definitions to clarify about preliminaries. In section (2), new notion of coloring is 22

applied to the vertices of neutrosophic graphs. Neutrosophic strong edge has the key role 23

in this way. Classes of neutrosophic graphs are studied when the edges are neutrosophic 24

strong. In section (3), one application is posed for neutrosophic graphs concerning time 25

table and scheduling when the suspicions are about choosing some subjects. In section 26

(4), some problems and questions for further studies are proposed. In section (5), gentle 27

discussion about results and applications are featured. In section (5), a brief overview 28

concerning advantages and limitations of this study alongside conclusions are formed. 29

1.2 Preliminaries 30

Definition 1.2. G : (V, E) is called a crisp graph where V is a set of objects and E 31

is a subset of V × V such that this subset is symmetric. 32

Definition 1.3. A crisp graph G : (V, E) is called a neutrosophic graph G : (σ, µ) 33

where σ = (σ1 , σ2 , σ3 ) : V → [0, 1] and µ = (µ1 , µ2 .µ3 ) : E → [0, 1] such that 34

µ(xy) ≤ σ(x) ∧ σ(y) for all xy ∈ E. 35

Definition 1.4. A neutrosophic graph is called neutrosophic empty if it has no 36

edge. It’s also called neutrosophic trivial. A neutrosophic graph which isn’t 37

neutrosophic empty, is called neutrosophic nontrivial. 38

Definition 1.5. A neutrosophic graph G : (σ, µ) is called a neutrosophic complete 39

where it’s complete and µ(xy) = σ(x) ∧ σ(y) for all xy ∈ E. 40

Definition 1.6. A neutrosophic graph G : (σ, µ) is called a neutrosophic strong 41

where µ(xy) = σ(x) ∧ σ(y) for all xy ∈ E. 42

Definition 1.7. A path v0 , v1 , · · · , vn is called neutrosophic path where 43

µ(vi vi+1 ) > 0, i = 0, 1, · · · , n − 1. i-path is a path with i edges, it’s also called length 44

of path. 45

Definition 1.8. A crisp cycle v0 , v1 , · · · , vn , v0 is called neutrosophic

V cycle where 46

there are two edges xy and uv such that µ(xy) = µ(uv) = i=0,1,··· ,n−1 µ(vi vi+1 ). 47

Definition 1.9. A neutrosophic graph is called neutrosophic t-partite if V is 48

partitioned to t parts, V1 , V2 , · · · , Vt and the edge xy implies x ∈ Vi and y ∈ Vj where 49

i=6 j. If it’s neutrosophic complete, then it’s denoted by Kσ1 ,σ2 ,··· ,σt where σi is σ on Vi 50

instead V which mean x 6∈ Vi induces σi (x) = 0. If t = 2, then it’s called neutrosophic 51

complete bipartite and it’s denoted by Kσ1 ,σ2 especially, if |V1 | = 1, then it’s called 52

neutrosophic star and it’s denoted by S1,σ2 . In this case, the vertex in V1 is called 53

center and if a vertex joins to all vertices of neutrosophic cycle, it’s called 54

neutrosophic wheel and it’s denoted by W1,σ2 . 55

Definition 1.10. Let G : (σ, µ) be a neutrosophic graph. For any given subset N of V, 56

Σn∈N σ(n) is called neutrosophic cardinality of N and it’s denoted by |N |n . 57

Definition 1.11. Let G : (σ, µ) be a neutrosophic graph. Neutrosophic cardinality of 58

V is called neutrosophic order of G and it’s denoted by On (G). 59

2/10
Definition 1.12. Let G : (σ, µ) be a neutrosophic graph. The number of vertices is 60

denoted by n and the number of edges is denoted by m. 61

Definition 1.13. Let N = (σ, µ) be a neutrosophic graph. It’s called neutrosophic 62

connected if for every given couple of vertices, there’s at least one neutrosophic path 63

amid them. 64

Definition 1.14. Let N = (σ, µ) be a neutrosophic graph. Suppose a path 65

P : v0 , v1 , · · · , vn−1 , vn from v0 to vn . mini=0,1,2,··· ,n−1 µ(vi vi+1 ) is called 66

neutrosophic strength of P and it’s denoted by Sn (P ). 67

Definition 1.15. Let N = (σ, µ) be a neutrosophic graph. The number of maximum 68

edges for a vertex, amid all vertices, is denoted by ∆(N ). 69

Figure 1. Neutrosophic Graph, N1

2 Chromatic Number and Neutrosophic Chromatic 70

Number 71

Definition 2.1. Let N = (σ, µ) be a neutrosophic graph. Chromatic number is 72

minimum number of distinct colors which are used to color the vertices which have 73

neutrosophic strong edge. Neutrosophic cardinality of the set of these distinct colors 74

when it’s minimum amid all of these sets, is called neutrosophic chromatic number 75

with respect with first order. 76

Example 2.2. Consider Figure (1). The chromatic number is three and neutrosophic 77

chromatic number is 2.57 with respect to first order. 78

Proposition 2.3. Let N = (σ, µ) be a neutrosophic complete. Then chromatic number 79

is n and neutrosophic chromatic number is neutrosophic order. 80

Proof. All edges are neutrosophic strong. Every vertex has edge with n − 1 vertices. 81

Thus n is chromatic number. Since any given vertex has different color in comparison to 82

another vertex, neutrosophic cardinality of V is neutrosophic chromatic number. 83

Therefore, neutrosophic chromatic number is neutrosophic order. 84

3/10
Proposition 2.4. 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

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

85

Proposition 2.5. 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

86

Proposition 2.6. 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

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

87

Proposition 2.7. 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

88

4/10
Proposition 2.8. 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

89

Proposition 2.9. 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. 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

90

Proposition 2.10. 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

91

Proposition 2.11. 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

5/10
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

92

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

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

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

edge with a vertex. So there’s no neutrosophic strong edge. Since N = (σ, µ) is a 96

neutrosophic strong, N = (σ, µ) is a neutrosophic empty. 97

(⇐). Let N = (σ, µ) be neutrosophic empty and neutrosophic strong. Hence there’s 98

no edge. It implies for every given vertex, there’s no common neutrosophic strong edge. 99

It induces there’s only one color for vertices. Hence the representative of this color is 100

chosen from n vertices. Thus chromatic number is 1. 101

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

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

Proof. (⇒). Let chromatic number be two. So every vertex has either one vertex or two 104

vertices with a common edge. The number of colors are two so there are two sets which 105

each set has the vertices which same color. If two vertices have same color, then they 106

don’t have a common edge. So every set is a part in that, no vertex has common edge. 107

The number of these sets is two. Hence there are two parts in each of them, every 108

vertex has no common edge with other vertices. Since N = (σ, µ) is a neutrosophic 109

strong, N = (σ, µ) is neutrosophic complete bipartite. 110

(⇐). Assume N = (σ, µ) is neutrosophic complete bipartite. Then all edges are 111

neutrosophic strong. Every part has the vertices which have no edge in common. So 112

they’re assigned to have same color. There are two parts. Thus there are two colors to 113

assign to the vertices in that, the vertices with common edge, have different colors. It 114

induces chromatic number is 2. 115

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

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

Proof. (⇒). Let chromatic number be n. So any given vertex has n vertices which have 118

common edge with them and every of them have common edge with each other. It 119

implies every vertex has n vertices which have common edge with them. Since 120

N = (σ, µ) is a neutrosophic strong, N = (σ, µ) is neutrosophic complete. 121

(⇐). Suppose N = (σ, µ) is neutrosophic complete. Every vertex has n vertices 122

which have common edge with them. Since all edges are neutrosophic strong, the 123

minimum number of colors are n. Thus chromatic number is n. 124

General bounds for neutrosophic chromatic number are computed. 125

Proposition 2.15. Let N = (σ, µ) be a neutrosophic graph. Then chromatic number is 126

at most the number of vertices and neutrosophic chromatic number is at most 127

neutrosophic order. 128

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

number of vertices and it happens in chromatic number of neutrosophic complete which 130

is n. When all vertices have distinct colors, neutrosophic chromatic number is 131

neutrosophic order and it’s sharp for neutrosophic complete. 132

6/10
 The relation amid neutrosophic chromatic number and main parameters of 133

neutrosophic graphs is computed. 134

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

is at most ∆ + 1 and at least 2. 136

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

which induces there’s no edge. It implies chromatic number is two. Since chromatic 138

number is one if and only if N = (σ, µ) is neutrosophic empty if and only if N = (σ, µ) 139

is neutrosophic trivial. A vertex with degree ∆, has ∆ vertices which have common 140

edges with them. If these vertices have no edge amid each other, then chromatic number 141

is two especially, neutrosophic star. If not, then in the case, all vertices have edge amid 142

each other, chromatic number is ∆ + 1, especially, neutrosophic complete. 143

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

number is at most r + 1. 145

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

have common edge with it. If these vertices have no common edge with each other, for 147

instance neutrosophic star, chromatic number is two. But since the vertices have 148

common edge with each other, chromatic number is r + 1, for instance, neutrosophic 149

complete. 150

3 Applications in Time Table and Scheduling 151

Designing the programs to achieve some goals is general approach to apply on some 152

issues to function properly. Separation has key role in the context of this style. 153

Separating the duration of work which are consecutive, is the matter and it has 154

important to avoid mixing up. 155

Step 1. (Definition) Time table is an approach to get some attributes to do the 156

work fast and proper. The style of scheduling implies special attention to the 157

tasks which are consecutive. 158

Step 2. (Issue) scheduling of program has faced with difficulties to differ amid 159

consecutive section. Beyond that, sometimes sections are not the same. 160

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

data to assign every section and to assign to relation amid section, three numbers 162

belong unit interval to state indeterminacy, possibilities and determinacy. There’s 163

one restriction in that, the numbers amid two section is at least the number of the 164

relation amid them. Table (1), clarifies about the assigned numbers to these 165

situation.

Table 1. Scheduling concerns its Subjects and its Connections as a Neutrosophic Graph
in a Model.
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
166

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

chromatic number 2 in the case with is titled T 0 . In this case, i1 and c1 are 168

representative of these two colors and neutrosophic chromatic number is 1.4. The 169

7/10
Figure 2. Black vertices are suspicions about choosing them.

set {i1 , c1 } contains representatives of colors which pose chromatic number and 170

neutrosophic chromatic number. Thus the decision amid choosing the subject c1 171

an c2 is concluded to choose c1 . To get brief overview, neutrosophic model uses 172

one number for every array so 0.9 means (0.9, 0.9, 0.9). In Figure (2), the 173

neutrosophic model T introduce the common situation. The representatives of 174

colors are i2 and c1 . Thus chromatic number is two and neutrosophic chromatic 175

number is 1.4. Thus suspicion about choosing i1 and i2 is determined to be i2 . 176

The sets of representative for colors are {i2 , c1 }. 177

4 Open Problems 178

The two notions of coloring of vertices concerning neutrosophic chromatic number and 179

chromatic number are defined on neutrosophic graphs when neutrosophic strong edges 180

have key role to have these notions. Thus 181

Question 4.1. Is it possible to use other types edges to define chromatic number and 182

neutrosophic chromatic number? 183

Question 4.2. Is it possible to use other types of ways to make number to define 184

chromatic number and neutrosophic chromatic number? 185

Question 4.3. Which classes of neutrosophic graphs have the eligibility to pursue 186

independent study in this way? 187

Question 4.4. Which applications do make an independent study to define chromatic 188

number and neutrosophic chromatic number? 189

Problem 4.5. Which approaches do work to construct classes of neutrosophic graphs 190

to continue this study? 191

Problem 4.6. Which approaches do work to construct applications to create 192

independent study? 193

Problem 4.7. Which approaches do work to construct definitions which use all three 194

arrays and the relations amid them instead of one array of three arrays to create 195

independent study? 196

8/10
5 Conclusion and Closing Remarks 197

This study uses mixed combinations of neutrosophic chromatic number and chromatic 198

number to study on neutrosophic graphs. The connections of vertices which are clarified 199

by neutrosophic strong edges, differ them from each other and and put them in different 200

categories to represent one representative for each color. Further studies could be about 201

changes in the settings to compare this notion amid different settings of graph theory. 202

One way is finding some relations amid array of vertices to make sensible defintions. In 203

Table (2), some limitations and advantages of this study is pointed out.

Table 2. A Brief Overview about Advantages and Limitations of this study

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 Resuls

204

References 205

1. M. Akram, and G. Shahzadi, Operations on Single-Valued Neutrosophic Graphs, 206

Journal of uncertain systems 11 (1) (2017) 1-26. 207

2. K. Atanassov, Intuitionistic fuzzy sets, Fuzzy Sets Syst. 20 (1986) 87-96. 208

3. S. Broumi, M. Talea, A. Bakali and F. Smarandache, Single-valued neutrosophic 209

graphs, Journal of New Theory 10 (2016) 86-101. 210

4. N. Shah, and A. Hussain, Neutrosophic soft graphs, Neutrosophic Set and 211

Systems 11 (2016) 31-44. 212

5. Henry Garrett, Big Sets Of Vertices, Preprints 2021, 2021060189 (doi: 213

10.20944/preprints202106.0189.v1). 214

6. Henry Garrett, Locating And Location Number, Preprints 2021, 2021060206 (doi: 215

10.20944/preprints202106.0206.v1). 216

7. Henry Garrett, Metric Dimensions Of Graphs, Preprints 2021, 2021060392 (doi: 217

10.20944/preprints202106.0392.v1). 218

8. Henry Garrett, New Graph Of Graph, Preprints 2021, 2021060323 (doi: 219

10.20944/preprints202106.0323.v1). 220

9. Henry Garrett, Numbers Based On Edges, Preprints 2021, 2021060315 (doi: 221

10.20944/preprints202106.0315.v1). 222

10. Henry Garrett, Matroid And Its Outlines, Preprints 2021, 2021060146 (doi: 223

10.20944/preprints202106.0146.v1). 224

11. Henry Garrett, Matroid And Its Relations, Preprints 2021, 2021060080 (doi: 225

10.20944/preprints202106.0080.v1). 226

9/10
 12. A. Shannon and K.T. Atanassov, A first step to a theory of the intuitionistic 227

fuzzy graphs, Proceeding of FUBEST (Lakov, D., Ed.) Sofia (1994) 59-61. 228

13. F. Smarandache, A Unifying field in logics neutrosophy: Neutrosophic 229

probability, set and logic, Rehoboth: American Research Press (1998). 230

14. H. Wang, F. Smarandache, Y. Zhang, and R. Sunderraman, Single-valued 231

neutrosophic sets, Multispace and Multistructure 4 (2010) 410-413. 232

15. L. A. Zadeh, Fuzzy sets, Information and Control 8 (1965) 338-353. 233

10/10

View publication stats