Scribd
Upload
165 views

Assignment 4 Solutions

This document contains the solutions to an assignment on applied graph theory. It includes solving problems involving finding vertex-deletion and edge-deletion subgraphs, identifying cut-vertices and cut-edges, reconstructing graphs from subgraph lists, proving statements about cut-edges and cut-vertices, drawing graphs that meet certain criteria, and representing rooted trees using parent arrays.

Uploaded by

susan george
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
165 views

Assignment 4 Solutions

This document contains the solutions to an assignment on applied graph theory. It includes solving problems involving finding vertex-deletion and edge-deletion subgraphs, identifying cut-vertices and cut-edges, reconstructing graphs from subgraph lists, proving statements about cut-edges and cut-vertices, drawing graphs that meet certain criteria, and representing rooted trees using parent arrays.

Uploaded by

susan george
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

MATH 3330:

Applied Graph Theory


ASSIGNMENT #4 SOLUTIONS

1. In the following graph,

a) Find the indicated vertex-deletion subgraphs:

i) G y

ii) G {w,z}

MATH 3330 Assignment #4 - SOLUTIONS Page 1 of 7


iii) G {w,v,y}

b) Find the indicated edge-deletion subgraphs:

i) G e

ii) G {a,m,p,q}

iii) G {d,h,k}

MATH 3330 Assignment #4 - SOLUTIONS Page 2 of 7


2. In the following graph,

a) Find all the cut-vertices.

Cut-vertices are i and j.

b) Find all the cut-edges (Give edges by its endpoints, i.e. {a,b} for the
edge with endpoints a and b).

Cut-edges are {i,j} and {j,k}. (All other edges are cycle-edges.)

3. Find a graph with the vertex-deletion subgraph list given below.

First note that since the list of the vertex-deletion subgraph list is 5, then
|VG|=5. By theorem 2.4.4 (given in presentation on the Graph
Reconstruction Problem in class), we know that

1 1 1 1
EG =
5 2 vV 3
( )
E G v = E G v + E G w + E G x + E G y + E G z = ( 3 + 3 + 3 + 4 + 5) = (18) = 6
3 3

And, for each card, the degree of the missing vertex is the difference
between |EG| and the number of edges on that card. Thus,

MATH 3330 Assignment #4 - SOLUTIONS Page 3 of 7


deg(v)= |EG|-|EG-v|=6-3=3.
deg(w)= |EG|-|EG-w|=6-3=3.
deg(x)= |EG|-|EG-x|=6-3=3.
deg(y)= |EG|-|EG-y|=6-4=2.
deg(z)= |EG|-|EG-z|=6-5=1.

Thus, the the graph has degree sequence <3,3,3,2,1> and is isomorphic
to

4. True or false: The endpoints of a cut-edge are both cut-vertices. If false,


explain why.

False. Counterexample: Take any tree of at least two vertices. Every


edge is a cut-edge. However, the leaves are not cut-vertices. So any
edge with a leaf as an endpoint is a counterexample.

5. Draw a 6-vertex connected graph that has exactly seven edges and
exactly three cycles.

MATH 3330 Assignment #4 - SOLUTIONS Page 4 of 7


6. True or false: There exists a connected n-vertex simple graph with n +1
edges that contains exactly 2 cycles. If true, give an example. If false,
explain why not.

For 1 n 3, this cannot be true. To even contain n+1 edges, the graphs
would not be simple.

However, for n 4, it is TRUE! One realization of this follows:


Consider the path on n vertices, Pn. We know that it has n-1 edges.
Now add edges between each leaf and another non-adjacent vertex that
is not the other leaf (in the example below, the vertex two away). There
are exactly 2 cycles and weve added 2 edges to a Pn, so we now have
(n-1)+2=n+1 edges.

7. For the following, draw the specified tree or explain why no such tree
can exist.

a) A 14-vertex binary tree of height 3.

b) A 16-vertex binary tree of height 3.

No such tree can exist. We know (by Thm. 3.2.3) that for a binary
2 h +1 1
tree h +1 V where h is the height of the binary tree. In our
2 1
2 4 1 16 1
case, we are looking for a tree of height 3, so 4 V = = 15 .
2 1 1
So, for a binary tree to be of height 3, it may contain at most 15
vertices. Thus, a 16-vertex binary tree of height 3 cannot exist.

MATH 3330 Assignment #4 - SOLUTIONS Page 5 of 7


c) A ternary tree of height 3 with exactly four vertices.

There is only one, and it looks like this:

8. What is the relationship between the depth of a vertex v in a rooted tree


and the number of ancestors of v? Explain your answer.

They are equal. The depth of a vertex is the distance to the root. An
ancestor of a vertex v is a vertex on the path from v to the root. Since
there is only one unique path between any two vertices, there is only one
path from v to the root so this must be the shortest path. So the number
of vertices (not v) on this path is the number of ancestors, and the length
of this path is the depth. They must be equal.

9. For the following, draw the root tree specified by the given array of
parents.

a) Fvertex a b c d e f g h i j
parent - a b b b b b c c c

MATH 3330 Assignment #4 - SOLUTIONS Page 6 of 7


b) vertex a b c d e f g h i
parent - a b b c c d e e

10. Specify the rooted tree drawn below with an array of parents.

Array of parents given by:


vertex a b c d e f g h i j k
parent - a a b b b c c h h j

MATH 3330 Assignment #4 - SOLUTIONS Page 7 of 7

You might also like