Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
