Republic of the Philippines

SORSOGON STATE UNIVERSITY

School of Graduate Studies
Sorsogon City

Name: Jhena B. Cantonjos

Program: Doctor of Philosophy in Mathematics Education (Ph. D. MathEd)
Subject: Graph Theory (PHDMATHED 713)
Professor: Ritzelda A. Deri, Ph. D.

Assignment 3

1. Construct the wheel graph W7 and W9.

Answer:
W7 W9

W(n-1) = W (8-1) = W7 W(n-1) = W (10-1) = W9

2. Find the value of n for which Km, n is regular graph.

Answer:
• Every vertex in Km, n has degree either m or n. Therefore, Km, n is regular if and only if
m = n and in this case every vertex will have degree m.

3. Check if the following graphs are connected or not.

Answer:

Connected Disconnected Disconnected Connected

1|P age
4. Consider the graph G with 12 edges. If G has 6 vertices of degree 3 and the other vertices
have degree less than 3, then calculate the minimum number of vertices G can have.
Answer:
Given: 12 – edges
6 – vertices of degree 3
(x – 6) – vertices of degree less than 3

6 x 3 + (x – 6) (-3) = 2(12)
18 + (-3x) + 18 = 24
-3x = 24 - 36
-3x = -12
x=4

5. Consider a non- directed graph G of order 13 such that each vertex has degree 7 or 8.
Prove that there are at least 8 vertices of degree 7 or 7 vertices of degree 8.
Answer:

6. Calculate the number of edges in the following graph G, if G has

Answer:
a. 16 vertices, each of degree 2
n = 16, d = 2
nd = 32
2e = ∑ 𝑛𝑑
2e = 32
32
e= 2
e = 16

b. 3 vertices of degree 4, 2 vertices of degree 3 and other 4 vertices of degree 1.

n = 3, d = 4 ; n = 2, d = 3 ; n = 4, d = 1
∑ 𝑛𝑑 = (3)(4) + (2)(3) + (4)(1)

2|P age
 = 22
2e = Σnd
2e = 22
22
e= 2
e = 11

7. Determine whether the statements below are true or false

Answer:
a. Every disconnected graph has an isolated vertex.
False, disconnected means not connected. There may or may not be isolated
vertex.

b. A graph is connected if only if some vertex is connected to all other vertices.

True, it is a connected graph if every pair of vertices can be joined by a path or if
one can pick up an entire graph by grabbing just one vertex, then the graph is connected.

c. Every u, v-walk (walk between u and v) contains a u, v-path.

True, walk is a way of getting from one vertex to another, and consists of a
sequence of edges, one following after another and path is a walk in which no vertex appears more
than once. Hence, every path is always a walk, but not conversely.

3|P age