“Bulletin Board”

 School of Mathematics - March 26, 2006

Short Course

Reconstruction Problems
Elena Konstantinova
Sobolev Institute of Mathematics
Russia

April 12-19, 2006
School of Mathematics, IPM

 
 

Reconstruction Problems
Elena Konstantinova
Sobolev Institute of Mathematics
Russia


  • Talk 1: Graph Reconstruction Problem
    Wednesday 12 April, 14:00-15:30

    Abstract:
    Ulam's vertex reconstruction conjecture; Harary's edge reconstruction conjecture states; the unique reconstruction of trees (Smolenski-Zaretski theorem); the existence of a graph with a given degree sequence (Erdos-Gallai theorem); the reconstruction of a graph from local vertex information (a chemical application, main results, a reconstruction algorithm, open problems);


  • Talk 2: Vertex Reconstruction Problem (part 1)
    Thursday 13 April, 10:00-11:30

    Abstract:
    A reconstruction of an unknown vertex of a given graph from minimum number of vertices of its metric ball of a given radius; results for Hamming and Jonhson graphs (application in coding theory); some bounds for regular graphs; results for transposition Cayley graphs of symmetric group Sn of permutation and hyperoctahedral group $B_n=\mathbb{Z}_2 \wr S_n$ of signed permutation (application in computer science);
  • Talk 3: Vertex Reconstruction Problem (part 2)
    Wednesday 19 April, 14:00-15:45

    Abstract:
    Results for reversal Cayley graphs of symmetric group Sn of permutation and hyperoctahedral group $B_n=\mathbb{Z}_2 \wr S_n$ of signed permutation (application in molecular biology, structural properties of Cayley graphs, main results, algorithm, open problems);


Information:
Place: School of Mathematics, Niavaran Bldg., Niavaran Square, Tehran, Iran.

 
 
back to top
scroll left or right