info@avatto.com
+91-9920808017
11. A tree with 'n' nodes has
n/2 edges
n edges
n - 1 edges
n + 1 edges
Your email address will not be published. Required fields are marked *
Report
Name
Email
Website
Save my name, email, and website in this browser for the next time I comment.
Comment
12. The number of circuits in a tree with 'n' nodes is
Zero
One
n - 1
n/2
13. A graph is a tree if and only if it
is completely connected
is minimally connected
contains a circuit
is planar
14. A graph with 'n' vertices and n-1 edges that is not a tree is
connected
disconnected
eular
a circuit
15. A complete graph with "n" vertices is
2-chromatic
n/2-chromatic
(n - l)-chromatic
n-chromatic
Login with Facebook
Login with Google
Forgot your password?
Lost your password? Please enter your email address. You will receive mail with link to set new password.
Back to login
