Scribd
Upload
16 views

Lesson 13 Graphs

Uploaded by

Feria Nhessica Avril
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
16 views

Lesson 13 Graphs

Uploaded by

Feria Nhessica Avril
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 3

Immaculate Conception - I College of Arts and Technology

DISCRETE STRUCTURE 2 (CS2)

LESSON 13 Week 17

Topic: Graphs

At the end of the lesson, the students are expected to:


 Explain the concept of graphs and directed graphs
 Distinguish bipartite graph
 Determine the degree of a vertex in a line graph
 Find the endpoint pair of an edge in a directed graph

Graphs and Directed Graphs

A graph G consists of

a set V containing all vertices of G,

a set E containing all edges of G,

an edge-endpoint function on G which associates each edge a unique pair of end points on V.

It is denoted by G=(V,E, ), or often simply by G =(V,E). Also for a given graph G, we


use V(G) and E(G) to denote respectively the corresponding vertex set V and edge set E.

Note

A graph is by default an undirected graph which means a typical edge e is represented by


the set {v,w} of its vertices through the edge-endpoint function , i.e. (e) ={v,w}.

A graph is called a directed graph, or digraph, if a typical edge in E is represented by an {\sl


ordered} pair (v,w) of its vertices, i.e. (e)=(v,w). In this course, we shall be mostly concerned with
the undirected graphs.

1
Immaculate Conception - I College of Arts and Technology
DISCRETE STRUCTURE 2 (CS2)

Examples

1. In the graph below (heavy dots denote vertices, lines or arcs denote edges)

the vertex set V={v1, v2, v3, v4,v5}, the edge set E={e1, e2, e3, e4} and the edge-endpoint
function is given by

Note: The e1 type edge is called a loop, and e3, e4, e5 type edges are called multiple
edges or parallel edges.

2. In the directed graph below

the vertex set V={v1, v2, v3}, the edge set E={e1, e2, e3, e4}, and the edge-endpoint function is
given by

2
Immaculate Conception - I College of Arts and Technology
DISCRETE STRUCTURE 2 (CS2)

Basic Types and Features of Graphs

A simple graph is a graph that has neither loops nor parallel edges. In such cases, the
identification of an edge e with its endpoints (e) will not cause confusion. Thus an edge with
endpoints v and w may be denoted by {v, w} in simple graphs.

A complete graph is a simple graph in which each pair of vertices are joined by an edge.

Examples

3. The complete graph with n vertices is denoted by Kn. The first few are

4. A graph is complete bipartite if it is a simple graph, and its vertices can be put into two
groups so that any pair of vertices from different groups are joined by an edge while no pair of
vertices are joined by an edge if they are from a same group. Such a graph is denoted
by Km,n if the two groups contains exactly m and n vertices respectively. For example,

A graph H is a subgraph of graph G iff


(i)
V(H) V(G),
(ii)
E(H) E(G),
(iii)
every edge in H has same endpoints as in G.

You might also like