Edge weighting in graph theory assigns a numerical value to each edge in a graph, representing the strength, cost, or capacity of the connection between vertices. This concept is fundamental in optimizing network flows, shortest path calculations, and resource allocation problems.