📢 Too many exams? Don’t know which one suits you best? Book Your Free Expert 👉 call Now!


    Question

    The minimum number of edges in a connected graph with n

    vertices is:
    A n² Correct Answer Incorrect Answer
    B n–1 Correct Answer Incorrect Answer
    C n+1 Correct Answer Incorrect Answer
    D log n Correct Answer Incorrect Answer
    E n/2 Correct Answer Incorrect Answer

    Solution

    A connected acyclic graph (tree) has n–1 edges — the minimal connected structure.

    Practice Next
    ask-question