 CARMA DISCRETE MATHEMATICS INSTRUCTIONAL SEMINAR
 Speaker: Novi Herawati Bong, The University of Newcastle
 Title: Moore Graphs: Degree/Diameter Problem
 Location: Room V101, Mathematics Building (Callaghan Campus) The University of Newcastle
 Time and Date: 3:00 pm, Thu, 30^{th} May 2013
 Abstract:
Degree/diameter problem in graph theory is a theoretical problem which has applications in network design. The problem is to find the maximum possible number of nodes in a network with the limitations on the number of links attached to any node and also the limitation on the largest number of links that should be traversed when a message is sent from one node to another inside the network. An upper bound, known as the Moore bound, is given to this problem. The graphs that obtain the bound are called Moore graphs.
In this talk we give an overview of the existing Moore graphs and we discuss the existence of a Moore graph of degree 57 with diameter 2 which has been an open problem for more than 50 years.
 [Permanent link]
