Competition Graphs
| Metadata Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Rodger, Chris | |
| dc.contributor.advisor | Hoffman, Dean | |
| dc.contributor.advisor | Lindner, Charles | |
| dc.contributor.author | Swan, Brandon | |
| dc.date.accessioned | 2012-04-18T14:46:01Z | |
| dc.date.available | 2012-04-18T14:46:01Z | |
| dc.date.issued | 2012-04-18 | |
| dc.identifier.uri | http://hdl.handle.net/10415/3034 | |
| dc.description.abstract | Competition graphs were originally created in 1968 by Biologist Joel Cohen. In this paper we discuss four things. First, the use of linear algebra is considered with connection to competition graphs. Second, we generalize the idea of the competition graph into the m-step competition graph, and characterize P_{n} as an m-step competition graph. Third, we begin to characterize disjoint unions of graphs as m-step competition graphs. And last, we explore what happens if we treat m-step competition graphs as an infinite sequence, called a competition sequence. | en_US |
| dc.rights | EMBARGO_NOT_AUBURN | en_US |
| dc.subject | Mathematics and Statistics | en_US |
| dc.title | Competition Graphs | en_US |
| dc.type | thesis | en_US |
| dc.embargo.length | NO_RESTRICTION | en_US |
| dc.embargo.status | NOT_EMBARGOED | en_US |