Distance between distance spectra of graphs

Let be a connected graph with vertex set and edge set E(G). Let D(G) be the distance matrix of G and be its distance spectrum. The distance between distance spectra of G and is defined byDefine the cospectrality of G byLet . In the paper, we obtain lower bounds on and for . Furthermore, we give an upper bound on .