Scribd Logo
Upload

Welcome to Scribd!

  • Mids 2022

    Uploaded by

    Anmol Murti
    5 views3 pages
    A tree is a connected graph with n vertices and n-1 edges, meaning it is connected and has the minimum possible number of edges to connect all vertices without forming any closed loops.

    Original Description:

    Original Title

    MIDS 2022

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    A tree is a connected graph with n vertices and n-1 edges, meaning it is connected and has the minimum possible number of edges to connect all vertices without forming any closed loops.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    5 views3 pages

    Mids 2022

    Uploaded by

    Anmol Murti
    A tree is a connected graph with n vertices and n-1 edges, meaning it is connected and has the minimum possible number of edges to connect all vertices without forming any closed loops.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 3

    A connected graph on n 1 vertices and n 1 edges is a tree.

    zero

    You might also like