Control and Optimization in Applied Mathematics, Volume (9), No (1), Year (2024-5) , Pages (185-194)

Title : ( A Hybrid Floyd-Warshall and Graph Coloring Algorithm for Finding the Smallest Number of Colors Needed for a Distance Coloring of Graphs )

Authors: Hanifa Mosawi , Mostafa Tavakoli , Khatere Ghorbani-Moghadam ,
File:

Access to full-text not allowed by authors

Citation: BibTeX | EndNote

Abstract

Graph coloring is a crucial area of research in graph theory, with numerous algorithms proposed for various types of graph coloring, particularly graph p-distance coloring‎. In this study, we employ a recently introduced graph coloring algorithm to develop a hybrid algorithm approximating the chromatic number ‎p-distance, where $p$ represents a positive integer number. We apply our algorithm to molecular graphs as practical applications of our findings.

Keywords

, p-distance coloring‎, ‎p-distance chromatic number‎, ‎Graph adjacency matrix‎, ‎Hybrid algorithm