Brother Just it is the distance between the corresponding vertices of the edges in the line graph. So, the distance between any two edges in a connected graph is the length of the shortest path between them, plus one.
Also, you can express this distance by the number of vertices according to the same definition, but by using the number of vertices will make confusion for the directed graphs.