Recolouring Graphs: Decompositions, A Dichotomy Theorem and Frozen   Colourings Speaker: Kathie Cameron, Wilfrid Laurier University A k-colouring of a graph G is an assignment of at most k colours to the vertices of a graph so that the ends of each edge of the graph

The Martin Invariant and Other Results on the Interlace Polynomials Josephine Reynes, University of Waterloo There are many well studied graph polynomials, but this talk will focus on the Martin polynomial and the interlace polynomial. Specifically, this talk will look

Speaker #1: Peter Collier, Dalhousie University Title #1: Zero Forcing on Twisted Hypercubes Abstract #1: The hypercube stands out as a compelling and versatile structure that extends the geometric notion of a cube into higher dimensions. We study the twisted hypercube

On the two table case of the directed Oberwolfach problem Speaker: Alice Lacaze-Masmonteil, University of Regina A directed variant of the famous Oberwolfach problem, the directed Oberwolfach problem considers the following scenario. Given n people seated at t round tables

Speaker: Iain Beaton, Acadia University Title: Reconfiguring minimal dominating sets under a generalization of token sliding Abstract: A dominating set S in a graph is a subset of vertices such that every vertex is either in S or adjacent to

Speakers: Prangya Parida, U. Ottawa, and Kiara McDonald, U. Victoria Zoom link:  https://us02web.zoom.us/j/86415230827?pwd=QUxLUnlMdWYzL05zSUJ4bnBCOUJnZz09 --------------------------------------------------- Prangya Parida: Title: Cover-free families on graphs Abstract: A family of subsets of a t-set is called a d-cover-free family if no subset is contained in the union of

Ramsey numbers of signed graphs Ben Seamone, Dawson College and Université de Montréal Abstract: Nathan Acheampong (Université de Montréal) Francis Clavette (Université de Montréal) Geˇna Hahn (Université de Montréal) Margaux Marseloo (Université Paris-Saclay) Viktor Paardekooper (Université de Montréal), and Ben Seamone* (Dawson College &

Switching m-edge coloured graphs Speaker: Gary MacGillivray, University of Victoria Abstract: An m-edge-coloured graph consists of a set of vertices, any two of which are either joined by an edge of one of m colours or not joined at all.

Kemeny's constant for Markov chains and random walks on graphs Speaker: Jane Breen, Ontario Tech University Kemeny's constant is an interesting and useful quantifier of how well-connected the states of a Markov chain are. Though it was first introduced in

Time: 3:30 pm, Atlantic time, (4:00 pm NST) Wednesday, Feb. 12 Speaker: Robert Bailey, Memorial University Title: Computer constructions of distance-regular graphs with primitive automorphism groups Abstract: A graph is distance-regular if, for each vertex $v$ and each vertex $w$