Question

PROve on dispio ve dge To helougs graph 6 exit and 6n Conneeted lhe there partial tru hat e aloo blongo Sidenole Paetial graph 6 Auch graph that coutauns vutics of 6, bt ouly Aubset of lges of 6. poutiol tce ef 6 of all Partial Gnaph that a tree n

Answer 1

Aus If edge e belongs to graph a which is connected then there exist pantial tree that e also belongs to -7 edge e belongs to A. - 7 two ventex say &, & in a such that e joins & & V2. Now we take all venter of C. and construct a tree. 1st take the edge e which joins & & &z, and then take. to make tree. other edge. C is connected Sin so we can construct a tree such a way. . So I a partial tree that e belongs Cotton edge. Since u da to. . Proved eg we e es l et get we the take tree ſer es es e iz which contain eg