On Connected Graphs with Distance Eigenvalue-1 of Multiplicity at Least n-4  

作　　者：Yuhong Yang 

机构地区：[1]Institute of Signal Processing and Machine Learning,College of Science,Tianjin University of Technology,Tianjin 300384,China [2]College of Mathematics and System Science,Xinjiang University,Urumqi 830046,China

出　　处：《Algebra Colloquium》2023年第4期639-648,共10页代数集刊（英文版）

基　　金：This work is supported by the National Natural Science Foundation of China(12061074).

摘　　要：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.

关 键 词：distance hereditary graph distance spectrum canonical graph primitive graph 

分 类 号：O157.5[理学—数学]