A graph is called a chain graph if it does not contain induced 2K2,C3 or C5.In spectral graph theory,chain graphs feature as graphs whose largest eigenvalue within the connected bipartite graphs of fixed order and size is maximal.In this paper,we consider the distance eigenvalues of a connected chain graph G.We present that-2 is an eigenvalue of G=G(t1,…,th;s1,…,sh),with multiplicity n-2h.And further more,there are exactly h-1 eigenvalues less than-2 and exactly h+1 eigenvalues greater than-2.
万方数据
维普
