An algebraic method for finding a dual graph of a given graph

This correspondence presents a theorem that relates the tree matrix of a graph to the existence of a dual graph (planarity). Using this theorem, a purely algebraic procedure is formulated for finding a dual graph of a given graph, and a test for the planarity of a graph can also be developed. The planarity test is of theoretical interest but appears to be more complicated than known methods.