Bondage, Insensitivity, and Reinforcement
Document Type
Book Contribution
Publication Date
1-1-2017
Description
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.
Citation Information
Dunbar, Jean E.; Teschner, Ulrich; Haynes, Teresa W.; and Volkmann, Lutz. 2017. Bondage, Insensitivity, and Reinforcement. Domination in Graphs: Advanced Topics. 471-489. https://doi.org/10.1201/9781315141428 ISBN: 0824700341,9781351454643,9780824700348