The Existence of Diameter-Edge-Critical Graphs
| dc.contributor.author | Almalki, Norah Saleh A | |
| dc.contributor.supervisor | Prof. Louis Caccetta | en_US |
| dc.date.accessioned | 2017-08-07T07:03:32Z | |
| dc.date.available | 2017-08-07T07:03:32Z | |
| dc.date.issued | 2016 | |
| dc.identifier.uri | http://hdl.handle.net/20.500.11937/55063 | |
| dc.description.abstract |
This thesis investigates diameter-edge-critical graphs. Graphs are considered an excellent modelling tool for complex physical systems and many real world problems can be represented by graphs. An important problem that arises is that of characterizing graphs that satisfy certain properties representing the requirements of the system. The diameter of a graph is an important parameter in network design and analysis, as it provides information on the efficiency and the reliability of the network. This thesis establishes classes of diameter-edge-critical graphs that have applications in networks that arise in our high technology world. | en_US |
| dc.publisher | Curtin University | en_US |
| dc.title | The Existence of Diameter-Edge-Critical Graphs | en_US |
| dc.type | Thesis | en_US |
| dcterms.educationLevel | PhD | en_US |
| curtin.department | Mathematics and Statistics | en_US |
| curtin.accessStatus | Open access | en_US |
| curtin.faculty | Science and Engineering | en_US |