Unit IV Graph Theory Slides Discrete Mathematics Sumangal
Unit IV Graph Theory Slides Discrete Mathematics Sumangal
Sumangal Bhattacharya
Department of Mathematics
Shiv Nadar University Chennai
[email protected]
+91 7384846857
3 Unit-2: Combinatorics
4 Unit-4: Graphs
1 UNIT-II: COMBINATORICS
Mathematical induction - The Pigeonhole principle - Principal
of Inclusion and Exclusion - Recurrence relations - Solution of
linear recurrence relations - Generating functions.
2 UNIT-IV: GRAPHS
Graph terminology - special types of graphs - Subgraphs -
Operations on graphs - Connectivity - Cut points - Bridges -
Blocks - Eulerian and Hamilton graphs.
Unit-4: Graphs
Definition
• A graph 𝐺 = (𝑉, 𝐸) consists of 𝑉, a non-empty set of
vertices (or nodes), and 𝐸, a set of edges, where each
edge has either one or two vertices associated with it,
called endpoints. An edge is used to connect its
endpoints.
• The pair of nodes that are connected by an edge are
called adjacent nodes.
• A node of a graph that is not adjacent to any other node
is called an isolated node.
• A graph containing only isolated nodes (i.e., no edges) is
called a null graph.
• If 𝑉 is infinite, or 𝐸 is infinite, then 𝐺 is called an infinite
graph. Otherwise, it is a finite graph.
Definition
• If in a graph 𝐺 = (𝑉, 𝐸), each edge 𝑒 ∈ 𝐸 is associated with
an ordered pair of vertices, i.e., 𝑒 = (𝑢, 𝑣), and it represents
a directed line from the initial point 𝑢 to the terminal
point 𝑣, then 𝐺 is called a directed graph or digraph.
Otherwise, it is called an undirected graph.
• An edge of a graph that joins a vertex to itself is called a
loop.
• In a graph, certain pairs of vertices are joined by more
than one edge, such edges are called parallel edges.
Definition
• Adjacent Vertices: Vertices 𝑢 and 𝑣 are said to be
adjacent if there is an edge 𝑒 = (𝑢, 𝑣).
• Incident: Edge 𝑒 is said to be incident on each of its
endpoints 𝑢 and 𝑣.
• Adjacent Edges: Two edges are said to be adjacent if
they are incident on a common vertex.
• Degree of a Vertex: The number of edges incident to
the vertex. A loop at the vertex contributes twice to the
degree. Vertex with degree 0 is isolated vertex, and degree 1 is
called pendant vertex.
• Neighborhood: The neighborhood of a vertex 𝑣 in a graph 𝐺 is
the set of all vertices adjacent to 𝑣, denoted by 𝑁 (𝑣).
• Weighted Graph: a graph where each edge is assigned a
numerical label or weight
10/82 Sumangal Bhattacharya Shiv Nadar University Chennai
Example
Example
Let 𝑣 = {𝑣 1 , 𝑣 2 , 𝑣 3 , 𝑣 4 , 𝑣 5 }, 𝐸 = {𝑒 1 , 𝑒 2 , 𝑒 3 , 𝑒 4 , 𝑒 5 , 𝑒 6 }
Multiple
Graph Type Edge Category Loops
Edges
Simple Graph Undirected No No
Multigraph Undirected Yes No
Pseudograph Undirected Yes Yes
Simple Directed
Directed No No
Graph
Directed Multi-
Directed Yes No
graph
Both Directed
Mixed Graph Yes Yes
and Undirected
Theorem
Let 𝐺 = (𝑉, 𝐸) be an undirected graph with 𝑚 edges. Then
Õ
deg(𝑣) = 2𝑚
𝑣 ∈𝑉
Theorem
Prove that the maximum number of edges in a simple
𝑛(𝑛 − 1)
graph with 𝑛 vertices is 𝑛 𝐶2 =
2
• Regular Graph
• Walk
• Trail
• Circuit
• Path (𝑃𝑛 )
• Cycle (𝐶𝑛 )
• Wheel (𝑊𝑛 )
• Bipartite Graph
(4)
25/82 Sumangal Bhattacharya Shiv Nadar University Chennai
Problems:
0 0
• A graph 𝐻 = (𝑉 , 𝐸 ) is called a sub-graph of 𝐺 = (𝑉, 𝐸), if
0 0
𝑉 ⊆ 𝑉 and 𝐸 ⊆ 𝐸 .
0 0
• A graph 𝐻 = (𝑉 , 𝐸 ) is called a proper sub-graph of
0 0
𝐺 = (𝑉, 𝐸), if 𝑉 ⊂ 𝑉 and 𝐸 ⊂ 𝐸 . [Proper subsets]
0 0
• A graph 𝐻 = (𝑉 , 𝐸 ) is called a spanning sub-graph of
0
𝐺 = (𝑉, 𝐸), if 𝑉 = 𝑉. A spanning subgraph of 𝐺 need not
contain all its edges.
• If we delete a subset 𝑈 of 𝑉 and all the edges incident on
the elements of 𝑈 from a graph 𝐺 = (𝑉, 𝐸), then the
subgraph 𝐺 − 𝑈 is called a vertex deleted subgraph of 𝐺.
• If we delete a subset 𝐹 of 𝐸 from a graph 𝐺 (𝑉, 𝐸), then the
subgraph 𝐺 − 𝐹 is called an edge deleted subgraph of 𝐺.
0 0 0 0
• A subgraph 𝐻 = (𝑉 , 𝐸 ) of 𝐺 = (𝑉, 𝐸), where 𝑉 ⊆ 𝑉 and 𝐸
consists of only those edges that are incident on the
0
elements of 𝑉 , is called an induced subgraph of 𝐺.
29/82
Figure: Caption Shiv Nadar University Chennai
Sumangal Bhattacharya
Properties of Subgraphs
1 Deletion of edges
2 Deletion of vertices
3 Addition of edges
4 Graph complement
5 Union of graphs
6 Intersection of graphs