Graph
Quizsummary
0 of 10 questions completed
Questions:
 1
 2
 3
 4
 5
 6
 7
 8
 9
 10
Information
Graph
You have already completed the quiz before. Hence you can not start it again.
Quiz is loading...
You must sign in or sign up to start the quiz.
You have to finish following quiz, to start this quiz:
Results
0 of 10 questions answered correctly
Your time:
Time has elapsed
You have reached 0 of 0 points, (0)
Categories
 Not categorized 0%
 1
 2
 3
 4
 5
 6
 7
 8
 9
 10
 Answered
 Review

Question 1 of 10
1. Question
Which of the following is an advantage of adjacency list representation over adjacency matrix representation of a graph?
Correct
Incorrect

Question 2 of 10
2. Question
How many undirected graphs (not necessarily connected) can be constructed out of a given set V= {V 1, V 2,…V n} of n vertices ?
Correct
Incorrect

Question 3 of 10
3. Question
Which of the following statements is/are TRUE for an undirected graph? P: Number of odd degree vertices is even Q: Sum of degrees of all vertices is even
Correct
Incorrect

Question 4 of 10
4. Question
For which of the following does there exist a graph G = (V, E, φ) satisfying the specified
conditions?Correct
Incorrect

Question 5 of 10
5. Question
For which of the following does there exist a simple graph G = (V, E) satisfying the
specified conditions?Correct
Incorrect

Question 6 of 10
6. Question
The number of simple digraphs with V  = 3 and exactly 3 edges is
Correct
Incorrect

Question 7 of 10
7. Question
The number of oriented simple graphs with V  = 4 and 2 edges is
Correct
Incorrect

Question 8 of 10
8. Question
In each case the depthfirst sequence of an ordered rooted spanning tree for a graph
G is given. Also given are the nontree edges of G. Which of these spanning trees is a
depthfirst spanning tree?Correct
Incorrect

Question 9 of 10
9. Question
Compute the total number of bicomponents in all of the following three simple graphs,
G = (V, E) with V  = 5. For each graph the edge sets are as follows:
E =
{1, 2}, {2, 3}, {3, 4}, {4, 5}, {1, 3}, {1, 5}, {3, 5}E =
{1, 2}, {2, 3}, {3, 4}, {4, 5}, {1, 3}E =
{1, 2}, {2, 3}, {4, 5}, {1, 3}Correct
Incorrect

Question 10 of 10
10. Question
A graph with V = {1, 2, 3, 4} is described by φ =
a
{1,2}
b
{1,2}
c
{1,4}
d
{2,3}
e
{3,4}
f
{3,4}
.
It has weights on its edges given by λ =
a b c d e f
3 2 1 2 4 2
. How many minimum
spanning trees does it have?Correct
Incorrect