TY - JOUR
ID - 10626
TI - A Hybrid Floyd-Warshall and Graph Coloring Algorithm for Finding the Smallest Number of Colors Needed for a Distance Coloring of Graphs
JO - Control and Optimization in Applied Mathematics
JA - COAM
LA - en
SN - 2383-3130
AU - Mosawi, Hanifa
AU - Tavakolli, Mostafa
AU - Ghorbani-Moghadam, Khatere
AD - Department of Applied Mathematics, Faculty of Mathematical Sciences, Ferdowsi University of Mashhad, P.O. Box 1159, Mashhad 91775, Iran.
AD - Mosaheb Institute of Mathematics, Kharazmi University, Tehran, Iran.
Y1 - 2024
PY - 2024
VL - 9
IS - 1
SP - 185
EP - 194
KW - p-distance coloring
KW - p-distance chromatic number
KW - Graph adjacency matrix
KW - Hybrid algorithm
DO - 10.30473/coam.2023.68880.1244
N2 - 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.
UR - https://mathco.journals.pnu.ac.ir/article_10626.html
L1 - https://mathco.journals.pnu.ac.ir/article_10626_1d3b0b6b1881cfc48c06bf561ecafcc0.pdf
ER -