Pi Mu Epsilon - Mathematical Association of America
Pi Mu Epsilon - Mathematical Association of America
Pi Mu Epsilon - Mathematical Association of America
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Thursday MAA Session #3 August 2, 2012<br />
9:30–9:45<br />
Deterministic Walks on Graphs with Choice<br />
Peter Barr<br />
Wake Forest University<br />
In this talk we consider deterministic movement on graphs, integrating local information, memory<br />
and choice at nodes. The research is motivated by recent work on deterministic random walks and<br />
applications in multiagent systems. Several results regarding passing messages through grids are<br />
discussed, as well as some open questions.<br />
9:50–10:05<br />
Compatible Matchings in Bipartite Graphs<br />
Allison Zale<br />
Illinois State University<br />
Consider a graph G whose edges are colored with t colors, where the coloring is not necessarily<br />
proper. A subset <strong>of</strong> vertices S in G is called feasible if for each color c, the vertices in S are saturated<br />
by a matching with edges <strong>of</strong> color c. The problem <strong>of</strong> devising an efficient algorithm to find<br />
the largest feasible subset S is an open question for t ≥ 2. In our research we developed a greedy<br />
algorithm for finding a feasible subset S when G is a bipartite graph and the number <strong>of</strong> colors is<br />
t = 2.<br />
10:10–10:25<br />
Pebbling a New Type <strong>of</strong> Graph<br />
Brandon Mosley<br />
Westminster College<br />
In this talk we will explore various pebblings <strong>of</strong> a new type <strong>of</strong> graph. We will conjecture and prove<br />
a formula for the pebbling number <strong>of</strong> the graph, and the generalize to other related graphs.<br />
18
Change language