Written by students who passed Immediately available after payment Read online or as PDF Wrong document? Swap it for free 4,6 TrustPilot
logo-home
Document preview thumbnail
Preview 4 out of 42 pages
Other

Discrete Mathematics: Combinatorics (MAT3707) – University of South Africa – 2022–2025 – Assignment 1 Questions and Fully Worked Solutions

Document preview thumbnail
Preview 4 out of 42 pages

This document contains Assignment 01 for MAT3707 Discrete Mathematics: Combinatorics, including questions and detailed handwritten and provided solutions covering graph theory, planarity, isomorphism, trees, and spanning algorithms. It includes multiple years of assignments (2022–2025) with full worked answers, proofs, and diagrams. The material aligns with Units 1 and 2 of the study guide and is useful for exam preparation, practice, and understanding key combinatorics concepts through step-by-step solutions and visual graph illustrations.

Content preview

, MAT3707/102/0/2022




Tutorial letter 102/0/2022

DISCRETE MATHEMATICS:
COMBINATORICS
MAT3707

Year module


Department of Mathematical Sciences


IMPORTANT INFORMATION:
This tutorial letter contains questions for assignment 01.




BARCODE




university
Define tomorrow. of south africa

, MAT3707
ASSIGNMENT 01

UNITS 1, 2 in the Study Guide
DUE DATE: 29 APRIL 2022




QUESTION 1

Draw two non-isomorphic graphs with degree sequence 3,3,2,1,1,1,1. Explain why your two graphs are
non-isomorphic. [4]

QUESTION 2

A graph is said to be r − regular if every vertex has degree r.

(a) Find out whether the complement of a regular graph is regular.

(b) Find, up to isomorphism, all 4−regular graphs of order 7.
(Instead of trying to find 4−regular graphs on 7 vertices, first find complements of 4−regular
graphs on 7 vertices.) [3+6=9]

QUESTION 3

(a) Prove that if G = (V1 ∪ V2 , E) is a bipartite graph, then
X X
|E| = deg(v) = deg(v)
v∈V1 v∈V2


(b) Use part (a) to prove that if a graph has odd order and is regular of degree r ≥ 1, then it is not
bipartite.

[4+4=8]

QUESTION 4

n(n − 1)
(a) Prove that a complete graph with n vertices has edges.
2
(b) A graph is self-complementary it is isomorphic to its complement.

(i) Prove that there is no self-complementary graphs of order 3.
(ii) Give an example of a self-complementary simple graph with 4 and 5 vertices respectively.

[4+3+4=11]



2

, MAT3707/102/0/2022


QUESTION 5

Determine which pairs of graphs below are isomorphic? EXPLAIN FULLY.




[12]


QUESTION 6

If a connected planar graph with n vertices, all of degree 4, has 10 regions, determine n. [5]

QUESTION 7

Consider a connected planar graph with v(≥ 3) vertices, e edges and r regions.

Show that if e = 3v − 6 then each region is a triangle. [6]

QUESTION 8

(a) Show that the Petersen graph contains a subgraph that is a K3,3 configuration.

(b) Does it contain a subgraph that is a K5 configuration?

(c) Deduce that the Petersen graph is non-planar.

[3 + 2 + 2 = 7]

QUESTION 9

Prove that if a connected graph G has 11 vertices, then either G or its complement G must be
nonplanar.


3

Document information

Uploaded on
March 21, 2026
Number of pages
42
Written in
2025/2026
Type
Other
Person
Unknown
R99,33

Wrong document? Swap it for free Within 14 days of purchase and before downloading, you can choose a different document. You can simply spend the amount again.
Written by students who passed
Immediately available after payment
Read online or as PDF

Seller avatar
PSMokwena
5,0
(1)
Sold
3
Followers
0
Items
14
Last sold
2 months ago


Why students choose Stuvia

Created by fellow students, verified by reviews

Quality you can trust: written by students who passed their exams and reviewed by others who've used these notes.

Didn't get what you expected? Choose another document

No worries! You can immediately select a different document that better matches what you need.

Pay how you prefer, start learning right away

No subscription, no commitments. Pay the way you're used to via credit card or EFT and download your PDF document instantly.

Student with book image

“Bought, downloaded, and aced it. It really can be that simple.”

Alisha Student

Working on your references?

Create accurate citations in APA, MLA and Harvard with our free citation generator.

Working on your references?

Frequently asked questions