# Discrete Mathematics | Week 7

## Quiz

1. Which of the following graphs are not complete graphs?

Explanation

2. What is the degree sequence of the given graph?

Explanation

3. What are the cut edge and the cut vertex respectively, in the following graph?

c.  (π΅, πΈ) and πΈ

Explanation

4. The number of components in a πΎn and πΆn respectively are?

d.  1,1

Explanation

5. Which of the following is a graphic sequence?

a. 5,3,3,2,2,1

Explanation

6. Which of the following is not a path from A to H?

a. {π΄ β π΅ β πΈ β πΉ β πΊ β π»}

d. {π΄ β πΉ β πΆ β π΅ β πΈ β π· β πΆ β π»}

f. {π΄ β π»}

Explanation

7. If an edge is removed from a cycle in a graph, then the graph becomes disconnected.
State whether true/false.

b. False

Explanation

8. For a simple graph with vertices, how many subgraphs can be constructed, such that the subgraph is an induced subgraph as well as a spanning subgraph?

a. 1

Explanation

9. Observe the following graph.

Choose the correct option(s) from below.

a. {π· β πΈ β πΉ β πΊ β πΆ β π·} is a cycle

b. {π» β π΅ β π· β πΆ β πΊ β πΉ β π· β π΄} is a trail

e. {π΄ β π΅ β π· β πΆ β πΊ β πΉ β π· β π΄} is a circuit.

Explanation

10. Which of the following statements is/are true?

I) If there is a walk from P to Q then, there must be a path from P to Q.

II) The number of edges in a tree is equal to one less than the number of vertices.

III) Every graph has an odd number of oddβdegree vertices.

d. I and II

Explanation

0