| Q.12 | If a connected graph G has 11 vertices and 15 edges, then each spanning tree of G must have how many edges? | |
| Ans | 1. 10 | |
| 2. 26 | ||
| 3. 4 | ||
| 4. 14 |
Correct Ans Provided: 1
Date: 29/03/2022 Shift: 9:00 AM – 12:00 PM Q. No: 52
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
