Scribd
Upload
273 views1 page

Types of Graphs in Graph Theory

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.

Uploaded by

18UCOS150 SS METHUN
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
273 views1 page

Types of Graphs in Graph Theory

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.

Uploaded by

18UCOS150 SS METHUN
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

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