Title of article
A Hybrid Floyd-Warshall and Graph Coloring Algorithm for Finding the Smallest Number of Colors Needed for a Distance Coloring of Graphs
Author/Authors
Mosawi ، Hanifa Department of Applied Mathematics - Faculty of Mathematical Sciences - Ferdowsi University of Mashhad , Tavakolli ، Mostafa Department of Applied Mathematics - Faculty of Mathematical Sciences - Ferdowsi University of Mashhad , Ghorbani-Moghadam ، Khatere Mosaheb Institute of Mathematics - Kharazmi University
From page
185
To page
194
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
Journal title
Control and Optimization in Applied Mathematics
Journal title
Control and Optimization in Applied Mathematics
Record number
2769802
Link To Document