Difference between revisions of "(i,j)-step competition graphs"
From REU@MU
Maxblack45 (Talk | contribs) |
Maxblack45 (Talk | contribs) |
||
| Line 27: | Line 27: | ||
</ol> | </ol> | ||
| − | + | <ol style="margin-left: 3.5em;"> | |
| + | A brief overview of our goals for this 10 week process are listed below. For a complete list of our goals, click [http://reu.mscs.mu.edu/images/2/2a/Milestones.pdf here]. | ||
| + | </ol> | ||
Revision as of 22:44, 2 June 2017
Researchers: Max Black and Carissa Babcock
Mentor: Dr. Kim A.S. Factor
Background
Cohen, in 1968, began modeling ecosystems with competition graphs. Consequently, mathematicians began developing the theory of competition graphs. Competition graphs are, essentially, graphs
Objectives
-
During this project, we will examine and explore the following:
- Previous research regarding competition graphs and (1,2)-step competition graphs of food webs
- Competition graphs and (1,2)-step competition graphs of a specific food web
-
Additionally, we will further previous research by doing the following:
- Furthering research on (i,j)-step competition graphs by exploring new theory and computation
- Applying competition graphs and (i,j)-step competition graphs in new areas
-
A brief overview of our goals for this 10 week process are listed below. For a complete list of our goals, click here.
