Chapter 9: Graphs

9.1 Graphs and Graph Models

1. Determine whether the graph shown has directed or undirected edges,
whether it has multiple edges, and whether it has one or more loops
a) Simple graph
Undirected edges, no parallel edges or loops

b) Multigraph
Undirected edges, no loops but a parallel edges

c) Pseudograph
Undirected edges, with loops and parallel edges

d) Multigraph
Undirected edges, no loops but a parallel edges

e) directed graph
Directed edges, no parallel edges but loops

f) directed multigraph
Directed edges, parallel edges and loops

Construct a precedence graph for the following program:

S1: x := 0
S2: x := x + 1
S3: y := 2
S4: z := y
S5: x := x + 2
S6: y := x + z
S7: z := 4

9.2 Graph Terminology and Special Types of Graphs

1. find the number of vertices, the number of edges, and the degree of
each vertex in the given undirected graph. Identify all isolated and
pendant vertices.
a) Graph 1
 number of vertices: 6
 the number of edges: 6
Vertex a b c d e f
Degree 2 4 1 0 2 3
isolated no no no yes no no
pendant no no yes no no no

b) graph 2
 number of vertices: 5
 the number of edges: 13
Vertex a b c d e
Degree 6 6 6 5 3
isolated no no no no no
pendant no no no no no
c) graph 3
 number of vertices: 9
 the number of edges: 12
Vertex a b c d e f g h i
Degree 3 2 4 0 6 0 4 2 3
isolated no no no yes no yes no no no
pendant no no no no no no no no no

2. Find the sum of the degrees of the vertices of each graph in Exercises
1 and verify that it equals twice the number of edges in the graph
Graph 1: sum of degrees
sum degrees = 12, 12/2 = 6 = edges
Graph 2: sum of degrees
sum degrees = 26, 26/2 = 13 = edges
Graph 3: sum of degrees
sum degrees = 3 + 2 + 4 + 0 + 6 + 4 + 2 + 3 = 24, 24/2 = 12 = edges
3. Can a simple graph exist with 15 vertices each of degree five?
In Graph Theory, Handshaking Theorem states in any given graph, Sum of degree
of all the vertices is twice the number of edges contained in it.
The sum of the degrees of the vertices 5⋅15=755⋅15=75  is odd. 
Therefore by Handshaking Theorem a simple graph with 15 vertices each of
degree five cannot exist.

4. determine the number of vertices and edges and find the in-degree and
out-degree of each vertex for the given directed multigraph