高级检索    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
Jin YL, Zhang XD,Complete multipartite graphs are determined by their distancespectra,LINEAR ALGEBRA AND ITS APPLICATIONS, 2014, 448  [PDF]   [cited]
Yu GH, Zhang XD, Feng LH,The inertia of weighted unicyclic graphs,LINEAR ALGEBRA AND ITS APPLICATIONS, 2014, 448  [PDF]   [cited]
Ma ZH, Yuan WG, Bao ML, Zhang XD,A NEW ENTANGLEMENT MEASURE_D-CONCURRENCE,QUANTUM INFORMATION & COMPUTATION, 2011, 11(1-2)  [PDF]   [cited]
Zhang J, Zhang XD,The signless Laplacian coefficients and incidence energy of bicyclic graphs,LINEAR ALGEBRA AND ITS APPLICATIONS, 2013, 439(12)  [PDF]   [cited]
He B, Jin YL, Zhang XD,Sharp bounds for the signless Laplacian spectral radius in terms of clique number,LINEAR ALGEBRA AND ITS APPLICATIONS, 2013, 438(10)  [PDF]   [cited]
Zhang JM, Zhang XD, et al,The Number of Subtrees of Trees with Given Degree Sequence,JOURNAL OF GRAPH THEORY, 2013, 73(03)  [PDF]   [cited]
Jin YL, Zhang XD,On the Two Conjectures of the Wiener Index,MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2013, 70(02)  [PDF]   [cited]
Jin YL, Zhang XD,On Wiener and Terminal Wiener Indices of Trees,MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2013, 70(02)  [PDF]   [cited]
Gu L, Huang HL, Zhang XD,The clustering coefficient and the diameter of small-worldnetworks,ACTA MATHEMATICA SINICA-ENGLISH SERIES, 2013, 29(01)  [PDF]   [cited]
Wagner S, Wang H, Zhang XD,Distance-based graph invariants of trees and the Harary index,FILOMAT, 2013, 27(01)  [PDF]   [cited]
共83条, 第1页/共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