New algorithm for calculating chromatic index of graphs and its applications - Egyptian Knowledge Bank

383133

New algorithm for calculating chromatic index of graphs and its applications

Article

Last updated: 29 Dec 2024

Subjects

Abstract

The problem of edge coloring is one of the fundamental problems in the graph
theory. Graph coloring problem arises in several ways like to allocate scheduling and
assignments. To follow this line of investigation, we design a new algorithm called
“RF algorithm" to color the edges of a graph. In addition, we reinstate some classical
results by applying the RF algorithm.

DOI

10.1186/s42787-019-0018-9

Keywords

Graph, Edge coloring, Chromatic index, Incidence matrix

Authors

View Authors

First Name

Last Name

Salama

MiddleName

Affiliation

Department of Mathematics, Faculty of Science, Tanta University, Tanta, Egypt, Department of Mathematics, Faculty of Science, Taibah University, Madinah, Kingdom of Saudi Arabia

Email

City

Orcid

Volume

Article Issue

Related Issue

50652

Issue Date

2019-12-01

Receive Date

2024-10-01

Publish Date

2019-12-01

Page Start

Page End

Print ISSN

1110-256X

Online ISSN

2090-9128

Article File

JOEMS_Volume 27_Issue 1_Pages 1-8.pdf

PDF . 860.2kB

Link

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

Detail API

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

Order

Publication Type

Journal

Publication Title

Journal of the Egyptian Mathematical Society

Publication Link

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

MainTitle