首页|On Connected Graphs with Distance Eigenvalue-1 of Multiplicity at Least n-4
On Connected Graphs with Distance Eigenvalue-1 of Multiplicity at Least n-4
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
万方数据
Let(G)n([-1]i)denote the set of all connected graphs on n vertices having distance eigenvalue-1 of multiplicity i.By using the distribution of the third largest distance eigenvalue and the second least distance eigenvalue of a connected graph,in this paper we completely characterize the graphs in(G)n([-1]i),where i=n-1,n-2,n-3 or n-4.
万方数据
