_:nee727c4a19864fbe89ba2a29dfcd1aafxb0
<http://schema.org/description>
"       1.&#160;&#160; T is a graph with n vertices. T is connected and has exactly n-1 edges, then :  &#160;&#160;&#160;&#160; (A)&#160;&#160;&#160; T is a tree  &#160;&#160;&#160;&#160; (B)&#160;&#160;&#160; T contains ..."
<https://www.imcseian.com/2018/10/ugc-computer-science-and-applications.html>