Let's suppose I have a solution given by Dijkstra's algorithm (the shortest path from one vertex to all of the other ones). Is there any result or algorithm available regarding how to update the distances if an edge is either added or removed?
You are basically looking for finding a new solution (i.e., updating distances after removing/adding edges) taking the previous computations into account, so you won't run Dijkstra from scratch every time the graph changes.
This is known as incremental Dijkstra; There is an incremental version of A* algorithm https://www.cs.cmu.edu/~maxim/files/aij04.pdf ; you can set the heuristic to 0 which would turn it into incremental Dijkstra http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.45.1855&rep=rep1&type=pdf