Colloquium Announcement
Department of Mathematics
West Virginia University
for
Thursday, November 20, 1997, at 3:45pm
in 324 Armstrong Hall
(Tea and cookies begin at 3:00 in coffee room.)
Professor Sheng Bau
Indiana University -- Purdue University at Fort Wayne
Cyclability of Cubic Graphs and the Concept of Primitive Graphs
The talk will be suitable for a general audience.
Students are strongly encouraged to participate.
Abstract
In a communication network, a message is to be circulated among a
given set of nodes. Sometimes a reliable link is specified to be
utilized whereas some other times a given link is to be avoided.
It may happen that some links are unavoidable and some are forbidden.
We have studied this type of problems in the convenient settings
of cycles with prescribed and forbidden sets of elements in cubic
graphs.
We give a review on recent results on cyclability of cubic graphs and
primitive graphs for the cyclability, and propose several open questions.
The information on the future (and past) Colloquia can be also found on web at the
address:
http://www.math.wvu.edu/homepages/kcies/colloquium.html