Connected Domination Critical Graphs

dc.contributor.author	Kaemawichanurat, Pawaton
dc.contributor.supervisor	Prof. Louis Caccetta
dc.date.accessioned	2017-01-30T09:59:28Z
dc.date.available	2017-01-30T09:59:28Z
dc.date.created	2016-03-01T04:02:11Z
dc.date.issued	2015
dc.identifier.uri	http://hdl.handle.net/20.500.11937/1140
dc.description.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.
dc.language	en
dc.publisher	Curtin University
dc.title	Connected Domination Critical Graphs
dc.type	Thesis
dcterms.educationLevel	PhD
curtin.department	Department of Mathematics and Statistics
curtin.accessStatus	Open access