Edge relaxation is a fundamental operation in graph algorithms, particularly in shortest path algorithms, where it is used to iteratively improve the estimated shortest path from a source vertex to other vertices. By adjusting the path cost based on edge weights, edge relaxation helps in converging towards the optimal solution efficiently.