Math, asked by saimatabasum99, 10 months ago

A connected graph is a tree if and only if adding an edge between any two vertices in G creates exactly one cycle​

Answers

Answered by girideepmala007
0

Answer:

bzfnxvmxvmgdmxvmdg

Step-by-step explanation:

b zv.cb. b.bxv

bcznzcnbx

cb

bx.bx.Xnzgmkhxncz ,c czbzcnjgsm

Similar questions