Mathematics of Graphs

1. Identify the degree of each vertex of the graph below.

Ans:

A-B-C-F-E Path/A-B-E-F-C- Path

E-H-F Path
E-G-D Path

2. If the graph below is Eulerian, find one Eulerian circuit and if not explain why.
Ans:

A-2 D-2 A-4 D-3 G-4

B-4 E-4 B-4 E-5
C-2 F-4 C-3 F-5

There are all even degree, so therefore the
graph has a Eulerian Circuit.
Vertices C, D, E and F are of odd
even degree so this graph thus not
Eulerian Circuit, because degree of
C, D, E and F are 3 and 5 so, these
Vertices are odd degree.
3. Use the greedy and the edge-picking algorithms to find the Hamiltonian circuit with the least
total weight in the complete graph shown below. Compute the total weight.
Ans:
4. Robert decides to take a walk to run errands. He needs to walk to the drug store, the post
office, and the dry cleaners. The distances between these four locations are as follows: home (H)
to the drug store (D) is 0.6 miles, home to post office (P) is 0.5 miles, home to the dry cleaners
(C) is 0.7 miles, drug store to the post office is 0.2 miles, drug store to the dry cleaners is 0.5
miles, and the dry cleaners to the post office is 0.2 miles. Represent this problem with a graph.
Ans:
5. Identify if the set of graphs below are equivalent.

Ans:
A-E-B-D-C
B-C-D-A
C-B-A-D
D-C-B-A-E
E-A-D

* The letter A and its graph are equivalent.

6. Show that the graph below is planar by illustrating an equivalent planar drawing.

Ans: