Negative cost cycles in graph theory refer to cycles in a weighted graph where the sum of the edge weights is negative, allowing for potentially infinite reductions in path cost when traversed repeatedly. These cycles are crucial in optimization problems and algorithms, such as the Bellman-Ford algorithm, which can detect their presence to ensure accurate shortest path calculations.