Some graphs with exactly three non-negative eigenvalues
ZAO Yuying1， WANG Guoping2
1.Xinjiang Institute of Engineering Institute of Mathematical， Urumqi 830029， China；2.Department of Mathematics， Xinjiang Normal University， Urumqi 830017，China
Abstract：Suppose that G is a graph with the vertex set V＝，where aij＝1 if vi and vj are adjacent， and otherwise aij＝0. Since A(G) is symmetric ，we can write its eigenvalues to be λ1(G)≥λ2(G)≥…≥λn(G).In this paper we characterize some graphs with exactly three non-negative eigenvalues.
糟玉英,王国平. 仅有三个非负特征值的图[J]. 华中师范大学学报(自然科学版), 2020, 54(3): 356-360.
ZAO Yuying,WANG Guoping. Some graphs with exactly three non-negative eigenvalues. journal1, 2020, 54(3): 356-360.
2020, Vol. 54 
