Anonymous

Register for more FREE stuff!

my subscriptions

Graph Theory

Question 1

[Maximum mark: 10]



Consider the following graphs:


1.



2.



3.



4.



5.



6.



a) For each one, write the graph as \( G(V,E) \), where \( V \) and \( E \) are the number of vertices and edges.


b) Say if each graph is a simple graph or not.


c) Say if each graph is connected, strongly connected, or weakly connected.

Answers and Explanations

Show Answer

Question 2

[Maximum mark: 4]



A group of six people each shake hands with each other. How many handshakes took place?

Answers and Explanations

Question 3

[Maximum mark: 9]



Answer the following questions:


a) Use an adjacency matrix to represent the following graphs.


1.



2.



3.


b) Considering the following adjacency matrices, draw the corresponding graphs.


1. \[\left(\begin{array}{lll}1 & 1 & 0 \\ 1 & 0 & 1 \\ 0 & 1 & 0\end{array}\right)\]

2. (weighted graph) \[\left(\begin{array}{llll}2 & 0 & 1 & 1 \\ 0 & 0 & 5 & 0 \\ 1 & 5 & 0 & 3 \\ 1 & 0 & 3 & 1\end{array}\right)\]

3. \[\left(\begin{array}{lllll}0 & 1 & 0 & 0 & 1 \\ 1 & 0 & 1 & 0 & 0 \\ 0 & 1 & 0 & 0 & 1 \\ 0 & 0 & 0 & 1 & 2 \\ 1 & 0 & 1 & 2 & 0\end{array}\right)\]


Answers and Explanations

Show Answer

Question 4

[Maximum mark: 4]



Consider the following graph. Give the in-degree and out-degree of each vertex.



Answers and Explanations

Show Answer

Question 5

[Maximum mark: 9]



Consider the following graph.



a) Is this graph simple?


b) Give a cycle starting at vertex \( A \).


c) Find an Eulerian trail starting at \( F \).


Answers and Explanations

Show Answer

Question 6

[Maximum mark: 11]



Consider the following graph.



a) Show that the graph is connected.


b) Is it possible to find a Hamiltonian cycle in this graph?


c) Show that this graph does not admit a Eulerian circuit.


d) Turn this graph into an Eulerian graph.


Answers and Explanations

Show Answer