Summary: The diameter of a graph is an important factor for communication as it determines the maximum communication delay between any pair of processors in a network. N. Graham and F. Harary [“Changing and unchanging the diameter of a hypercube”, Discrete Appl. Math. 37/38, 265–274 (1992; Zbl 0756.94021)] studied how the diameter of hypercubes can be affected by increasing and decreasing edges. They concerned whether the diameter is changed or remains unchanged when the edges are increased or decreased. In this paper, we modify three measures proposed in [loc. cit.] to include the extent of the change of the diameter. Let \(D^{-k}(G)\) is the least number of edges whose addition to \(G\) decreases the diameter by (at least) \(k, D^{+0}(G)\) is the maximum number of edges whose deletion from \(G\) does not change the diameter, and \(D^{+k}(G)\) is the least number of edges whose deletion from \(G\) increases the diameter by (at least) \(k\). In this paper, we find the values of \(D^{-k}(C_m), D^{-1}(T_{m,n}), D^{-2}(T_{m,n}), D^{+1}(T_{m,n})\), and a lower bound for \(D^{+0}(T_{m,n})\) where \(C_m\) be a cycle with \(m\) vertices, \(T_{m,n}\) be a torus of size \(m\) by \(n\).