A characterization of generalized cospectrality of rooted graphs with applications in graph reconstruction

Extending a classic result of Johnson and Newman, this paper provides a matrix characterization for two generalized cospectral graphs with a pair of generalized cospectral vertex-deleted subgraphs. As an application, we present a new condition for the reconstructibility of a graph. In particular, we show that a graph with at least three vertices is reconstructible if there exists a vertex-deleted subgraph that is almost controllable and has a nontrivial automorphism.