The Shields-Harary Number of Graphs
| Metadata Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Johnson, Peter | |
| dc.contributor.advisor | Phelps, Kevin | en_US |
| dc.contributor.advisor | Hoffman, Dean | en_US |
| dc.contributor.advisor | Jenda, Overtoun | en_US |
| dc.contributor.author | Holliday, John | en_US |
| dc.date.accessioned | 2008-09-09T22:15:48Z | |
| dc.date.available | 2008-09-09T22:15:48Z | |
| dc.date.issued | 2004-05-15 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10415/978 | |
| dc.description.abstract | The Shields-Harary numbers are a class of graph paramaters that measure the robustness of a graph in terms of network vulnerability, with reference to a given cost function. | en_US |
| dc.language.iso | en_US | en_US |
| dc.subject | Discrete & Statistical Sciences | en_US |
| dc.title | The Shields-Harary Number of Graphs | en_US |
| dc.type | Dissertation | en_US |
| dc.embargo.length | NO_RESTRICTION | en_US |
| dc.embargo.status | NOT_EMBARGOED | en_US |