Chapter 9

Graphs
 9.1 Graphs
1. Determine whether the graph shown has directed or undirected
edges, whether it has multiple edges, and whether it has one or
more loops.
 9.1 Graphs
1. Determine whether the graph shown has directed or undirected
edges, whether it has multiple edges, and whether it has one or
more loops.
 9.2 Graph Terminology
2. 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.
 9.2 Graph Terminology
3. Find the sum of the degrees of the vertices of each graph in
Exercises 2 and verify that it equals twice the number of edges in
the graph.
 9.2 Graph Terminology
4. Can a simple graph exist with 15 vertices each of degree five?
 9.2 Graph Terminology
5. Determine the number of vertices and edges and find the
in-degree and out-degree of each vertex for the given directed
multigraph.
 9.2 Graph Terminology
6. Draw these graphs.
 9.2 Graph Terminology
7. Determine whether the graph is bipartite.
 9.2 Graph Terminology
8. How many vertices and how many edges do these graphs have?
 9.2 Graph Terminology
9. Find the degree sequence of each of the following graphs.
 9.2 Graph Terminology
10. How many edges does a graph have if its degree sequence
is 4, 3, 3, 2, 2? Draw such a graph.
 9.3 Representing Graphs
11. Use an adjacency list and an adjacency matrix to represent
the given graph
 9.3 Representing Graphs
12. Represent each of these graphs with an adjacency matrix.
 9.3 Representing Graphs
13. Represent the given graph using an adjacency matrix.
 9.3 Representing Graphs
14. Draw a graph with the given adjacency matrix.
 9.3 Representing Graphs
15. Draw a graph with the given adjacency matrix.
 9.3 Representing Graphs
16. Use an incidence matrix to represent the graphs
 9.3 Representing Graphs
17. Determine whether the given pair of graphs is isomorphic.
 9.3 Representing Graphs
17. Determine whether the given pair of graphs is isomorphic.
 9.3 Representing Graphs
17. Determine whether the given pair of graphs is isomorphic.
 9.3 Representing Graphs
18. Are the simple graphs with the following adjacency matrices
isomorphic?
a) 0 0 1 0 1 1 
0 0 1  , 1 0 0 
   
1 1 0  1 0 0 
b) 0 1 0 1 0 1 1 1
1 0 0 1  1 0 0 1
  ,  
0 0 0 1  1 0 0 1
1 1 1 0  1 1 1 0 
  
c) 0 1 1 0  0 1 0 1
1 0 0 1  1 0 0 0
  ,  
1 0 0 1  0 0 0 1
0 1 1 0  1 0 1 0 
  
 9.3 Representing Graphs
19. Determine whether the given pair of directed graphs
are isomorphic.
 9.3 Representing Graphs
19. Determine whether the given pair of directed graphs
are isomorphic.
 9.4 Connectivity
20. Does each of these lists of vertices form a path in the following
graph? Which paths are simple? Which are circuits? What are the
lengths of those that are paths?
a) a, e, b, c, b
b) a, e, a, d, b, c, a
c) e, b, a, d, b, e
d) c, b, d, a, e, c
 9.4 Connectivity
21. Does each of these lists of vertices form a path in the following
graph? Which paths are simple? Which are circuits? What are the
lengths of those that are paths?
a) a, b, e, c, b
b) a, d, a, d, a
c) a, d, b, e, a
d) a, b, e, c, b, d, a
 9.4 Connectivity
22. Which graphs is connected? How many connected components
does each graph have? For each graph find each of its connected
components.
 9.4 Connectivity
23. Determine whether each of these graphs is strongly connected
and if not, whether it is weakly connected.
 9.4 Connectivity
24. Find the strongly connected components of each of these
graphs.
 9.4 Connectivity
25. Find the number of paths of length n between two different
vertices in K 4 if n is:
a) 2. b) 3. c) 4.
 9.4 Connectivity
26. Find the number of paths from a to e in this directed graph
of length:
a) 3. b) 4. c) 5.
 9.4 Connectivity
27. Find all the cut vertices of the given graph.
 9.4 Connectivity
28. Find all the cut edges of the given graph.
 9.5 Euler and Hamilton Path
29. Determine whether the given graph has an Euler circuit. Construct
such a circuit when one exists. If no Euler circuit exists, determine
whether the graph has an Euler path and construct such a path if one
exists.
 9.5 Euler and Hamilton Path
30. Can someone cross all the bridges shown in this map exactly
once and return to the starting point?
 9.5 Euler and Hamilton Path
A directed multigraph:
Euler circuit if and only if the graph is weakly connected and
the in-degree and out-degree of each vertex are equal.

Euler path but not an Euler circuit if and only if the graph is
weakly connected and the in-degree and out-degree of each
vertex are equal for all but two vertices, one that has in-degree
one larger than its outdegree and the other that has out-degree
one larger than its in-degree.

No Euler circuit.
Euler path: a, b, d , b, c, d , c, a, d
 9.5 Euler and Hamilton Path
31. determine whether the directed graph shown has an Euler
circuit. Construct an Euler circuit if one exists. If no Euler circuit
exists, determine whether the directed graph has an Euler path.
Construct an Euler path if one exists.
 9.5 Euler and Hamilton Path
32. For which values of n do these graphs have an Euler circuit?

a) K n

b ) Cn

c) Wn

d ) Qn
 9.5 Euler and Hamilton Path
33. For which values of m and n does the complete bipartite
graph K m ,n have an

a) Euler circuit?

b) Euler path?
 9.5 Euler and Hamilton Path
34. Determine whether the given graph has a Hamilton circuit or
a Hamilton path. If it does, find such a circuit or a path.
 9.5 Euler and Hamilton Path
34. Determine whether the given graph has a Hamilton circuit or
a Hamilton path. If it does, find such a circuit or a path.
 9.6 Shortest Path Problems
35. Find the length of a shortest path between a and z in the
given weighted graph.
 9.6 Shortest Path Problems
35. Find the length of a shortest path between a and z in the
given weighted graph.
 9.6 Shortest Path Problems
36. Find the length of a shortest path in the given weighted
graph.
4 6 11

0 16

3 7 12

a) a and d
b) a and f

c) c and f
d) b and z