School of Physical Sciences
       ALGEBRA AND COMBINATORICS SEMINAR

    Tuesday 26 February 2008, 3pm in Room 67-641


    Skolem, Communications Networks and Graphs

               Cathy Baker

      Mount Allison University, Canada

Abstract
How can a communications network be tested for node, link and  
distance reliability? In 1991, Mendelsohn and Shalaby suggested  
using Skolem-labeling of the related graph to set up a protocol. 
We examine the Skolem-labeling problem for some families of graphs. 
This approachable, but intriguing, problem has provided a number  
of student research projects.


All welcome.