报告题目：Merris’ Problems andDoubly Stochastic GraphMatrices

报告人：Xiao-Dong Zhang 上海交通大学

报告时间：5月9日 周一 10:00-11:00

报告地点：1518

摘要：

Let G be a simple graph andL(G) = D(G)−A(G)be its Laplacian matrix, where A(G) and D(G) are the adjacency matrix anddegree diagonal matrix.Then Ω(G) = (L(G)+I n ) −1 is called the doubly stochastic matrixof G. Merris in 1998 proposed two conjectures and two problems of the doubly stochasticmatrix, which are revealed some relations among, algebraic connectivity, theentry of Ω(G)and graph structure. In this talk, we survey some progress and results on theseconjectures and problems of Merris. In addition, some new problems are included