Enumeration of trees of a graph

The enumeration of the trees having the same number of edges as the rank of the characteristic submatrix Bf12 of a graph by a computer program is described, using the fact that the non-singular submatrices of the characteristic part of the fundamental cutset matrix relative to a tree uniquely correspond to the other trees of a graph.