New Bounds on Eigen Values of Normalized Signed Graph

In relation to vertex i of a signed graph T, let d be the degree of any vertex, 􀣋􀫚 be the least eigen value of Normalized Laplacian matrix of signed graph p1 and Ti+ 􀬾 indicates the number of positive (balanced) triangles passing through i respectively. We prove that if 􀪡 be a complete signed graph then P1 greater than or equal to min(4Ti+/d(2)-1)