Scribd
Upload
3 views8 pages

Memo Graph Theory (1)

Uploaded by

briancbonga
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views8 pages

Memo Graph Theory (1)

Uploaded by

briancbonga
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

Tutorial Problems: Elementary Graph Theory

1. Draw a graph 𝐺 with vertex set {𝑣1 , 𝑣2 , 𝑣3 , 𝑣4 , 𝑣5 } and edge set


{𝑒1 , 𝑒2 , 𝑒3 , 𝑒4 }, with edge-endpoint function as follows:

Edge Endpoints
𝑒1 {𝑣1 , 𝑣2 }
𝑒2 {𝑣1 , 𝑣2 }
𝑒3 {𝑣2 , 𝑣3 }
𝑒4 {𝑣2 }

ANSWER: The graph is shown below

2. A graph has vertices of degrees 0, 2, 2, 3, and 9. How many


edges does the graph have?
ANSWER: There are two ways we can answer this question. We
can either use the handshaking theorem which states that
the total degree of any graph is twice the number of its
edges. And we know that the total degree of the graph in
question is given by 0 + 2 + 2 + 3 + 9 = 16

Hence,
16 = 2 × 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑒𝑑𝑔𝑒𝑠
Therefore,
16
𝑁𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑒𝑑𝑔𝑒𝑠 = =8
2

Another way we can solve the problem is to draw the graph


in question and then count the number of edges. The graph
is and its 8 edges is shown below

3. A graph has vertices of degrees 1, 1, 4, 4, and 6. How many


edges the graph has?

ANSWER:

𝑇𝑜𝑡𝑎𝑙 𝑑𝑒𝑔𝑟𝑒𝑒 = 2 × 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑒𝑑𝑔𝑒𝑠


1 + 1 + 4 + 4 + 6 = 16 = 2 × 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑒𝑑𝑔𝑒𝑠
Therefore,
16
𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑒𝑑𝑔𝑒𝑠 = =8
2

Can you try to draw the graph yourself? I guess you should

4. In each of the following, either draw a graph with the


specified properties or explain why no such graph exists.

a) Simple graph with four vertices of degrees 1, 2, 3, and


4.

ANSWER: There is no such simple graph.

REASON: Suppose there were a simple graph with four


vertices of degrees 1, 2, 3, and 4. Then the vertex of
degree 4 would have to be connected by edges to four
distinct vertices other than itself because of the
assumption that the graph is simple (and hence has no
loops or parallel edges.) This contradicts the
assumption that the graph has four vertices in total.
Hence there is no simple graph with four vertices of
degrees 1, 2, 3, and 4.

b) Simple graph with five vertices of degrees 2, 3, 3, 3,


and 5.

ANSWER: There is no such graph.

REASON: Suppose there were a simple graph with five


vertices of degrees 2, 3, 3, 3, and 5. Then the vertex
of degree 5 would have to be connected by edges to 5
distinct vertices other than itself because of the
assumption that the graph is simple (and hence has no
loops or parallel edges.) This contradicts the
assumption that the graph has five vertices in total.
Hence there is no simple graph with five vertices of
degrees 2, 3, 3, 3 and 5.

c) Simple graph with five vertices of degrees 1, 1, 1, 2,


and 3.

ANSWER: Yes, this simple graph exists and is shown below

d) Simple graph with six edges and all vertices of degree


3.

ANSWER: Yes, and the simple graph is shown below


e) Simple graph with nine edges and all vertices of degree
3.
ANSWER: Yes, the simple graph exists and is shown below
5. Recall that 𝐾𝑛 denotes a complete graph on 𝑛 vertices.
Draw 𝐾6 .
ANSWER: The graph is shown below

6. Recall that 𝐾𝑚,𝑛 denotes a complete bipartite graph on


(𝑚, 𝑛) vertices.
a) Draw 𝐾4,2
ANSWER: The graph is shown below
b) Draw 𝐾1,3
ANSWER: The graph is shown below

c) Draw 𝐾3,4
ANSWER: The graph is shown below

d) How many vertices of 𝐾𝑚,𝑛 have degree 𝑚? degree 𝑛?

ANSWER: If 𝑛 ≠ 𝑚, the vertices of 𝐾𝑚,𝑛 are divided into two


groups: one of size 𝑚 and the other of size 𝑛. Every
vertex in the group of size 𝑚 has degree 𝑛 because each is
connected to every vertex in the group of size 𝑛. So 𝐾𝑚,𝑛
has 𝑛 vertices of degree 𝑚. Similarly, every vertex in the
group of size 𝑛 has degree 𝑚 since each is connected to
every vertex in the group of size 𝑚. So 𝐾𝑚,𝑛 has 𝑛
vertices of degree 𝑚.

e) What is the total degree of 𝐾𝑚,𝑛 ?

ANSWER: The total degree of 𝐾𝑚,𝑛 is 2𝑚𝑛 because 𝐾𝑚,𝑛 has


𝑚 vertices of degree 𝑛 and 𝑛 vertices of degree 𝑚, so
𝑚𝑛 + 𝑚𝑛 = 2𝑚𝑛.

f) Find a formula in terms of 𝑚 and 𝑛 for the number of


edges of 𝐾𝑚,𝑛 . Explain.

ANSWER: The number of edges of 𝐾𝑚,𝑛 is 𝑚𝑛. This is because


the total degree of 𝐾𝑚,𝑛 is 2𝑚𝑛, and so, by the
2𝑚𝑛
handshaking theorem, 𝐾𝑚,𝑛 has = 𝑚𝑛 edges.
2

You might also like