Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
University of Regina Department of Mathematics and Statistics
 

Summary: COLLOQUIUM
University of Regina
Department of Mathematics and Statistics
Speaker: Bart De Bruyn (Ghent University, Belgium)
Title: Near polygons: a nice class of graphs
Date: Monday, August 23, 2004
Time: 2:00PM
Place: Math & Stats Lounge (CW 307.18)
Abstract
A near polygon is a connected graph of finite diameter satisfying
the property that for every vertex x and every maximal clique M there
exists a unique vertex in M nearest to x (clique = set of mutually
adjacent vertices). An ordinary 2n-gon is an example of a near polygon.
Shult and Yanushka showed that there is a connection between these
graphs and certain line systems in Euclidean spaces. We will explain
this connection. We will define some nice classes of near polygons and
sketch how certain algebraic techniques, like eigenvalue techniques, can
be used to show the nonexistence of certain near polygons. We will also
discuss some recently obtained classification results on the topic.
NOTE: Coffee and goodies will be served at 1:30PM in Math & Stats

  

Source: Argerami, Martin - Department of Mathematics and Statistics, University of Regina

 

Collections: Mathematics