Connected Domination Critical Graphs

Abstract

This thesis investigates the structure of connected domination critical graphs. The characterizations developed provide an important theoretical framework for addressing a number of difficult computational problems in the areas of operations research (for example, facility locations, industrial production systems), security, communication and wireless networks, transportation and logistics networks, land surveying and computational biology. In these application areas, the problems of interest are modelled by networks and graph parameters such as domination numbers reflect the efficiency and performance of the systems.