Title: Modeling Hudson River Species and k Class-0 Subgraphs
Dates of Program: May 31 - July 22, 2011
Participants will be introduced to core graph theoretic concepts through study of applications such as those in biodiversity and graph traversal. In the realm of graph traversal we explore necessary and sufficient conditions in graph pebbling for a class-0 graph to be partitioned into k class-0 subgraphs. In biodiversity we determine the trophic status of various species in the Hudson River, identify keystone species, study the graph robustness with species removal, determine the minimum edge clique cover (ECC) number using algorithms, and draw conclusions based on their findings.
Student Researchers Supported by MAA:
MAA Programs & Services