Edge weight in graph theory represents the cost, distance, or capacity associated with traversing an edge between two vertices. It is crucial for algorithms that seek to find the shortest path, minimum spanning tree, or optimal network flow in weighted graphs.