Scribd
Upload
2 views1 page

Tut 165

Uploaded by

Choco locco
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
2 views1 page

Tut 165

Uploaded by

Choco locco
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/ 1

Department of Mathematics

I Semester 2016-2017
MAL 656/MAL 468/ MTL 768 Graph Theory
Tutorial Sheet 5
1. Determine r and s such that K r,s is planar.
2. Prove that every simple planar graph with fewer than 12 vertices has a vertex
of degree at most 4.
3. Show that Peterson graph is non planar and determine the minimum number of
Edges that must be deleted from the Peterson graph to obtain a planar graph.
4. Show that if a shortest cycle in a planar graph G has length k, then m ≤k (n- 2)/ (k-2).
5. Deduce from Q4, that for a bipartite planar graph, m ≤2n-4.
6. Prove that every disconnected graph with n 3 vertices and m=3n-6 edges must be non-
planar.
7. Give an example of a nonplanar graph having m=3n-6. What is the minimum value of n for
which there is a nonplanar graph with n vertices and 3n-6 edges?
8. Show that a connected graph is planar if and only if each of its blocks is planar.
9. Let k be the number of vertices of degree at most five in a planar graph. What is the
minimum value of k over all planar graphs?
10. Let G be a planar graph such that every vertex of G has degree at least 4. What is the
minimum number of vertices of degree at most 5 in such a graph?

You might also like