## “Bulletin Board”

School of Mathematics - December 21, 2004

### Mathematical Lecture

#### On the Graph Isomorphism ProblemIlia PonomarenkoSteklov Institute of Mathematics, RussiaDec. 28, 200414:00-16:00School of Mathematics, IPM

On the Graph Isomorphism Problem

Ilia Ponomarenko
Steklov Institute of Mathematics, Russia

Abstract

The Graph Isomorphism Problem is to recognize in an efficient way whether two given finite graphs are isomorphic, i.e., whether there is a bijection of their vertex sets preserving the adjacency of vertices.We survey some connections of the Graph Isomorphism Problem with the isomorphism problems for other combinatorial structures as well as with some problems of permutation group theory. Then we outline the current status of the Graph Isomorphism Problem. Finally, we describe recent results concerning the isomorphism problem for circulant graphs.

Information:
 Date: Tuesday, Dec. 28, 2004, 14:00-16:00 Place: Lecture Hall, Niavaran Bldg., Niavaran Sqr., Tehran, Iran

back to top
scroll left or right