Connected Domination Critical Graphs
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 prod...
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English |
| Published: |
Curtin University
2015
|
| Online Access: | http://hdl.handle.net/20.500.11937/1140 |
| _version_ | 1848743582944460800 |
|---|---|
| author | Kaemawichanurat, Pawaton |
| author_facet | Kaemawichanurat, Pawaton |
| author_sort | Kaemawichanurat, Pawaton |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-14T05:47:52Z |
| format | Thesis |
| id | curtin-20.500.11937-1140 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-14T05:47:52Z |
| publishDate | 2015 |
| publisher | Curtin University |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-11402017-02-20T06:39:39Z Connected Domination Critical Graphs Kaemawichanurat, Pawaton 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. 2015 Thesis http://hdl.handle.net/20.500.11937/1140 en Curtin University fulltext |
| spellingShingle | Kaemawichanurat, Pawaton Connected Domination Critical Graphs |
| title | Connected Domination Critical Graphs |
| title_full | Connected Domination Critical Graphs |
| title_fullStr | Connected Domination Critical Graphs |
| title_full_unstemmed | Connected Domination Critical Graphs |
| title_short | Connected Domination Critical Graphs |
| title_sort | connected domination critical graphs |
| url | http://hdl.handle.net/20.500.11937/1140 |