From this orthogonal matrix, we derive two further matrices. The spectrum of each of these
three matrices is considered as a graph invariant. For the first two cases, we compute the
spectrum explicitly and show that it is determined by the spectrum of the adjacency matrix of
the original graph. We then show by computation that the isomorphism classes of many
known families of strongly regular graphs (up to 64 vertices) are characterized by the …