Scribd
Upload
36 views

Discrete Mathematics Lecture Note (Chapter 4)

Uploaded by

Gemechis Gurmesa
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
36 views

Discrete Mathematics Lecture Note (Chapter 4)

Uploaded by

Gemechis Gurmesa
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 60

Ambo university woliso campus

April, 2020

Chapter 4
Graph Theory
4.1 Definition and Representations of Graph
4.2 Types of Graph
4.3 Isomorphic graphs
4.4 Path and Connectivity of Graph
4.5 Eulerian and Hamiltonian Graph
4.6 Trees and Forests
4.7 Planar Graph
4.8 Graph coloring and Chromatic polynomials
4.1 Definition and Representations of
graph
1. Definition: A Graph G = (V, E, ) is an order triple consists of a non-empty
set of vertices, set of edges together with an incidence function which
associates each elements of E with a pair of vertices in V of G.
Note:
• {u, v} and {v, u} is the same in undirected graph but if both appears on E
they each represent an edge.
The number of vertices of G is the called Order(cardinality) of G denoted by
|V|=|G|
The number of edges of G is the called Size of G denoted by |E| = ||G||
• Let G be a graph for any edge e = {u, v} then
• u and v are the end point of e
• e is a loop if u = v
• e is a link if u ‡ v
• u and v are adjacent vertices (neighbor)
• e is Incident with u and v and vice versa
Definition: Two or more edges are said to be parallel or Multiple
edges if they are incident with the same pair of vertices.
Example: Let G = (V, E,𝜑G) where V = {a, b, c, d, e, f }
E = {e1, e2, e3,e4,e5}
𝜑G (e1) = {a, b}; 𝜑G (e2) = {b, a}; 𝜑G (e3) = {c, d};
𝜑G (e4) = {c, c}; 𝜑G (e5) = {e, d}; 𝜑G (e6) = {b, c}, then find
1 Find the size and order of G
2 The multiple edge are ......... and ..........
3 .......... is a loop
4 The links are ..............................
5 In e3 = {c; d}, then c and d are ........................vertices
6 In e3 = {c; d}, e3 is .................. with c and d
Definition: The degree(valancy) of a vertex v 𝜀 VG is the
number of edges incident with it plus twice the
Number of loops at v if any denoted by (dG (v), degG (v))
Note:
• if d(v) = 0, then v is isolated vertex
• if d(v) = 1, then v is Pendant vertex
• if d(v) = 2k(even number), then v is even vertex
• if d(v) = 2k ± 1(odd number), then v is odd vertex
• δ(G) : Smallest degree of a vertex in G.
• Δ(G) : Largest degree of a vertex in G.
• Example: Find the even and odd vertices and δ(G) and
Δ(G)
The handshaking lemma: let G = (V, E) be any graph,
then , the sum of deg(v) = 2|E|= 2||G||
3.Degree sequence Representations of a graph: for
a graph of order n, the degree sequence of G is
d(v1), d(v2), d(v3),…., d(vn).
Example: Find the degree sequence and
the number of edges of G?
Note: if summation of degree of vertices is odd
there is no graph representation (so always it
should be even)
• Corollary :The number of odd vertices in any
graph is even
Example: represent the graph below
with incidence matrix
4.2 Types of graph
Directed graph: Is an order triple D = (V, E, 𝜑G ) which
contains a non-empty set of vertex set of edge and
an incidence function which associate each directed
edge with ordered pair of vertices.
Undirected graph: Is an order triple G = (V, E, 𝜑G )
which contains a non-empty set of vertex set of edge
and an incidence function which associate each
undirected edge with unordered pair of vertices.
Undirected graph is divided in to three
i.e pseudo,multiple and simple;
Example of Directed Graph
4.3 Isomorphic Graphs
4.4 Path and connectivity of Graph
4.5 Euler and Hamilton Graph
4.6 Trees and Forests
4.7 Planar Graph
4.8 Graph coloring and chromatic
polynomial

You might also like