For one of the upper domination parameters , , or , we investigate graphs for which decreases ( -edge-critical graphs) and graphs for which increases ( -edge-critical graphs) whenever an edge is added. We find characterisations of - and -edge-critical graphs and show that a graph is -edge-critical if and only if it is -edge-critical. We also exhibit a class of -edge-critical graphs.