A necessary and sufficient eigenvector condition for a connected graph to be bipartite

Abstract

We give a necessary and sufficient condition for a graph to be bipartite in terms of an eigenvector corresponding to the largest eigenvalue of the adjacency matrix of the graph.