On formal products and angle matrices of a graph (Q5957703)

This paper contains plenty of results regarding the characteristic polynomial of regular graphs with one added vertex. Let \(S\subseteq V(G)\) and let \(G_S\) be the graph obtained from the graph \(G\) by adding a new vertex \(x\) (\(x\notin V(G)\)), which is adjacent exactly to the vertices from \(S\). The main result is that the polynomial reconstruction conjecture is true for all graphs \(G_S\) for which \(G\) is regular. One of the other interesting results is that if \(G\) is a regular graph with \(S\subseteq V(G)\) and \(|S|=\frac 12|V(G)|\) then the graphs \(G_S\) and \(G_T\), where \(T=V(G)\setminus S\), are cospectral. In the second part of the paper, the author considers the Seidel characteristic polynomials and shows that any two switching equivalent graphs have the same collections of Seidel characteristic polynomials of vertex deleted subgraphs.