Method for obtaining the trees of a v vertix complete graph from the trees of a v-1 complete graph

Abstract

"A method is described for obtaining the trees of a v vertex complete graph through an iterative process. The iterative process is as follows, first find all the trees of a 3 vertex complete graph, then by an appropriate substitution the trees of a 4 vertex complete graph can be found. Continuing in this manner the trees of a v vertex complete graph can be found from the trees of a v-1 vertex complete graph."--Page 1.