Show simple item record

dc.contributor.advisorRodger, Chris
dc.contributor.advisorHoffman, Dean
dc.contributor.advisorLindner, Charles
dc.contributor.authorSwan, Brandon
dc.date.accessioned2012-04-18T14:46:01Z
dc.date.available2012-04-18T14:46:01Z
dc.date.issued2012-04-18
dc.identifier.urihttp://hdl.handle.net/10415/3034
dc.description.abstractCompetition 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.rightsEMBARGO_NOT_AUBURNen_US
dc.subjectMathematics and Statisticsen_US
dc.titleCompetition Graphsen_US
dc.typethesisen_US
dc.embargo.lengthNO_RESTRICTIONen_US
dc.embargo.statusNOT_EMBARGOEDen_US


Files in this item

Show simple item record