**Volume 9 (2024)**

**Volume 8 (2023)**

**Volume 7 (2022)**

**Volume 6 (2021)**

**Volume 5 (2020)**

**Volume 4 (2019)**

**Volume 3 (2018)**

**Volume 2 (2017)**

**Volume 1 (2016)**

#### Author = Mostafa Tavakolli

Number of Articles: 3

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

*Volume 9, Issue 1 , May 2024, , Pages 185-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 ...
Read More
##### The Smallest Number of Colors Needed for a Coloring of the Square of the Cartesian Product of Certain Graphs

*Volume 8, Issue 1 , June 2023, , Pages 83-93*

#####
**Abstract **

Given any graph G, its square graph G^2 has the same vertex set as G, with two vertices adjacent in G^2 whenever they are at distance 1 or 2 in G. The Cartesian product of graphs G and H is denoted by G□ H. One of the most studied NP-hard problems is the graph coloring ...
Read More
##### Global Forcing Number for Maximal Matchings under Graph Operations

*Volume 4, Issue 1 , July 2019, , Pages 53-63*