高级检索    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
Xiao-Dong Zhang,Algebraic connectivity and doubly stochastic tree matrices,Linear Algebra and its Applications 430 (2009) 1656–1664.  [PDF]   [cited]
Zhang XD, Ding CX,The equality cases for the inequalities of Oppenheim and Schur for positive semi-definite matrices,CZECHOSLOVAK MATHEMATICAL JOURNAL, 2009, 59(01)  [PDF]   [cited]
M.H.Lee,N.L. Manev, Xiao-Dong Zhang,Jacket transform eigenvalue decomposition,APPLIED MATHEMATICS AND COMPUTATION, 2008, 198(02)  [PDF]   [cited]
高振滨 张晓东,关于毛虫树的超边优美标号的一点注记,上海交通大学学报Vol.42 No.3 Mar.2008  [PDF]   [cited]
Zhang XD,The Wiener index of trees with given degree sequences,MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2008, 60(02)  [PDF]   [cited]
Moon Ho Lee, Senior Member, IEEE, and Xiao-Dong Zhang,Fast Block Center Weighted Hadamard Transform,IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS—I: REGULAR PAPERS, VOL. 54, NO. 12, DECEMBER 2007.  [PDF]   [cited]
Lihua Feng, Qiao Li and Xiao-Dong Zhang,SOME SHARP UPPER BOUNDS ON THE SPECTRAL RADIUS OF GRAPHS,TAIWANESE JOURNAL OF MATHEMATICS Vol. 11, No. 4, pp. 989-997, September 2007.  [PDF]   [cited]
Xiao-Dong Zhang,Ordering trees with algebraic connectivity and diameter,Linear Algebra and its Applications 427 (2007) 301–312.  [PDF]   [cited]
Xiao-Dong Zhang,The Laplacian spectral radii of trees with degree sequences,Discrete Mathematics 308 (2008) 3143 – 3150.  [PDF]   [cited]
LIHUA FENG, QIAO LI and XIAO-DONG ZHANG,Minimizing the Laplacian spectral radius of trees with given matching number,Linear and Multilinear Algebra, Vol. 55, No. 2, March 2007, 199–207.  [PDF]   [cited]
共83条, 第3页/共9页 第一页 上一页 下一页 尾页

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

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