Scribd
Upload
13 views

Sol 2

The document discusses solutions to assignment problems in a graph theory and networks course. It addresses topics like finding the degree of vertices in a graph, determining the centers and diameter of a graph, finding shortest paths and walks in a graph, properties of distances in graphs, identifying edge cuts of a graph, and relating the connectivity and minimum degree of a graph.

Uploaded by

keungboy26
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
13 views

Sol 2

The document discusses solutions to assignment problems in a graph theory and networks course. It addresses topics like finding the degree of vertices in a graph, determining the centers and diameter of a graph, finding shortest paths and walks in a graph, properties of distances in graphs, identifying edge cuts of a graph, and relating the connectivity and minimum degree of a graph.

Uploaded by

keungboy26
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

MMAT5380 Graph Theory and Networks

Second Semester 2018-19


Suggested Solution for Assignment 2

2-1:
u1 u2 u3 u4 u5 u6 sum = deg+
u1 0 1 2 0 0 0 3
u2 0 1 0 0 1 0 2
u3 0 0 0 1 1 0 2
A=
u4 1 1 0 0 0 1 3
u5 1 0 0 1 0 1 3
u6 0 0 1 1 0 0 2
−
sum = deg 2 3 3 3 2 2

u1 u2 u3

u4 u5 u6

2-2: (a) e(v1 ) = 3, e(v2 ) = 3, e(v3 ) = 2, e(v4 ) = 2, e(v5 ) = 2, e(v6 ) = 2, e(v7 ) = 3.

(b) v3 , v4 , v5 , v6 are centers.

(c) The radius is 2 and the diameter is 3.

(d) v1 v3 v4 v2 v5 v6 v7 is a longest path (or v2 v4 v3 v1 v5 v6 v7 , v4 v3 v1 v2 v5 v6 v7 ).

2-3: (a) Choose five (a, f )-walks from ababf , abadf , abcbf , abebf , abedf , abf bf , abf df , adabf , adadf ,
adebf , adedf , adf bf , adf df , aeabf , aeadf and aecbf .

(b) There are abceadf , aebcedf , aecbadf and aecbedf .

(c) There are abcedf and adecbf .

2-4: The corresponding graph is


(AAAA) (BBAA) (ABAA) (BBBA) (AABA) (ABBB)

(BAAA) (BBAB) (AAAB) (BABB) (AABB) (BBBB)

There are two shortest ways for the man to cross the river. They are

(AAAA)-(BBAA)-(ABAA)-(BBBA)-(AABA)-(BABB)-(AABB)-(BBBB) and
(AAAA)-(BBAA)-(ABAA)-(BBAB)-(AAAB)-(BABB)-(AABB)-(BBBB).

Note that (ABBA), (BAAB), (ABAB) and (BABA) are not allowable.

1
2-5: Obviously, statements (a), (b) and (c) are true by the definition of distance. For (d), let P1 be the
path from u to v with length d(u, v) and P2 be the path from v to w of length d(v, w). Then P1 P2 is
a (u, w)-walk with length d(u, v)+ d(v, w). By Lemma 2.1.3, there is a (u, w)-path P in P1 P2 . By the
definition of distance, d(u, w) is the least length of paths from u to w. Thus d(u, v)+d(v, w) ≥ d(u, w).

2-6: Since G is connected and G − S is not, ω(G − S) ≥ 2 and S 6= ∅. Let e ∈ S and let S ′ = S \ {e}. By
definition of edge cut, G − S ′ is connected. By Lemma 2.1.11, 1 ≤ ω((G − S ′ ) − e) = ω(G − S) ≤ 2.
Hence ω(G − S) = 2.
P 2q
2-7: We know that 2q = deg(v) ≥ pδ which implies that δ ≤ p. By Theorem 2.4.6, κ(G) ≤ δ(G)
v∈V (G)
2q
we have κ(G) ≤ p. Note that κ(G) is an integer. Therefore κ(G) ≤ ⌊ 2q
p ⌋.

You might also like