It was shown that whether a graph G is determined by its generalized characteristic polynomial is equivalent to the same problem for a well defined bi-regular graph (G) over cap. Also a unified approach is proposed to show that some new families of hi-regular graphs are characterized by their generalized characteristic polynomials. (C) 2012 Elsevier Inc. All rights reserved.