The eigenvector centrality formalizes the informal notions of centrality that nodes connected to more important nodes are themselves more important than nodes connected to lesser nodes. In this report, we show a few properties of the eigen properties of bipartite graphs including some unproven conjectures. We also outline a possible strategy for solving the main conjecture concerning the class of bipartite graphs that are maximally centralized.
