A negative weight cycle in a graph is a cycle whose edges sum up to a negative value, allowing for the possibility of reducing the total path cost indefinitely by traversing the cycle repeatedly. This phenomenon is crucial in shortest path algorithms as it can lead to incorrect results, and algorithms like Bellman-Ford are specifically designed to detect such cycles.