MyCC

MACM 201A Discrete Mathematics II - Spring 2023

Started on Tuesday, 7 February 2023, 4:00 PM

State Finished
Completed on Tuesday, 7 February 2023, 5:27 PM
Time taken 1 hour 26 mins
Grade 94.64 out of 100.00

Question 1
The following graphs are not isomorphic because
Correct

Mark 10.00 out

of 10.00

Flag
question

There is more than one correct answer!

a. the two graphs have different number of edges.

b. G₂ has a vertex of degree 5 while G₁ doesn't have one

c. the subgraphs of the two graphs induced by the vertices of degree 4 are not isomorphic

d. the subgraphs of the two graphs induced by the vertices of the 3-cycles (cycles with 3 vertices) are 
not isomorphic.

e. the two graphs have different degree sequence 

f. the two graphs have different number of vertices.

g. the subgraphs of the two graphs induced by the vertices of degree 3 are not isomorphic

Your answer is correct.

Question 2 Find all edges in the given graph that are cut edges.
Partially
There may be more than one correct answer in the given choices,
correct

Mark 7.50 out

of 10.00

Flag
question

a. cd

b. on

c. d

d. ab

e. hj

f. ac

g. io

h. hi

i. df

j. ji 

k. This choice was deleted after the attempt was started.

Your answer is partially correct.

You have correctly selected 2.

Comment:

Question 3

Correct
Given that with respect to the ordering a,b,c,d,e of its vertices, a simple
Mark 10.00 out graph G has adjacency matrix
of 10.00

Flag
question

Answer the following questions by dragging the items at the bottom of the
screen into the appropriate position.

Your answer is correct.

Question 4

Correct

Mark 10.00 out

of 10.00

Flag
question

What is the degree of a vertex in ? n 

How many vertices does have? 2^n 

How many edges does have? n2^(n-1) 

What is n if has 524288 edges? 16 

Your answer is correct.

Question 5
Let G be an undirected loop-free graph that is isomorphic to its complement and has 33 edges. How
Correct
many vertices does G have?
Mark 10.00 out
of 10.00
a. 11
Flag
question b. 12

c. 19

d. 15

Your answer is correct.

Question 6

Correct
Identify the type of each graph by dragging the appropriate label from
Mark 10.00 out the bottom of the page onto it.
of 10.00

Flag
question

Your answer is correct.

Question 7
Find the most appropriate matching answer from the given choices.
Correct

Mark 10.00 out Note: In one of the questions K33 means and K5 means
of 10.00

Flag
question Complete the sentence:

A connected multigraph
each of its vertices has even degree
with at least two vertices
has an Euler circuit if 
and only if ............
Complete the sentence:

Let G=(V,E) be a graph

or multigraph with at
it contains every vertex of G.
least three vertices.

A cycle in G is called a
Hamiltonian cycle if
............
Complete the sentence:
it can be drawn in the plane without any edges crossing.
A graph is called planar
if .................. 

Answer TRUE or FALSE:

The given graph has an

Euler trail.

TRUE because it is connected and it has exactly 2 vertices of odd degree. degree


Find the most

appropriate answer:

For which positive When n is odd

integer values of n does

the complete graph

have an Euler circuit?

Complete the sentence:

A simple graph G with

n≥3 vertices in which
deg(u)+deg(v)≥n/2 for has a Hamilton cycle.
every pair of non-

adjacent vertices u and v
in G ..........

Answer TRUE or FALSE.

Justify your choice!
The given graph has an
Euler circuit.
TRUE because it is connected and every vertex has even degree


A connected multigraph
with at least two vertices
has an Euler trail if and it has exactly 2 vertices of odd degree.
only if ...................... 

Complete the sentence:

A simple graph G with

n≥3 vertices in which
has a Hamilton cycle.
the degree of every
vertex is at least n/2 
...........

Complete the sentence:

A graph is non-planar if
K33 or K5
and only if it contains a
subgraph 
homeomorphic to...........

Your answer is correct.

Question 8

Correct

Mark 10.00 out

of 10.00

Flag
question

2600


816


3264


120


720


0


0


0


0


56


Your answer is correct.

Question 9

Partially
correct

Mark 7.14 out

of 10.00

Flag
question

Pick an appropriate answer from the given choices for each of the following
questions.

State Euler's
r=e - v + 2
formula for planar
graphs 
Given that the
graph G above is
planar, use Euler's
formula to find the 8
number r of

regions in a planar
representation of
G.

G cannot be
colored with 3
colors, since G
contains a
subgraph
isomorphic to K₄ a,b,c and f __________4
which is induced 
by the vertices
________ and has
chromatic number
______.

Color G with the 4

colors red, blue,
green and yellow.

If the colors of the

vertices a,b and c
are red, blue and blue__________yellow__________blue
green,

respectively, then
the color of d is
______, the color
of e is _____, and
the color of f is
_____.

The chromatic
number of G is 4 _____G can be colored with 4 but not 3 colors
_____

because_________

Let U =
{a,b,c,d,e,f} be the
vertex set of G
and let V =
{a,b,c,d,e,f} be the
vertex set of the
graph H below.
Given that f : U→V
is a function so
that f(a)=a, f(b)=b,
f(c)=c, f(d)=e,
f(e)=d and f(f)=f
Is f an
isomorphism
between G and H? YES
YES or NO? 
If the answer is
NO, give the
reason, and
change f so that it
becomes an
isomorphism
between G and H?

The Graph G is G is isomorphic to H and H is planar.

planar because


Your answer is partially correct.

You have correctly selected 5.

Question 10

Correct
Suppose a tree has 4 vertices of degree 2, 1 vertex of degree 3, 2 vertices of
Mark 10.00 out degree 4, and one vertex of degree 5.
of 10.00

Flag How many pendent vertices (vertices of degree 1) does it have?

question

a. 8

b. 7

c. 13

d. 10

e. 9

Your answer is correct.

Finish review

Quiz navigation

1 2 3 4 5 6 7 8 9 10

Show one page at a time

Finish review