You are logged in as Tushar Agarwal (https://learn.illinois.edu/user/profile.php?

id=130588) (Log out

(https://learn.illinois.edu/login/logout.php?sesskey=1nqJK4Z9oa))

CS 173 BL2 SP15: Discrete Structures (Prabhakaran, M)

(https://learn.illinois.edu/course/view.php?id=10564)
University of Illinois (http://illinois.edu)

QUIZ NAVIGATION

Finish attempt ... (https://learn.illinois.edu/mod/quiz/summary.php?attempt=3124588)

My home (https://learn.illinois.edu/my/)
/ College of Liberal Arts and Sciences (https://learn.illinois.edu/course/index.php?categoryid=2)
/ CS (Computer Science) (https://learn.illinois.edu/course/index.php?categoryid=1255)
/ CS 173 (https://learn.illinois.edu/course/index.php?categoryid=1562)
/ CS 173 BL2 SP15 (https://learn.illinois.edu/course/view.php?id=10564)
/ Homework 4: Q1 - Q3 (https://learn.illinois.edu/mod/quiz/view.php?id=973387)

Question 1

Matching number of C5 is

Answer saved
Points out of 2.00

Answer: 2

Flag question

Question 2

Matching number of K5 is

Answer saved
Points out of 2.00

Answer: 2

Flag question

Question 3

Matching number of the wheel graph W5 is

Answer saved
Points out of 2.00

Answer: 3

Flag question

Question 4

Matching number of K4,5 is

Answer saved

Answer: 4

Points out of 2.00

Flag question

Question 5
Answer saved
Points out of 8.00
Flag question

Question 6
Answer saved
Points out of 4.00
Flag question

We define the complement of a simple graph as a simple graph which has the same vertex set, but
with exactly those edges that are absent from the original graph.
Match each graph on the left with a description of its complement.
K1,3

A cyclic graph

P4 (a path with 4 nodes)

A graph isomorphic to the original one

C4

A matching with two edges

K4

A graph with no edges

What is wrong with the following proof?

Statement: If every vertex in a graph has degee at least 1, then the graph is connected.
Proof. We use induction. Let
(https://learn.illinois.edu/filter/tex/displaytex.php?
texexp=P%28n%29) be the proposition that if every vertex in an n-vertex graph has degree at least
1, then the graph is connected.

Base case: There is only one graph with a single vertex and it has degree 0. Therefore,
(https://learn.illinois.edu/filter/tex/displaytex.php?texexp=P%281%29) is vacuously true.

Inductive step: We must show that

(https://learn.illinois.edu/filter/tex/displaytex.php?

texexp=P%28n%29) implies

(https://learn.illinois.edu/filter/tex/displaytex.php?

texexp=P%28n%2B1%29) for all

(https://learn.illinois.edu/filter/tex/displaytex.php?
texexp=%20n%20%5Cgeq%201).

Consider an (https://learn.illinois.edu/filter/tex/displaytex.php?texexp=n)-vertex graph G in

which every vertex has degree at least 1. By the induction hypothesis, G isconnected; that is, there
is a path between every pair of vertices. Now we add one morevertex
(https://learn.illinois.edu/filter/tex/displaytex.php?texexp=x) to G to obtain an
(https://learn.illinois.edu/filter/tex/displaytex.php?texexp=%28n%20%2B%201%29) vertex graph
H.Since (https://learn.illinois.edu/filter/tex/displaytex.php?texexp=x) must have degree at least
one, there is an edge from (https://learn.illinois.edu/filter/tex/displaytex.php?texexp=x) to some
other vertex; call it (https://learn.illinois.edu/filter/tex/displaytex.php?texexp=y). Since
(https://learn.illinois.edu/filter/tex/displaytex.php?texexp=y) is connected to every other node in
the graph, (https://learn.illinois.edu/filter/tex/displaytex.php?texexp=x) will be connected to
every other node in the graph. QED
Select one:
a. The proof needs to use strong induction.

b. The proof only considers (https://learn.illinois.edu/filter/tex/displaytex.php?texexp=n)

nodegraphs with minimum degree 1 to which adding a vertex with non-zero degree gives a
graph with minimum degree 1.
c. The proof should instead induct on the degree of each node.
d. The proof needs to consider base case
(https://learn.illinois.edu/filter/tex/displaytex.php?texexp=n%3D2).
e. This is a trick question. There is nothing wrong with the proof
f. The proof only considers
(https://learn.illinois.edu/filter/tex/displaytex.php?
texexp=%28n%20%2B%201%29) nodegraphs with minimum degree 1 from which deleting a
vertex gives a graph with minimum degree 1.

Next

Moodle v2.6.6 (Build: 20141110)

Page created March 13, 2015, 12:28AM

Please read the Web Privacy Notice (http://go.illinois.edu/privacy) for privacy terms and conditions employed by the University of
Illinois.
Copyright 2015 The Board of Trustees of the University of Illinois.