Orthogonal Colourings of Graphs Two colourings of a graph are orthogonal if they have the property that when two vertices receive the same colour in one colouring, then those vertices receive distinct colours in the other colouring. In this talk,

Gracefully labelling windmills using Skolem-like sequences To gracefully label a graph G, assign each vertex v ∊ V(G) a distinct label l(v) from {0,1,2,...,|E(G)|}, such that {|l(u)-l(v)| : uv ∊ E(G)}={1,2,3,...,|E(G)|}. In this talk we will examine constructive techniques using

The Cheating Robot and Insider Information Throughout this talk, we explore a deterministic model as an alternative approach to studying simultaneous play combinatorial games. We call this the Cheating Robot model. This model forces both players to move at the

The Iterated Local Model for Social Networks Complex networks are said to exhibit four key properties: large scale, evolving over time, small world properties, and power law degree distribution. The Preferential Attachment Model (Barab´asi–Albert, 1999) and the ACL Preferential Attachment

The γ-graph of a graph For a graph G = (V, E), the γ-graph of G, G(γ) = (V (γ), E(γ)), is the reconfiguration graph whose vertex set is the collection of minimum dominating sets, or γ-sets of G, and

Dynamical algebraic combinatorics and independence sets of graphs Dynamical algebraic combinatorics is a relatively new (and fun!) topic, which looks at cyclic group actions on objects from algebraic combinatorics, inspired by some questions coming from dynamical systems. I will give

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

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