The localization game played on graph Graph searching investigates combinatorial models for the detection or neutralization of an adversary’s activity on a network. One such model is the localization game, where pursuers use distance probes to capture an invisible evader.

Permutations of finite subsets of R^2 generated by Euclidean distances Given a finite set of points S = {P1, P2, . . . , Pn} and a vantage point V, generate an ordering of the points of S by measuring

The Atlantic Graph Theory Seminar series will take place every Wednesday from 3:30-4:30 ADT online via zoom. The talks, provided by researchers, postdocs and graduate students, will be on a variety of current topics in graph theory. If you would