A fundamental and challenging problem in spectral graph theory is to characterize which graphs are uniquely determined by their spectra. In Wang (2017), the author proved that an n -vertex G its generalized spectrum (DGS) whenever 2 ? ? ? det W odd square-free. Here, walk matrix of , namely, = [ e … 1 ] with all-one vector adjacency . this paper, we focus on a larger family d square-free, where...