Skip to main content

Section 4.7 Chapter Summary

Hopefully this chapter has given you some sense for the wide variety of graph theory topics as well as why these studies are interesting. There are many more interesting areas to consider and the list is increasing all the time; graph theory is an active area of mathematical research.

One reason graph theory is such a rich area of study is that it deals with such a fundamental concept: any pair of objects can either be related or not related. What the objects are and what “related” means varies on context, and this leads to many applications of graph theory to science and other areas of math. The objects can be countries, and two countries can be related if they share a border. The objects could be land masses which are related if there is a bridge between them. The objects could be websites which are related if there is a link from one to the other. Or we can be completely abstract: the objects are vertices which are related if their is an edge between them.

What question we ask about the graph depends on the application, but often leads to deeper, general and abstract questions worth studying in their own right. Here is a short summary of the types of questions we have considered:

  • Can the graph be drawn in the plane without edges crossing? If so, how many regions does this drawing divide the plane into?

  • Is it possible to color the vertices of the graph so that related vertices have different colors using a small number of colors? How many colors are needed?

  • Is it possible to trace over every edge of a graph exactly once without lifting up your pencil? What other sorts of “paths” might a graph posses?

  • Can you find subgraphs with certain properties? For example, when does a (bipartite) graph contain a subgraph in which all vertices are only related to one other vertex?

Not surprisingly, these questions are often related to each other. For example, the chromatic number of a graph cannot be greater than 4 when the graph is planar. Whether the graph has an Euler path depends on how many vertices each vertex is adjacent to (and whether those numbers are always even or not). Even the existence of matchings in bipartite graphs can be proved using paths.

Exercises Chapter Review

1.

Which (if any) of the graphs below are the same? Which are different? Explain.

2.

Which of the graphs in the previous question contain Euler paths or circuits? Which of the graphs are planar?

3.

Draw a graph which has an Euler circuit but is not planar.

4.

Draw a graph which does not have an Euler path and is also not planar.

5.

Consider the graph \(G = (V, E)\) with \(V = \{a,b,c,d,e,f,g\}\) and \(E = \{ab, ac, af, bg, cd, ce\}\) (here we are using the shorthand for edges: \(ab\) really means \(\{a,b\}\text{,}\) for example).

  1. Is the graph \(G\) isomorphic to \(G' = (V', E')\) with \(V' = \{t, u, v, w, x, y, z\}\) and \(E' = \{tz, uv, uy, uz, vw, vx\}\text{?}\) If so, give the isomoprhism. If not, explain how you know.

  2. Find a graph \(G''\) with 7 vertices and 6 edges which is NOT isomorphic to \(G\text{,}\) or explain why this is not possible.

  3. Write down the degree sequence for \(G\text{.}\) That is, write down the degrees of all the vertices, in decreasing order.

  4. Find a connected graph \(G'''\) with the same degree sequence of \(G\) which is NOT isomorphic to \(G\text{,}\) or explain why this is not possible.

  5. What kind of graph is \(G\text{?}\) Is \(G\) complete? Bipartite? A tree? A cycle? A path? A wheel?

  6. Is \(G\) planar?

  7. What is the chromatic number of \(G\text{?}\) Explain.

  8. Does \(G\) have an Euler path or circuit? Explain.

6.

If a graph has 10 vertices and 10 edges and contains an Euler circuit, must it be planar? How many faces would it have?

7.

Suppose \(G\) is a graph with \(n\) vertices, each having degree 5.

  1. For which values of \(n\) does this make sense?

  2. For which values of \(n\) does the graph have an Euler path?

  3. What is the smallest value of \(n\) for which the graph might be planar? (tricky)

8.

At a school dance, 6 girls and 4 boys take turns dancing (as couples) with each other.

  1. How many couples danced if every girl dances with every boy?

  2. How many couples danced if everyone danced with everyone else (regardless of gender)?

  3. Explain what graphs can be used to represent these situations.

9.

Among a group of \(n\) people, is it possible for everyone to be friends with an odd number of people in the group? If so, what can you say about \(n\text{?}\)

10.

Your friend has challenged you to create a convex polyhedron containing 9 triangles and 6 pentagons.

  1. Is it possible to build such a polyhedron using only these shapes? Explain.

  2. You decide to also include one heptagon (seven-sided polygon). How many vertices does your new convex polyhedron contain?

  3. Assuming you are successful in building your new 16-faced polyhedron, could every vertex be the joining of the same number of faces? Could each vertex join either 3 or 4 faces? If so, how many of each type of vertex would there be?

11.

Is there a convex polyhedron which requires 5 colors to properly color the vertices of the polyhedron? Explain.

12.

How many edges does the graph \(K_{n,n}\) have? For which values of \(n\) does the graph contain an Euler circuit? For which values of \(n\) is the graph planar?

13.

The graph \(G\) has 6 vertices with degrees \(1, 2, 2, 3, 3, 5\text{.}\) How many edges does \(G\) have? If \(G\) was planar how many faces would it have? Does \(G\) have an Euler path?

14.

What is the smallest number of colors you need to properly color the vertices of \(K_{7}\text{.}\) Can you say whether \(K_7\) is planar based on your answer?

15.

What is the smallest number of colors you need to properly color the vertices of \(K_{3,4}\text{?}\) Can you say whether \(K_{3,4}\) is planar based on your answer?

16.

Prove that \(K_{3,4}\) is not planar. Do this using Euler's formula, not just by appealing to the fact that \(K_{3,3}\) is not planar.

17.

A dodecahedron is a regular convex polyhedron made up of 12 regular pentagons.

  1. Suppose you color each pentagon with one of three colors. Prove that there must be two adjacent pentagons colored identically.

  2. What if you use four colors?

  3. What if instead of a dodecahedron you colored the faces of a cube?

18.

Decide whether the following statements are true or false. Prove your answers.

  1. If two graph \(G_1\) and \(G_2\) have the same chromatic number, then they are isomorphic.

  2. If two graphs \(G_1\) and \(G_2\) have the same number of vertices and edges and have the same chromatic number, then they are isomorphic.

  3. If two graphs are isomorphic, then they have the same chromatic number.

19.

If a planar graph \(G\) with \(7\) vertices divides the plane into 8 regions, how many edges must \(G\) have?

20.

Consider the graph below:

  1. Does the graph have an Euler path or circuit? Explain.

  2. Is the graph planar? Explain.

  3. Is the graph bipartite? Complete? Complete bipartite?

  4. What is the chromatic number of the graph.

21.

For each part below, say whether the statement is true or false. Explain why the true statements are true, and give counterexamples for the false statements.

  1. Every bipartite graph is planar.

  2. Every bipartite graph has chromatic number 2.

  3. Every bipartite graph has an Euler path.

  4. Every vertex of a bipartite graph has even degree.

  5. A graph is bipartite if and only if the sum of the degrees of all the vertices is even.

22.

Consider the statement “If a graph is planar, then it has an Euler path.”

  1. Write the converse of the statement.

  2. Write the contrapositive of the statement.

  3. Write the negation of the statement.

  4. Is it possible for the contrapositive to be false? If it was, what would that tell you?

  5. Is the original statement true or false? Prove your answer.

  6. Is the converse of the statement true or false? Prove your answer.

23.

Let \(G\) be a connected graph with \(v\) vertices and \(e\) edges. Use mathematical induction to prove that if \(G\) contains exactly one cycle (among other edges and vertices), then \(v = e\text{.}\)

Note: this is asking you to prove a special case of Euler's formula for planar graphs, so do not use that formula in your proof.

You have attempted of activities on this page.