# Edge Colouring of Neutrosophic Graphs and Its Application in Detection of Phishing Website

Authors: Rupkumar Mahapatra; Sovan Samanta; Madhumangal Pal
Journal: Discrete Dynamics in Nature and Society
 (2022)

---

## Abstract

Graph colouring enjoys many practical as well as theoretical uses. Graph colouring is still a very active subject of research. This article introduces a new concept of the chromatic number of the neutrosophic graph (NG). There is a discussion of the difference between the fuzzy colouring of the fuzzy graph (FG) and the NG. Finally, a real-life application for detecting phishing websites has been demonstrated by NG colouring.


---

## Body

## 1. Introduction

The graph is one of the greatest ways to portray relationships between objects. The objects depict the vertices and the relationship between objects are considered as edges. The edges within FGs measure the degree via membership value (MV) within [0,1]. The FGs were presented in 1973 by Kaufmann [1], and it was developed in 1975 by Rosenfeld [2]. Samanta and Pal [3, 4] introduced many types of FGs and provided many applications of FG. Mahapatra et al. [5–9] presented many applications of the FG. Pal et al. Reference [10] have discussed about the modern trends in fuzzy graphs and their application.The concept of a neutrosophic set was generalized as an intuitionistic set by Smarandache [11]. The neutrosophic set is characterized by the fact that true-membership value (TMV), indeterminacy-membership value (IMV), and falsity-membership value (FMV) are automatically independent of each other in a range of −0,1+. Some studies attempted to build a three-way fuzzy concept lattice using the neutrosophic set for the characterization of uncertainty based on its acceptation, rejection, and uncertain components, independently [12]. The fourth dimension data representation is defined as Turiyam set [13, 14]. There are four possible 4−tuples in the Turiyam Set: Truth membership value (T), Indeterminacy membership value (I), Falsity membership value (F), and Liberalization membership value (L). The dimensions of all of these quantities are independent and 0≤T+I+F+L≤4. The idea of NG was introduced in 2016 by Broumi et al. [15] and it is also used in MATLAB code for energy and spectrum analysis [16, 17]. Akram and Shahzadi [18] defined a new definition of NG by the concept of neutrosophic set.Graph colouring is one of the oldest research areas. Many problems like map colouring, traffic light problems etc., can be solved by graph colouring. Casselgren and Petrosyan [19] introduced edge colouring of a graph by the concept of the improper interval in 2021. The complexity of counting problems in edge-colouring in a graph has been solved by Cai and Govorov [20]. Umamaheswari and Mithra [21] has introduced the fractional chromatic number on edge-colouring of graph theory. Samanta et al. [22] introduced fuzzy colouring in FGs. Munoz et al. [23] introduced the colouring of an FG in 2005. Mahapatra et al. [24, 25] introduced the edge colouring of an FG and radio k colouring in FGs. For more details readers can read the articles [26–32].Nowadays, searching for a suitable journal is difficult for a researcher. Many researchers targeted some lesser-known journals and had their papers published in them. So, searching for a suitable, reputed journal for an article is a critical task. Also, some of the journals are fake. They have used the exact name of a reputed journal. Therefore it is difficult to find a suitable journal that is not a forgery. By colouring an NG, we represent a website, which can easily indicate a suitable journal and the chance of a website being phishing.


### 1.1. Significance of the Work

Some of the important significances of this study are listed below:(i)
In this article, we shall introduce a new concept of graph colouring with different merits.(ii)
Sometimes, data is displayed with falsity and indeterminacy. Sometimes, data is not available, or it contradicts the facts. So, data may contain three values: true value, falsity, and indeterminacy. All three values—true value, falsity, and indeterminacy—are considered in NGs. In this article, we represent a website, which can easily indicate a suitable journal and the chance of a website being phishing.(iii)
A small network has been considered here to verify the proposed method.(iv)
Some essential properties of the edge colour have been demonstrated in the NG.


### 1.2. Framework of the Paper

This paper is organized in the following manner:In Section2: Some important definitions of the NG are provided.In Section3: The definition of the strength score of an edge of an NG is provided.In Section4: The procedure of edge-colouring of a NG is provided.In Subsection4.1: An algorithm for edge-colouring of an NG is provided. Also, this definition has been described in detail with examples. Some important theorems about the edge-colouring of NGs are also given.In Section4: An application of the suitable journal and chance of a Phishing Website in a neutrosophic graph with detailed analysis is provided.In Section5: The entire conclusion is given.Authors contributions.The author’s contributions to graph colouring and FG colouring have been shown in Table1.Table 1
Authors contributions.
YearAuthorsContributions1973Meyer [33]Equitable colouring1979Leighton [34]Colouring algorithm for large scheduling problems2004Malafiejski [35]Sum coloring of graphs2006Furmańczyk [36]Equitable colouring of graph products2010Malaguti et al. [37]A survey on vertex colouring problems2013Galinier et al. [38]Recent advances in graph vertex colouring2015Lewis [39]A guide to graph colouring: Algorithms and applications2016Samanta et al. [22]Colouring of FGs2018Zhou et al. [40]Improving probability learning based local search for graph coloring2020Mahapatra et al. [25]Applications of edge colouring of FGs2021Mahapatra et al. [8]Colouring of COVID-19 affected region based on fuzzy directed graphsThis paperMahapatra et al.Neutrosophic edge-colouringList of abbreviations.All the abbreviations are shown in Table2.Table 2
List of abbreviations.
AbbreviationsMeaningFGFuzzy graphNGNeutosophic graphMVMembership valueTMVTrue membership valueIMVIndeterminacy membership valueFMVFalsity membership valueBasic notations.All the basic notations are shown in Table3.Table 3
Some basic notations.
NotationMeaningGCrisp graphξNGVSet of verticesESet of edgesσTx,σIx,σFxThe TMV, IMV and FMV of the vertexx of ξμTx,y,μIx,y,μFx,yThe TMV, IMV and FMV of the edgexy of ξOTa,b,OIa,b,OFa,bThe TMV, IMV and FMV of strength of an edgea,bSu,vStrength score an edgeu,vχChromatic number of the NGχsStrong chromatic number of the NG


## 1.1. Significance of the Work

Some of the important significances of this study are listed below:(i)
In this article, we shall introduce a new concept of graph colouring with different merits.(ii)
Sometimes, data is displayed with falsity and indeterminacy. Sometimes, data is not available, or it contradicts the facts. So, data may contain three values: true value, falsity, and indeterminacy. All three values—true value, falsity, and indeterminacy—are considered in NGs. In this article, we represent a website, which can easily indicate a suitable journal and the chance of a website being phishing.(iii)
A small network has been considered here to verify the proposed method.(iv)
Some essential properties of the edge colour have been demonstrated in the NG.


## 1.2. Framework of the Paper

This paper is organized in the following manner:In Section2: Some important definitions of the NG are provided.In Section3: The definition of the strength score of an edge of an NG is provided.In Section4: The procedure of edge-colouring of a NG is provided.In Subsection4.1: An algorithm for edge-colouring of an NG is provided. Also, this definition has been described in detail with examples. Some important theorems about the edge-colouring of NGs are also given.In Section4: An application of the suitable journal and chance of a Phishing Website in a neutrosophic graph with detailed analysis is provided.In Section5: The entire conclusion is given.Authors contributions.The author’s contributions to graph colouring and FG colouring have been shown in Table1.Table 1
Authors contributions.
YearAuthorsContributions1973Meyer [33]Equitable colouring1979Leighton [34]Colouring algorithm for large scheduling problems2004Malafiejski [35]Sum coloring of graphs2006Furmańczyk [36]Equitable colouring of graph products2010Malaguti et al. [37]A survey on vertex colouring problems2013Galinier et al. [38]Recent advances in graph vertex colouring2015Lewis [39]A guide to graph colouring: Algorithms and applications2016Samanta et al. [22]Colouring of FGs2018Zhou et al. [40]Improving probability learning based local search for graph coloring2020Mahapatra et al. [25]Applications of edge colouring of FGs2021Mahapatra et al. [8]Colouring of COVID-19 affected region based on fuzzy directed graphsThis paperMahapatra et al.Neutrosophic edge-colouringList of abbreviations.All the abbreviations are shown in Table2.Table 2
List of abbreviations.
AbbreviationsMeaningFGFuzzy graphNGNeutosophic graphMVMembership valueTMVTrue membership valueIMVIndeterminacy membership valueFMVFalsity membership valueBasic notations.All the basic notations are shown in Table3.Table 3
Some basic notations.
NotationMeaningGCrisp graphξNGVSet of verticesESet of edgesσTx,σIx,σFxThe TMV, IMV and FMV of the vertexx of ξμTx,y,μIx,y,μFx,yThe TMV, IMV and FMV of the edgexy of ξOTa,b,OIa,b,OFa,bThe TMV, IMV and FMV of strength of an edgea,bSu,vStrength score an edgeu,vχChromatic number of the NGχsStrong chromatic number of the NG


## 2. Preliminaries

Akram and Sitara [41] defined NG as follows.Definition 1.
A NGξ=V,σ,μ is a non-empty set V together with a pair of functions σ=σT,σI,σF:V⟶0,13 and μ=μT,μI,μF:V×V⟶0,13 such that for all a,b∈V(1)μTa,b≤minσTa,σTb,μIa,b≤minσIa,σIb,μFa,b≤minσFa,σFb,where, μTa,b,μIa,b,μFa,b represent the TMV, IMV and FMV of the edge a,b in ξ, respectively. σTa,σIa,σFa represent the TMV, IMV and FMV of the vertex a in ξ, respectively.Strength of an edge was introduced by Akram [42].Definition 2.
ξ=V,σ,μ be a NG then the strength of an edge a,b is denoted by OTa,b,OIa,b,OFa,b and defined as(2)OTa,b=μTa,bminσTa,σTb,OIa,b=μIa,bminσIa,σIb,OFa,b=μFa,bminσFa,σFb,where, μTa,b,μIa,b,μFa,b represent the TMV, IMV and FMV of the edge a,b in ξ, respectively. σTa,σIa,σFa represent the TMV, IMV and FMV of the vertex a in ξ, respectively.Samanta et al. [22] introduced the fuzzy colour as follows.Definition 3.
X=x1,x2,…,xn is a set of basic colours. Then fuzzy set X,f is called the set of fuzzy colours where f:X⟶0,1 and fuzzy colour is denoted by xi,fxi, where xi is the basic colour and fxi is the membership value of the basic colour xi.


## 3. Strength Score of an Edge of NG

There is some limitation in the Definition1. If minσTa,σTb=0 or minσIa,σIb=0 or minσFa,σFb=0 then the strength values can not be calculated. Throughout this study, we assume that if minσTa,σTb=0 then OTa,b=0; if minσIa,σIb=0 then OIa,b=0; if minσFa,σFb=0 then. OFa,b=0First, we introduced the strength score of an edge of an NG. Table4.Table 4
Vertex membership value the NG of Figure1.
σ123456σT0.60.90.20.50.50.8σI0.20.10.10.50.60.5σF0.10.10.50.30.80.3Figure 1
A Neutrosophic graph.Definition 4.
Let,ξ=V,σ,μ be a NG and the strength of an edge a,b is OTa,b,OIa,b,OFa,b then the strength score an edge a,b is denoted by Sa,b and defined by Sa,b=2+OTa,b−OIa,b−OFa,b/3.Let,ξ=V,σ,μ be a NG then an edge a,b is said to Table 5be strong if the strength score is grater than or equal to 0.5 ie, edge a,b is said to strong if Sa,b≥0.5 otherwise Table 6this edge is weak.Table 5
Edge membership value of the NG of Figure1.
μμTμIμFμμTμIμF1,60.50.20.23,40.10.10.41,50.40.10.54,50.50.40.61,20.50.10.14,60.40.40.22,40.50.10.25,60.50.40.52,50.40.050.62,30.20.10.4Table 6
Strength score of all edges of the NG of Figure1.
EdgeOTOIOFStrength score1,60.8331.00.6670.3891,50.80.50.6250.5581,20.8331.01.00.2782,41.01.00.6670.4442,50.80.50.750.5173,40.51.00.6670.2784,51.00.80.750.4834,60.80.80.6670.4445,61.00.80.6250.5252,31.01.00.80.4Example 1.
In Figure1, a NG has been considered. TMV, IMV and FMV of all vertices are considered as in Table 4 and TMV, IMV and FMV of all edges are considered as in Table 5. Now, strength score of all edges of the NG of Figure 1 has been shown in Table 6. Here, the edges 1,5, 2,4, 2,5, 5,6 are strong and other all edges of this NG are weak.Theorem 1.
Let,ξ=V,σ,μ be a NG and Sa,b be the strength score of an edge a,b then 0≤Sa,b≤1.Proof.
ξ=V,σ,μ be a NG and the strength of an edge a,b is OTa,b,OIa,b,OFa,b. So, the value of the strength 0≤OTa,b≤1,0≤OIa,b≤1,0≤OFa,b≤1. Also, the strength score of an sedge a,b is Sa,b=2+OTa,b−OIa,b−OFa,b/3. If the value of strength is 0,1,1 then the value of Sa,b is 0 and the value of Sa,b is 1 when the value of strength is 1,0,0. So, the value of strength score of an edge a,b is 0≤Sa,b≤1.Theorem 2.
Let,ξ=V,σ,μ be a complete NG then the value of strength of an edge a,b is 1,1,1 and the strength score of the edge is Sa,b=1/3.Proof.
ξ=V,σ,μ be a complete NG then the edge membership value of the edge a,b is(3)μTa,b=minσTa,σTb,μIa,b=minσIa,σIb,μFa,b=minσFa,σFb.
Then the strength of the edgea,b is(4)OTa,b=μTa,bminσTa,σTb=1,OIa,b=μIa,bminσIa,σIb=1,OFa,b=μFa,bminσFa,σFb=1.
So, the value of strength of an edgea,b is 1,1,1 and the strength score of the edge a,b is Sa,b=2+1−1−1/3=1/3.Note 1.
Let,ξ=V,σ,μ be a complete NG then all edges are weak. The strength score of all edge are Sa,b=1/3<0.5. So, all edges of the graph ξ are weak.


## 4. Edge Colouring of NG

In neutrosophic edge colouring, if two edges are adjacent, the vertices have fuzzy colours with different basic colours. Otherwise, their fuzzy colours may be the same as the same basic colour. Here, we used fuzzy colours to colour the NG.Letξ=V,σ,μ be neutrosophic connected graph and C=c1,c2,…,ck be a set of basic colours. Suppose, any edge a,b gets a fuzzy colour ci,fci, where ci is the basic colour of the edge a,b and fci is the depth of the basic colour ci. Also, the depth of the colour is equal to the strength score of the edge a,b i.e. fci=Sa,b.


### 4.1. Algorithm to Colour the Edges of an FG

Input: A NGξ=V,σ,μ, V=n.Output: Complete edge coloured NG.Step 1: Calculate the strength score of all edges. Also, vertices are to be labelled as1,2,…,n.Step 2: First of all, the vertex “1” is focused on colouring all its incident edges in such a way that no two incident edges are of the same colours. Here, the depths of the colours are equal to the strength scores of the corresponding edges.Step 3: Proceed to direct neighbours of “1” except the previous one, which is already focused, and label them11,12,…,1m if there are m such neighbours. Start with the vertex 11 and repeat Step 2 and so on for 12,13,…,1m.Step 4: Repeat Step 3 until all edges of the graph have been coloured.


### 4.2. Chromatic Number of NGs

The minimum number of basic colours needed to colour an NG is called a chromatic number of an NG. The chromatic number of an NG is denoted byχ. Suppose minimum n number of basic colours are used to colour an NG, then the chromatic number χ=n.


### 4.3. Strong Chromatic Number of NGs

The strong chromatic number will be an improved concept of the chromatic number. Letξ=V,σ,μ be an NG. Then, the strong chromatic number is the minimum number of basic colours used to colour an NG, whose maximum depth is greater than or equal to 0.5. These colours are called strong colours. The strong chromatic number is denoted by χs.Example 2.
In Figure1, considered a NG. TMV, IMV and FMV of all vertices are considered as in Table 4 and TMV, IMV and FMV of all edges are considered as in Table 5. Now, the strength score of all edges of the NG of Figure 1 has been shown in Table 6. Here, 4 basic colours Red, Green, Blue, Yellow are used to colour this NG of Figure 1. Also, the edge-colouring NG with colour depth has been shown in Figure 2 and the edge-colouring NG has been shown in Figure 3. Here, four basic colours are used, so the chromatic number is χ=4. Also, each basic colour’s maximum depth is greater than 0.5. So, the strong chromatic number of this NG is χs=4.Figure 2
A colouring NG with depth of colour.Figure 3
A colouring NG.Theorem 3.
Let,ξ=V,σ,μ be a complete NG then the chromatic number of ξ is χ=V−1 and strong chromatic number is χs=0.Proof.
ξ=V,σ,μ be a complete NG. So, the degree of all vertices are same and the degree of all vertices a are V−1. Therefore, the minimum number of basic colours needed to coloured this complete NG is V−1. So, χ=V−1. Since, ξ be a complete NG so, all edges are weak and the strength score of all edge are 1/3<0.5. So, the depth all basic colours are 1/3. So, the strong chromatic number is zero i.e. χs=0.Theorem 4.
Let,ξ=V,σ,μ be a line NG and V>2 then the chromatic number is χ=2.Proof.
ξ=V,σ,μ be a line neutrosophic graph. So, the maximum degree of any vertex is 2. Therefore, the minimum number of basic colours needed to coloured this line NG is 2. So, χ=2. Therefore, the chromatic number of a line NG is χ=2.Theorem 5.
Let,ξ=V,σ,μ be a star NG then the chromatic number is χ=V−1.Proof.
ξ=V,σ,μ be a star NG. So, degree of the centre vertex is V−1. Therefore, the minimum number of basic colours needed to coloured this line NG is V−1. So, χ=V−1. Therefore, the chromatic number of a star NG is χ=V−1.


## 4.1. Algorithm to Colour the Edges of an FG

Input: A NGξ=V,σ,μ, V=n.Output: Complete edge coloured NG.Step 1: Calculate the strength score of all edges. Also, vertices are to be labelled as1,2,…,n.Step 2: First of all, the vertex “1” is focused on colouring all its incident edges in such a way that no two incident edges are of the same colours. Here, the depths of the colours are equal to the strength scores of the corresponding edges.Step 3: Proceed to direct neighbours of “1” except the previous one, which is already focused, and label them11,12,…,1m if there are m such neighbours. Start with the vertex 11 and repeat Step 2 and so on for 12,13,…,1m.Step 4: Repeat Step 3 until all edges of the graph have been coloured.


## 4.2. Chromatic Number of NGs

The minimum number of basic colours needed to colour an NG is called a chromatic number of an NG. The chromatic number of an NG is denoted byχ. Suppose minimum n number of basic colours are used to colour an NG, then the chromatic number χ=n.


## 4.3. Strong Chromatic Number of NGs

The strong chromatic number will be an improved concept of the chromatic number. Letξ=V,σ,μ be an NG. Then, the strong chromatic number is the minimum number of basic colours used to colour an NG, whose maximum depth is greater than or equal to 0.5. These colours are called strong colours. The strong chromatic number is denoted by χs.Example 2.
In Figure1, considered a NG. TMV, IMV and FMV of all vertices are considered as in Table 4 and TMV, IMV and FMV of all edges are considered as in Table 5. Now, the strength score of all edges of the NG of Figure 1 has been shown in Table 6. Here, 4 basic colours Red, Green, Blue, Yellow are used to colour this NG of Figure 1. Also, the edge-colouring NG with colour depth has been shown in Figure 2 and the edge-colouring NG has been shown in Figure 3. Here, four basic colours are used, so the chromatic number is χ=4. Also, each basic colour’s maximum depth is greater than 0.5. So, the strong chromatic number of this NG is χs=4.Figure 2
A colouring NG with depth of colour.Figure 3
A colouring NG.Theorem 3.
Let,ξ=V,σ,μ be a complete NG then the chromatic number of ξ is χ=V−1 and strong chromatic number is χs=0.Proof.
ξ=V,σ,μ be a complete NG. So, the degree of all vertices are same and the degree of all vertices a are V−1. Therefore, the minimum number of basic colours needed to coloured this complete NG is V−1. So, χ=V−1. Since, ξ be a complete NG so, all edges are weak and the strength score of all edge are 1/3<0.5. So, the depth all basic colours are 1/3. So, the strong chromatic number is zero i.e. χs=0.Theorem 4.
Let,ξ=V,σ,μ be a line NG and V>2 then the chromatic number is χ=2.Proof.
ξ=V,σ,μ be a line neutrosophic graph. So, the maximum degree of any vertex is 2. Therefore, the minimum number of basic colours needed to coloured this line NG is 2. So, χ=2. Therefore, the chromatic number of a line NG is χ=2.Theorem 5.
Let,ξ=V,σ,μ be a star NG then the chromatic number is χ=V−1.Proof.
ξ=V,σ,μ be a star NG. So, degree of the centre vertex is V−1. Therefore, the minimum number of basic colours needed to coloured this line NG is V−1. So, χ=V−1. Therefore, the chromatic number of a star NG is χ=V−1.


## 5. Application in Detection of Phishing Website

Different types of problems can be solved by graph colouring. One of them is the application to indent the phishing website. Nowadays, searching for a suitable journal is a difficult task for a researcher. Many re-searchers targeted some non-reputed journals and published their papers in these non-reputed journals. So, searching for a suitable, reputed journal for an article is a very important task. Also, some of the journals are fake. They have used the same name as a reputed journal. As a result, finding a suitable journal that is not a forgery is extremely difficult. Through the colouration of an NG, we represent a website, which can easily indicate a suitable journal and the chance of a phishing website.Suppose a neutral website can be designed for searching for a suitable journal for an article. Every journal information has been updated there, and every researcher can register on this website with their own information. Now, every piece of information contains some falsity, and some information is not identified. So, this type of website can be designed by the NG.Let us assume a small website wheren number of researchers are registered for searching a journal, and m number of the journals are registered. The researcher and journal are considered a vertex of a network, and an edge exists if they have precise matching. So, we get a network in Figure 4.Figure 4
A network.Now the membership values of corresponding vertices of the journal website may depend on the following issues.(1)
Date of initiating the journal website(2)
Number of visitors of this website(3)
The link of this website is the same as the indexing providing the link(4)
Subject(5)
Subject classification(6)
Abstracting and indexing(7)
EtcAnd the membership values of vertices to the corresponding researcher depend on the following parameters.(1)
Subject(2)
Subject classification(3)
Require quality of journalQ1,Q2,Q3 etc.(4)
Number of publications(5)
Quality of publication(6)
EtcNow, the TMV, IMV, FMV of every vertex are calculated from the number of true parameters, number of indeterminacy parameters, and number of falsity parameters. The membership value of each edge depends on the matching between several true parameters, the number of indeterminacy parameters, number of falsity parameters.Suppose, in particular, 10 journals and 3 researchers are registered, and this network has been shown in Figure5. When a researcher R1 logs in this website, then the researcher gets a subgraph of Figure 5. In Figure 6, an NG is considered, and this is the subgraph of Figure 5. Also, TMV, IMV and FMV of all vertices are considered as in Table 7 and TMV, IMV and FMV of all edges are considered as in Table 8. Now, the strength score of all edges of the NG of Figure 2 has been shown in Table 9. Here, 4 basic colours Red, Green, Blue, Yellow are used to colour this NG of Figure 2. Also, the edge-colouring NG with colour depth has been shown in Figure 7 and the edge-colouring NG has been shown in Figure 8. Here, 4 basic colours are used, so the chromatic number is χ=4. So, the strong chromatic number of this NG is χs=3.Figure 5
A network of 10 journals and 3 researchers.Figure 6
A NG of researcherR1.Table 7
Vertex membership value the NG of.
σR1J1J2J3J4σT0.90.90.40.90.7σI0.10.10.80.10.5σF0.20.30.80.010.1Table 8
Edge membership value of the NG of Figure6.
μR1,J1R1,J2R1,J3R1,J4μT0.90.40.90.6μI0.050.010.010.01μF0.10.10.10.01Table 9
Strength score of all edges of the NG of Figure6.
EdgeOTOIOFStrength scoreR1,J11.00.50.330.723R1,J21.01.01.00.33R1,J31.00.10.50.8R1,J40.8570.10.50.752Figure 7
Colouring with depth of NG of researcherR1.Figure 8
Colouring of NG of researcherR1.Now, the chromatic number indicates the number of journals matched with this researcher, and the strong chromatic number indicates the number of highly matched journals. Also, the depth of the colour or strength score indicates how much matches between a journal and this researcher. Here, the strength score of the journalJ4 is 0.33, which is very low compared to other journals. So, the website where the journal was published may be phishing.Now, the chromatic number indicates the number of journals is matching this researcher and strong chromatic number indicates number of journals are highly matching with this researcher. Also, the depth of the colour or strength score indicates how much matches between a journal and this researcher. Here, the strength score of the journalJ4 is 0.39, which is very low compared to other journals. So, the journal may be a phishing website of a journal.


## 6. Conclusion

In this study, a concept of edge-colouring has been introduced. A related term, “chromatic number”, is also defined in a different way. A new concept of neutrosophic graph colouring was developed in this study. The addition of a chromatic number of neutrosophic graphs was defined, and some theorems have been demonstrated. To measure the strength of an edge, the strength score has been introduced, and related properties are examined. A small application has been shown to identify phishing websites. Here, we have assumed the impact factor, indexing and citations to check the quality of a journal. But there may exist some journals which are good but not indexed. There are some other parameters to be included. In the near future, more parameters with uncertainty may be included to identify the phishing website using the extended model of neutrosophic fuzzy graphs.



---

*Source: 1149724-2022-07-08.xml*