Scribd Logo
Upload

Welcome to Scribd!

  • Graph Poster

    Uploaded by

    18UCOS150 SS METHUN
    22 views1 page
    A connected graph is one where there is a path between every pair of vertices, while a complete graph is one where each pair of vertices is connected by an edge. The document discusses different types of graphs, specifically connected graphs where all vertices can reach each other through paths, and complete graphs where every vertex shares an edge with every other.

    Original Description:

    Original Title

    graph poster

    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 connected graph is one where there is a path between every pair of vertices, while a complete graph is one where each pair of vertices is connected by an edge. The document discusses different types of graphs, specifically connected graphs where all vertices can reach each other through paths, and complete graphs where every vertex shares an edge with every other.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    22 views1 page

    Graph Poster

    Uploaded by

    18UCOS150 SS METHUN
    A connected graph is one where there is a path between every pair of vertices, while a complete graph is one where each pair of vertices is connected by an edge. The document discusses different types of graphs, specifically connected graphs where all vertices can reach each other through paths, and complete graphs where every vertex shares an edge with every other.

    Copyright:

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

    Graph Theory

    Types of graphs

    CONNECTED GRAPH: COMPLETE GRAPH:

    A graph is connected when A graph in which each pair


    there ia path between every of graph vertices is
    pair of vertices. connected by an edge.

    PRIYADHARSHINI.R
    21MCS044

    You might also like