Negative cycles in a graph refer to cycles whose edges sum to a negative value, causing algorithms like Bellman-Ford to detect the possibility of infinitely reducing the path cost. These cycles are critical in optimization and network flow problems, as they indicate potential for arbitrage or inconsistencies in the system being modeled.