Math 110 Graph Theory Out of Class Assignment
You should complete each of the problems below on a separate sheet of paper. These problems will be
collected in class for a grade on Wednesday, September 9, 2015.
-
For each of the following conditions, draw a graph that satisfies the conditions. If you believe it is
impossible, explain your reasoning.
(a) A simple graph with 4 vertices, two of which have degree 2. (b) A simple graph with 3 odd vertices.
(c) a connected graph with a bridge. Identify the bridge.
-
Sketch a graph with vertices A, B, C, D, E and edges {AB, AE, BD, BC, BE, CE, DE}.
-
The following questions deal with the graph below.
- (a) Give the degree of vertex F .
-
(b) What is the length of the path FBCGEF?
-
(c) Can the graph be colored with four colors? Three? If so, give a coloring (label the vertices with
the assigned color).
- (a) Give the degree of vertex F .
-
The following questions deal with the graph below.
- (a) Give the degree of vertex C.
-
(b) Is ABGE a path in the graph?
-
(c) Give a path of length 4 in the graph, starting at A.
-
(d) Can you start at one vertex, and trace every edge in the graph exactly once (so no repeating
edges), and return to the starting vertex? (ie, Does the graph have an Euler circuit?) Why or
why not?
- (a) Give the degree of vertex C.
1


No comments:
Post a Comment