Scribd
Upload
12 views

Instructions: Due Date

Uploaded by

Agrim joshi
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
12 views

Instructions: Due Date

Uploaded by

Agrim joshi
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/ 2

MACM 201 A SSIGNMENT #9

Due Date: Friday November 22, 2023, Quiz time


Instructions

Do all of these questions and write out the solutions neatly and succinctly as training. You do not have to hand
in your work. The quiz on November 22 will closely follow some of the questions on this assignment. Solutions
will be posted afterwards. Compare these with your own work to check if you did the questions correctly and
use them to improve your own exposition. Make use of the workshop to get clarification.

Textbook Reading

• Sections: 11.4, 11.5

Definitions, Concepts & Keywords

• Know the following terminology: planar graph, dual graph, graph complement, Hamiltonian path,
Hamiltonian cycle, and tree.
• Kuratowski’s theorem and Euler’s theorem for planar graphs.

Exercises

A. Textbook Questions
11.4 Exercises 2, 26abc.
11.5 Exercises 1, 6.
B. Additional Questions
Questions on 11.4
1. For each graph below determine if it is planar. If it is planar draw a planar embedding. If it is
not planar, find a subgraph that is a subdivision of K3,3 or K5 .

a
a
a b e
f b
e f
d h f b
e c g
h g

(a) d c (b) d (c) c

2. Let G = (V, E) be a connected simple graph with |V | ≥ 11.


Show that G or its complement Ḡ is not planar.
3. Draw a planar embedding of the tetrahedron T . Draw T ∗ the dual of T .
4. We have seen that K3,3 does not admit a planar embedding. In this question we will explore
if there are other surfaces on which we can draw a K3,3 . In fact we can do so on a torus,
which is the mathematical name for the shape of the surface of a donut or a bagel. You can
make a torus by taking a square piece of paper and glueing together the opposite pairs of
sides: doing so with only one pair gives you a cylinder and then glueing together the two
ends of the cylinder gives you a torus: basically the inner tube of a tire, or a ”life saver” ring:

C OPYRIGHT B RUIN 1
MACM 201 A SSIGNMENT #9

(the arrows indicate which edges should be glued together)


You can draw a graph in here in the same way as you can in the plane, with the following
additions: you can also draw edges that go to the right, which will then appear on the left side;
just as pacman can teleport from the right edge to the left edge (if there’s a gate for him to
pass through) and similarly you can draw edges that go through the top and then appear at the
bottom.
Can you draw K3,3 on a torus with edges only intersecting at vertices? How many faces do
you get? (hint: you should find |V | − |E| + |F | = 0 in this case, reflecting that a torus has
”euler characteristic” 0, rather than the ”euler characteristic” −2 of a sphere. This suggests you
might be able to classify surfaces by the kinds of graphs you can draw on them, which is indeed
something that happens in algebraic topology!)
Questions on 11.5
5. Recall that Km,n denotes the complete bipartite graph with m + n vertices.
(a) Does K2,3 have a Hamiltonian cycle? If yes draw one. If not explain.
(b) Does K2,3 have a Hamiltonian path? If yes draw one. If not explain.
(c) Find the Km,n with the fewest vertexes which has a Hamiltonian cycle.
(d) Find the Km,n with the fewest vertexes which has a Hamiltonian path.
6. Below is a non-planar drawing of the cube graph.

2 3
1 4

6
7

5 8

Draw a planar embedding of the cube graph.


Draw all Hamiltonian cycles that include the edge {1, 2}. (Hint: There are four.)
7. What is the converse of the statement in Theorem 11.8 in textbook (which is Theorem 6.4.3 in
notes)?
Give a counter example to this converse statement.

C OPYRIGHT B RUIN 2

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy