You are on page 1of 7

Introduction to Graph Theory

Content
1. Definitions
2. Types of Graphs
3. Sub Graphs
4. Connected Graph
5. DFS
6. BFS
7. Trees
8. Rooted Trees
9. Binary Tree
10. Binary Search Tree
11. Travelling Round a Graph
12. Hamiltonian Graphs
13. Special Graphs
Definitions
 What is Graph Theory ?
The study of points and lines is known as graph theory. It is a
branch of mathematics that focuses on the investigation of graphs. The mathematical
truth is shown visually in this picture. The study of how edges (lines) and vertices
(nodes) interact is known as "graph theory.“
Types of Graphs
1. Null Graphs
2. Trivial Graphs
3. Simple Graphs
4. Undirected Graphs
5. Directed Graphs
6. Complete Graphs
7. Connected Graphs
8. Disconnected Graphs
9. Regular Graphs
10. Cyclic Graphs
11. Acyclic Graphs
Sub Graphs

Definition: A Subgraph S of a graph G is a graph whose vertex set V(S) is a subset of the
vertex set V(G), that is V(S)⊆V(G), and whose edge set E(S) is a subset of the edge set
E(G), that is E(S)⊆E(G).
Connected Graphs
 A linked graph is one in which we can go from any one vertex to any other
vertex.
 Every pair of vertices in a linked graph has at least one path connecting
them.
DFS (Depth First Search)

You might also like