
Combinatorics and Computing Seminars
February 17  June 16, 2010 School of Mathematics, IPM


Javad Ebrahimi, EPFL, Switzerland
Algebraic Framework for Network Coding. February 17, 2010
 Behruz TayfehRezaie, IPM
Graphs with few Eigenvalues. February 24, 2010

Amir Jafari, Sharif Univetrsity of Technology & IPM
ConnesKriemer Combinatorial Hopf Algebra of Trees. March 3, 2010
 Fatemeh Mohammadi, Ferdowsi University of Mashhad
An Algebraic Criterion for the Choosability of Graphs.
April 7, 2010
 Changiz Maysoori, IPM
On the Halving Problem.
April 14, 2010
 Farzaneh Ramezani, IPM and Amirkabir University of Technology
Spectral Characterization of Some Graphs Related to Johnson Scheme.
April 21, 2010
 Alireza Abdollahi, Isfahan University
Integral Cayley Graphs.
April 28, 2010
 Hossein Hajiabolhassan
, IPM and Shahid Beheshti University
On Nesteril?s Pentagon Problem May 5, 2010
 Gholamreza Omidi
, Isfahan University of Technology and IPM
On Group Choosability of Graphs
May 12, 2010
 Hamidreza Maimani, IPM and Shahid Rajaei Training University
Unit Graph of a Commutative Ring. May 19, 2010
 Arash Ahadi, Sharif University of Technology
Applications of Probabilistic Method in Graph Coloring
.
May 26, 2010
 Ali Mohammadian, IPM
Nonregular Graphs with Four Distinct Laplacian Eigenvalues. June 2, 2010
 Sahar Ghajar, Sharif University of Technology
On the Roman Edge Domination of Graphs.
June 9, 2010
 Narges Ghareghani, IPM
Increasing Arboressences. June 16, 2010
Information:
Starting date:
Wednesday, February 17, 2010
Time: 14:00, every Wednesday
Place: School of Mathematics, Niavaran Bldg., Niavaran Square, Tehran, Iran

 
