MODULE 7 – OUTLINE

Title: Mathematics Graph Theory

Week: 10 & 11

Graph is a data structure that is defined by two components :

1. A Node or a Vertex.
2. An edge E or ordered pair is a connection between two nodes u, v that is defined
by unique pair (u,v).

Graph and its representation:

1. A finite set of vertices also called as nodes.
2. A finite set of ordered pair of the form (u, v) called edge. The edges may contain
weight/value/cost.
 Undirected Graph with 5 Vertices

2 most commonly used representations of Graph.

1. Adjacency Matrix - sometimes also called the connection matrix, of a simple

labeled graph is a matrix with rows and columns labeled by graph vertices, with a
1 or 0 in position according to whether and. are adjacent or not. 
2. Adjacency List - is a collection of unordered lists used to represent a finite
graph.

Adjacency List
Applications:
Graph is a data structure which is used extensively in our real-life.
1. Social Network - is a graph where the nodes represent people and the lines
between nodes, called edges, represent social connections between them, such as
friendship or working together on a project. These graphs can be either undirected
or directed. 
2. Google Maps – Various locations are represented as vertices or nodes and the
roads are represented as edges and graph theory is used to find shortest path
between two nodes.

2 Characteristics of Graphs
1. Adjacent Node - two node or vertices are adjacent if they are connected to each
other through an edge.
2. Degree of a Node – in undirected graph the number of nodes incident on a node
is the degree of the node.

3. Path - represents a sequence of edges between the two vertices. In the following
example, ABCD represents a path from A to D.

4. Isolated Node - a node that does not have an ancestor node.

Types of Graphs

1. Directed Graph - as the name suggests, consists of edges that possess a direction
that goes either away from a vertex or towards the vertex. 
2. Undirected Graph - Undirected graphs have edges that are not directed at all.

Complete Graph

Handshaking theorem states that the sum of degrees of the vertices of a graph is

twice the number of edges. 
Some Special Simple Graphs:
1. Complete Graph
2. Cycles
3. Wheels
4. Hypercube
5. Bipartite Graphs

Isomorphic Graphs - Two graphs which contain the same number of graph vertices

connected in the same way are said to be isomorphic. 

Isomorphic Graph

Planar Graph
 POLYHEDRON
A polyhedron is a three-dimensional solid bounded by a finite number of polygons
called faces. Points where three or more faces meet are called vertices. Line
segments where exactly two faces meet at an angle are called edges. The vertices
and edges of the polyhedron make a graph called the graph of the polyhedron.
 EULER PATH AND CIRCUIT

Hamilton Path – In the mathematical field of graph theory, a Hamiltonian

path (or traceable path) is a path in an undirected or directed graph that visits
each vertex exactly once.