The signature of line graphs and power trees

It is known that s(G)=0 if G is bipartite, and the signature is closely related to the odd cycles or nonbipartiteness of a graph from the existing results. In this paper we show that the conjecture holds for line graphs and power trees.