On the minimal graphs of a certain class of graphs

Graphs consisting of a pair of distinct trees are considered. The minimal graphs in the class of such graphs are defined, and a few theorems concerning the minimal subgraphs contained in the original graphs are derived. The structure of the graphs in connection with the minimal graphs is considered.