• Ebrahim Ghorbani, IPM & Sharif University of Technology
  The necessary conditions for $t$-designs are sufficient for something--A new proof.

Jan. 30, 2008
• Behruz Tayfeh-Rezaie, IPM
  Cospectral graphs.

Feb. 6, 2008
• Farzad Ramezani, University of Tehran
  Suffix trees.

Feb. 13, 2008
• Hadi Kharaghani, University of Lethbridge, Canada
  Some strongly regular graphs with maximum energy.
(SLIDES)
Feb. 20, 2008
• Maryam Ghanbari , Sharif University of Technology
  Dynamic coloring of graphs.
(SLIDES)
Feb. 27, 2008
• Sogol Jahanbekam, Sharif University of Technology
  On signed edge domination of graphs.
(SLIDES)
March 5, 2008
• Maryam Mirzakhah, Amirkabir University of Technology
  Generalized $n$-gon.
(SLIDES)
April 9, 2008
• Peter Rowlinson, University of Stirling, Stirling, Scotland
  Uses of the adjacency matrix

April 16, 2008
• Manouchehr Zaker ,IASBS, Zanjan
  The chromatic number of sparse graphs
(SLIDES)
April 23, 2008
• Nader Seddigh, University of Tehran
  Expanders and zig-zag graphs.

April 30, 2008
• Akram Mahmoodi, Tarbiat Modarres University
  Eigenvalue multiplicities of trees.
(SLIDES)
May 7, 2008
• Mehdi Sadeghi, National Institute for Genetic Engineering and Bio-Technology & IPM
  What is bioinformatics?.
(SLIDES)
May 14, 2008
• Ebadollah S. Mahmoodian, IPM & Sharif University of Technology
  On some useful special classes of graphs.

May 21, 2008
• Mohsen Najafian, IPM & Sharif University of Technology
  On combinatorial trades.
(SLIDES)
May 28, 2008
• Ali Mohammadian, IPM & Amirkabir University of Technology
  Some open problems in combinatorics.

June 11, 2008
• Hamidreza Maimani, IPM & Shahid Rajaee Teacher Training University and IPM
  Sum number in graphs.

June 18, 2008

Starting date: Wednesday, January 30, 2008
Time: 14:00, every Wednesday
Place: School of Mathematics, Niavaran Bldg., Niavaran Square, Tehran, Iran