|
Combinatorics and Computing Seminars
September 28, 2011 - January 18, 2012 School of Mathematics, IPM
-
Behruz Tayfeh-Rezaie, IPM
Maximum order of graphs with a given rank. September 28, 2011
-
Malihe Chavoshi, University of Tehran
On f-chromatic index of graphs. October 5, 2011
- Farzaneh Ramezani, IPM
Some properties of Toeplitz graphs.
October 12, 2011
- Ivan Gutman, University of Kragujevac, Serbia
Distances in graphs.
October 19, 2011
- Ali Mohammadian, IPM
Erdos-Ko-Rado theorem: permutations and transformations.
October 26, 2011
- Nader Jafari Rad, Shahrood University and IPM
Independent Roman domination.
November 9, 2011
- Raofeh Manaviat, Tarbiat Modares University
On the lucky choice number of graphs.
November 16, 2011
- Saeed Shabani, Institute for Advanced Studies in Basic Sciences (IASBS)
On b-coloring of graphs November 23, 2011
- Narges Ghareghani, IPM
Zero-sum flows in graphs
November 30, 2011
- Sara Saeidi Madani, IPM
Betti numbers of path ideals. December 7, 2011
- Hamidreza Maimani, IPM and Shahid Rajaee Teacher Training University
On the hash family of functions.
December 14, 2011
- Maryam Ghanbari, IPM and K.N. Toosi University of Technology
On a conjecture on edge coloring of graphs
December 21, 2011
- Dariush Kiani, IPM and Amirkabir University of Technology
Commuting graph of group rings.
December 28, 2011
- Berooz Khosravi, IPM and Amirkabir University of Technology
Groups uniquely determined by their orders and degrees of their prime graphs.
January 4, 2012
- Firoozeh Ashraf, Isfahan University of Technology
$C_{k}$-saturated graphs
. January 11, 2012
- Hosein Haji Abolhasan, IPM and Shahid Beheshti University
On biclick covering
. January 18, 2012
Information:
Starting date:
Wednesday, September 28, 2011
Time: 14:00, every Wednesday
Place: School of Mathematics, Niavaran Bldg., Niavaran Square, Tehran, Iran
|
|
| |
|