Peter Donoghue

CS215 - Combinatorics for Computer Science 2

1.

List all simple labelled graphs with four vertices and three edges.
How many non-isomorphic such graphs are there if we disregard the labels?

[10 marks]

Assignment 1

Below is a diagram of all possible variants of simple labelled graphs with 4 vertices, and three
edges. 3 sets of the graphs are non-isomorphic when the labels are disregarded.

The following three diagrams are isomorphic, therefore, the others are non-isomorphic. The reason
these are isomorphic, is that when the labels are disregarded the vertices all have the same
degree.

2.

[10 marks]

Show that there is no Hamiltonian cycle in a bipartite graph having an odd

number of vertices.
The definition of a Hamiltonian Cycle is that a path will be made
which hits each node one time and then makes its way back to
the original node, without passing through any other nodes. An
example diagram of a bipartite graph is shown left.
As you can see, this Hamiltonian Cycle has 9 nodes. If we were
to start a path from the first node on U, then went through each
node, we would end on the bottom node of U. As bipartite
graphs do not allow direct connection between nodes in the
same section, we therefore cannot complete a Hamiltonian
cycle.

3.

[10 marks]

How many tournaments are there with vertex set {1, 2, 3, 4, 5}?
Each node is directly connected to each other, as defined by a
tournament. This means that with the vertex set we have 10
connections, 5 nodes connected either way (This is to connote
each path, meaning for example if ONE beats TWO, or vice versa,
there is an easy to follow path)
1 -> 2

1 -> 3

1 -> 4

1 -> 5

2 -> 3

2 -> 4

2 -> 5

3 -> 4

3 -> 5

4 ->5

Therefore, we can easily calculate the number of calculations using

2^10, which gives the answer of 1024. 2 because there are 2 paths
between each node, and 10 because there are 10 pathways.

4.

[10 marks]

Show that the de Bruijn graph G4,10 is strongly connected and balanced.
(This is part (b) of Problem 2 in Week 3 problem set.)

In the de Bruijn graph, the 4 denotes that the numbers at each of the nodes are four digits long.
The 10 denotes the set of available digits, which we would usually presume to be figures {0,19}.
We need to find a way to show that the graph is strongly connected and balanced, as drawing
10,000 (10^4) vertices is out of the picture. For a graph to be strongly connected, it must be
directly connected to each and every other node on the graph. In theory we should be able to get
from any 4 digit number to any other 4 digit number.

Using Node X [X1, X2, X3, X4] as a base node, and wanting to move towards node Y [Y1, Y2, Y3,
Y4]. To do this we remove the first digit, X1, and add another digit to the end, shifting each number
to the left. This would give us [X2, X3, X4, Y1]. Repeating this process gives us [Y1, Y2, Y3, Y4].
Because of this we know we can reach any other node directly and that each node is balanced to
access every node.