Scribd
Upload
2 views

Lecture 13 Defining Graph

Uploaded by

jesnamq
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
2 views

Lecture 13 Defining Graph

Uploaded by

jesnamq
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 23

 CLO5. Model relationships using graphs.

1
Graphs and Graph Models

2
Simple graph

 This computer network can be modeled using a graph in which the


vertices of the graph represent the data centers and the edges
represent communication links.

A graph in which each edge connects two different vertices and where
no two edges connect the same pair of vertices is called a simple
graph

3
Multigraphs

 A computer network may contain multiple links between data


centers
 Graphs that may have multiple edges connecting the same
vertices are called multigraphs.
 When there are m different edges associated to the same unordered
pair of vertices
 {u, v}, we also say that {u, v} is an edge of multiplicity m. That is,
we can think of this set of edges as m different copies of an edge {u,
v}.

4
loops

 Sometimes a communications link connects a data center with itself,


perhaps a feedback loop for diagnostic purposes. To model this
network we need to include edges that connect a vertex to itself.
Such edges are called loops
 multiple edges connecting the same pair of vertices or a vertex to
itself, are sometimes called pseudographs

5
Directed graph

 in a computer network, some links may operate in only one direction


(such links are called single duplex lines). This may be the case if
there is a large amount of traffic sent to some data centers, with
little or no traffic going in the opposite direction.
 To model such a computer network we use a directed graph. Each
edge of a directed graph is associated to an ordered pair.

When a directed graph has no loops and has no multiple directed edges,
it is called a simple directed graph.

6
directed multigraphs

 In some computer networks, multiple communication links between


two data centers may be present, Directed graphs that may have
multiple directed edges from a vertex to a second (possibly the
same) vertex are used to model such networks.
 We called such graphs directed multigraphs. When there are m
directed edges, each associated to an ordered pair of vertices (u, v),
we say that (u, v) is an edge of multiplicity m.

7
Graph Terminology.

8
Graph Models

 SOCIAL NETWORKS

9
Graph Models

 COMMUNICATIONNETWORKS/ INFORMATION NETWORKS

10
Graph Models

 SOFTWARE DESIGN APPLICATIONS

11
Graph Models

 TRANSPORTATION NETWORKS
 Airline Routes
 Road Networks

12
Graph Models

 BIOLOGICAL NETWORKS

13
Graph Models

 TOURNAMENTS

14
Graph Terminology and Special Types of Graphs

15
Example

 What are the degrees and what are the neighborhoods of the
vertices in the graphs G and H displayed in Figure 1?

16
Example

 What are the degrees and what are the neighborhoods of the
vertices in the graphs G and H displayed in Figure 1?

17
THE HANDSHAKING THEOREM

18
Example

 How many edges are there in a graph with 10 vertices each of


degree six?

 Solution: Because the sum of the degrees of the vertices is 6 ・ 10 =


60, it follows that 2m = 60 where m is the number of edges.
Therefore, m = 30.

19
20
21
22
Reference

 Richard Johnsonbaugh. Discrete Mathematics, Pearson; 8th edition (March 16, 2017).
ISBN-10: 0321964683.

23

You might also like