高级检索    BBS留言 | 登陆 | 注册 |

------分类导航------

个人信息:
Personal Information

----------------------
研究兴趣:
Research Areas

----------------------
项目与论文:
Selected Publications

----------------------
其它:
Others

Office: Room 2605,
Department of Mathematics,
Shanghai Jiao Tong University
Mail: xiaodong@sjtu.edu.cn
Mailing-Address: No.800,
Dong Chuan Road, Shanghai, P.C: 200240
Telephone: 54743148-2605
The Laplacian spectrum of graphs, Symposium Graph Theory and Computational Biology, CAS-MPG Partner Institute for Computational Biology, Shanghai, March 6—10, 2006.
The Laplacian Spectra of Graphs, Department of Mathematical Sciences, Middle Tennessee State University, Murfreesboro, USA, Jan, 18, 2006.
The Laplacian Spectra of Graphs, Department of Mathematics, Center Florida University, FL. USA, Jan. 9, 2006.
Eigenvalues and eigenvectors of non-regular graphs, International Conference on Graph Theory and Combinatorics in JinHua, Jun 26—30, 2005.
Laplacian eigenvlaues of graphs, First National Congress on Combinatorics and graphs, Aug. 6—10, 2004.
Inverse M-matrices and ultrametric matrices, Sixth International Conference on matrices and their applications, July 18—24, 2004.
Graphs with small third Laplacian eigenvalue, The 10th Anniversary (1994-2004) Conference for the Institute of Mathematics, ECNU International Conference on Complex Geometry and Related Theories, East China Normal University June 21 – 25, 2004.
The spectrum of mixed graphs, East China Normal University, June 2003. Maximum cut of cubic graphs, International Congress of Mathematics, Beijing, China, Aug. 20-Aug. 28, 2002.
A class of inverse M- matrices, Matrix theory and its applications- A satellite conference of ICM 2002, Shanghai University, P. R. China. Aug. 14-Aug 18, 2002.
A note on edge coloring of embedded graphs, Fourth Shanghai Conference on Combinatorics, Shanghai, P.R. China, May 24-28, 2002.
共11条, 第1页/共2页 第一页 下一页 尾页

------最新论文------

Complete multipartite graphs are determined by their distancespectra...........
The inertia of weighted unicyclic graphs...........
A NEW ENTANGLEMENT MEASURE_D-CONCURRENCE...........
The signless Laplacian coefficients and incidence energy of bicyclic graphs.......3/3
Sharp bounds for the signless Laplacian spectral radius in terms of clique number.......3/1

上海交通大学数学系
Copyright (C) 2004-2020, All Rights Reserved