On the reconstruction of the characteristic polynomial of a graph Original Research Article

We consider the problem of reconstructing the characteristic polynomial of a graph G from the collection P(G) of characteristic polynomials of vertex deleted subgraphs of G. We study properties and invariants of G that can be derived from P(G). Under the assumption that the reconstruction of the characteristic polynomial is not unique, we describe some properties of graphs in question.