Scribd
Upload
46 views3 pages

MAT3707 - Discrete Mathematics Assignment 1

The document contains 9 questions about graph theory topics such as graph isomorphisms, chromatic numbers, planar graphs, Eulerian graphs, spanning trees, and binary trees. Students are asked to prove theorems, determine properties of graphs, find minimal spanning trees, and sketch ternary trees.

Uploaded by

gch.010796
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
46 views3 pages

MAT3707 - Discrete Mathematics Assignment 1

The document contains 9 questions about graph theory topics such as graph isomorphisms, chromatic numbers, planar graphs, Eulerian graphs, spanning trees, and binary trees. Students are asked to prove theorems, determine properties of graphs, find minimal spanning trees, and sketch ternary trees.

Uploaded by

gch.010796
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
Download as pdf or txt
You are on page 1/ 3

Course Code MAT3707

Course Name Discrete Mathematics: Combinatorics


Assignment 1
UAN 156169
Due Date March 28, 2024 by 21:00 hours

QUESTION 1
Consider the following two graphs:
a b u w

e v

f z

d c y x

(a) G1 (b) G2

(i) Let the vertex set of G1 and G2 be V1 and V2 respectively. Prove that the function
g : V1 → V2 with g(a) = u, g(b) = v, g(c) = w, g(d) = x, g(e) = y, and g(f ) = z is
NOT a graph isomorphism. [4]

(ii) Give another example of a function from V1 to V2 that is NOT a graph isomorphism.
Give reasons for your answer. [4]

(iii) Specify two graphs that have the same degree sequence as G1 and G2 but that are not
isomorphic to G1 or G2 . Explain why the graphs you specified meet this requirement. [8]
[Total 16]

QUESTION 2

(i) Suppose a graph G has at least one edge. Prove that the chromatic number of G is
2 if and only if G is bipartite. [5]

(ii) Determine the chromatic number of the following graph. Give a minimal colouring
and a proof that a smaller number of colours cannot be used.

[5]
[Total 10]
QUESTION 3

(i) Let G be a planar, bipartite graph of order n and size m, where n ≥ 3. Prove that
m ≤ 2n − 4. [6]

(ii) Use the circle-chord method to show that a complete bipartite graph with 4 vertices
in each partition is not planar. [6]
[Total 12]

QUESTION 4
A graph is Eulerian if it contains an Euler cycle. Let T be a tree whose complement T is
connected. Prove that T is Eulerian if and only if T has only vertices of odd degree.
[Total 6]

QUESTION 5
Consider the graph below

(i) Does the graph have an Euler cycle? Justify your answer. [6]

(ii) Does the graph have a Hamiltonian circuit? Justify your answer. [4]

[Total 10]

QUESTION 6

(i) A complete n-ary tree is a tree in which each vertex has n children or no children.
Suppose one such tree has 10 internal vertices and 41 leaves. What is the value of
n? Give clear reasons for your answer. [4]

(ii) If T is a binary tree of height 3, then what is the smallest and largest number of
vertices that T can have? [6]
[Total 10]

Page 2
QUESTION 7
Sketch all the non-isomorphic, rooted, ternary trees on 10 vertices. Prove that, up to
isomorphism, these are the only such trees.
[Total 8]

QUESTION 8
Find a minimal spanning tree of the weighted graph below, using
(i) Kruskal’s algorithm; [8]

(ii) Prim’s algorithm. [8]


In each spanning tree show the order in which the edges have been selected by numbering
them accordingly (i.e. do not give the weights).

[Total 16]

QUESTION 9
Consider the graph from Question 8 and ignore the weights.

(i) Determine a depth-first spanning tree with vertex 0 as the root. [6]

(ii) Determine a breadth-first spanning tree with vertex 0 as the root. [6]
[Total 12]

[GRAND TOTAL 100]

END OF ASSIGNMENT

Page 3

You might also like