Academic Report
Title: Spectral radius and Edge Connectivity
Reporter: Prof. LU Mei (Tsinghua University)
Time: March 22, 2018(Thursday) AM 9:00-10:00
Location: A#1101 room, Innovation Park Building
Contact: Prof. WANG Yi (tel: 84708351-8128)
Abstract: Let G be a simple graph of order n. Let A(G)=(aij) be the adjacency matrix of G, that is, aij equals 1 if vi is adjacent to vj and equals 0, otherwise. The spectral radius μ1(G) of a graph G is the largest eigenvalue of the adjacency matrix A(G). In this talk, we will give some results about the spectral radius μ1(G) involving the edge connectivity of G.
The brief introduction to the reporter: Lu Mei received a doctorate at the institute of Mathematics and Systems Science, Chinese Academy of Sciences inJuly 1993. Now he is a professor, doctoral supervisor in the Department of Mathematical Sciences at the Tsinghua University. He mainly engaged in research on operational research, graph theory and combinatorial optimization, and published more than 60 academic papers on SCI. He is currently the Institute director of Computational Mathematics and operational research at the institute of Mathematical and Systems Science, Tsinghua University, the vice president of graphic theory and Combinatorics of the China Operations Research Society, the secretary general of the Specialized Committee of the China Society of Industry and Applied Mathematics and the director of China Society of combinatorial mathematics and graph theory.
