ABSTRACT
Given an arbitrary graph, a new graph can be obtained by deleting a vertex, or adding or deleting an edge. Much work has been done concerning these graph alterations and their effects on the domination number of a graph. A survey of the literature in this area is found in [13], Chapter 5. Here we are concerned with generalizations of the alterations involving edges.
