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 ,
دانلود فایل برای اعضای دانشگاهAccess to full-text not allowed by authors
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
@article{paperid:1098927,
author = {Mosawi, Hanifa and Tavakoli, Mostafa and خاطره قربانی مقدم},
title = {A Hybrid Floyd-Warshall and Graph Coloring Algorithm for Finding the Smallest Number of Colors Needed for a Distance Coloring of Graphs},
journal = {Control and Optimization in Applied Mathematics},
year = {2024},
volume = {9},
number = {1},
month = {May},
issn = {2383-3130},
pages = {185--194},
numpages = {9},
keywords = {p-distance coloring; p-distance chromatic number; Graph adjacency matrix; Hybrid algorithm},
}
%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
%A Mosawi, Hanifa
%A Tavakoli, Mostafa
%A خاطره قربانی مقدم
%J Control and Optimization in Applied Mathematics
%@ 2383-3130
%D 2024
