Show simple item record

dc.contributor.authorKaemawichanurat, Pawaton
dc.contributor.supervisorProf. Louis Caccetta
dc.date.accessioned2017-01-30T09:59:28Z
dc.date.available2017-01-30T09:59:28Z
dc.date.created2016-03-01T04:02:11Z
dc.date.issued2015
dc.date.submitted2016-03-01
dc.identifier.urihttp://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.languageen
dc.publisherCurtin University
dc.titleConnected Domination Critical Graphs
dc.typeThesis
dcterms.educationLevelPhD
curtin.digitool.pid238612
curtin.departmentDepartment of Mathematics and Statistics
curtin.accessStatusOpen access


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record