A quesiordering of bipartite graphs, based on the coefficients of their characteristic polynomials, is considered. Three novel statements are deduced which generalize certain previous results [5--7] of one of the present authors.