I am quite sure I have seen somewhere the connection between the characteristic polynomial of a (finite undirected) graph and its dual. I am not able to find it currently. Could you please refer me to the result?

(eigenvalues would be enough)

By dual, I mean the graph where edges become vertices and adjacent if they intersect in a vertex. By characteristic polynomial I mean that of the adjacency matrix.