%0 Journal Article
%T A Hybrid Floyd-Warshall and Graph Coloring Algorithm for Finding the Smallest Number of Colors Needed for a Distance Coloring of Graphs
%J Control and Optimization in Applied Mathematics
%I Payame Noor University (PNU)
%Z 2383-3130
%A Mosawi, Hanifa
%A Tavakolli, Mostafa
%A Ghorbani-Moghadam, Khatere
%D 2024
%\ 05/01/2024
%V 9
%N 1
%P 185-194
%! A Hybrid Floyd-Warshall and Graph Coloring Algorithm for Finding the Smallest Number of Colors Needed for a Distance Coloring of Graphs
%K p-distance coloring
%K p-distance chromatic number
%K Graph adjacency matrix
%K Hybrid algorithm
%R 10.30473/coam.2023.68880.1244
%X 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.
%U https://mathco.journals.pnu.ac.ir/article_10626_1d3b0b6b1881cfc48c06bf561ecafcc0.pdf