Starting from:

$25

CPTS553- Graph Theory: Assignment 7 Solved

Questions with a (โ‹†) are each worth 1 bonus point for 453 students.

Some questions about drawing ๐‘„๐‘˜ graphs on surfaces. A. Show that ๐‘„3 can be drawn on the plane.Use the fact that ๐‘„4 is bipartite and a total edge count argument to show that ๐‘„4 cannot be drawn on the plane.
Draw ๐‘„4 on the torus (use the ๐‘Ž๐‘๐‘Ž−1๐‘−1 square representation drawn below). HINT:  ๐‘„4 is isomorphic to ๐ถ4 × ๐ถ4.
Show that ๐‘”(๐‘„5) ≥ 5. Recall that for ๐‘„5 we have ๐‘› = 32 and ๐‘š =
80. As a first step, use a total edge count argument to show that
๐‘Ÿ ≤ 40.  Feed this information into Euler’s formula  ๐‘› − ๐‘š + ๐‘Ÿ = 2 − 2 ๐‘”(๐‘„5).

(โ‹†) Generalize the strategy in part D to obtain a “meaningful” lower bound for ๐‘”(๐‘„๐‘˜).  Here, recall that ๐‘› = 2๐‘˜ and ๐‘š = ๐‘˜2๐‘˜−1.     
The Petersen graph ๐‘ƒ is depicted:
Use a total edge count argument to show that ๐‘ƒ is non-planar. You may use the fact that ๐‘ƒ has no triangles or 4-cycles as subgraphs. B. Draw ๐‘ƒ on a torus without the edges crossing.          
Draw ๐พ4,4 on a torus without the edges crossing. Suggestion:  Start with your two partite sets (every edge joins a red vertex to a blue vertex) arranged as shown:                                

More products