摘要
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.
基金
This work is supported by the National Natural Science Foundation of China(12061074).
