Beta
ManageSearchChatDiscover
23156

New Algorithm for Chromatic Number of Graphs and their Applications

Article

Last updated: 03 Jan 2025

OverviewSimilar Items

Subjects

-

Tags

-

Abstract

In this paper, we have designed a new algorithm for calculating the exact value of the chromatic
number of a graph and dubbed it as R- coloring algorithm. Using this R- coloring algorithm, we have proved
some results. We have discussed some application in different fields of our life by using this new algorithm.

DOI

10.21608/joems.2018.3353.1076

Keywords

Graph, Vertex-coloring, Chromatic Number, Adjacency Matrix

Authors

First Name

H.

Last Name

Rafat

MiddleName

-

Affiliation

Mathematics Department, Faculty of Science, Tanta University, Tanta, Egypt

Email

-

City

-

Orcid

-

Volume

26

Article Issue

3

Related Issue

4318

Issue Date

2018-07-01

Receive Date

2018-03-18

Publish Date

2018-07-01

Page Start

458

Page End

468

Print ISSN

1110-256X

Online ISSN

2090-9128

Article File

JOEMS_Volume 26_Issue 3_Pages 458-468.pdf

PDF . 483.7kB

Link

https://joems.journals.ekb.eg/article_23156.html

Detail API

https://joems.journals.ekb.eg/service?article_code=23156

Order

9

Type

Original Article

Type Code

485

Publication Type

Journal

Publication Title

Journal of the Egyptian Mathematical Society

Publication Link

https://joems.journals.ekb.eg/

MainTitle

New Algorithm for Chromatic Number of Graphs and their Applications

Details

Type

Article

Created At

22 Jan 2023