The Graph Coloring Using Bacterial Foraging Optimization (BFO) algorithm efficiently addresses the graph coloring problem by ensuring adjacent nodes are assigned distinct colors. Utilizing BFO, we conducted experiments on graphs ranging from 10 to 100 nodes, demonstrating its effectiveness and scalability. Results show that the algorithm consistently achieved valid colorings with minimal chromatic numbers: 3 colors for 10 and 25 nodes, 6 colors for 50 and 75 nodes, and 7 colors for 100 nodes. Execution times were notably short, with the fastest at 0.004464 seconds for 10 nodes and 0.007576 seconds for 100 nodes. These findings underscore BFO's computational efficiency and suitability for graph coloring tasks across various graph sizes, suggesting its potential for broader applications in optimization and graph theory.