Professional Documents
Culture Documents
Question 1
Correct
Mark 1 out of 1
Select one:
a. Parallel
b. Edge-Endpoint
d. Loop
Question 2
Correct
Mark 1 out of 1
It is a complete Graph where each vertex in one of the subsets is connected by exactly one edge to each vertex in the other subset,
but not to any vertices in its own subset?
Select one:
b. Indegree
c. Bipartite
d. Subgraph
Correct
Mark 1 out of 1
Select one:
a. Root
b. Height
d. Level
Question 4
Correct
Mark 1 out of 1
Select one:
a. Isolated
b. Loop
c. Edge-Endpoint
Correct
Mark 1 out of 1
In a graph, let V = {v1, v2, v3, v4}, and E = {e1, e2, e3, e4}, assuming the endpoints of e1are v1 and v2, the endpoints of e2 are v1 and
v3, the endpoints of e3 are v2 and v3, theendpoint of e4 is v4. What is the loop in the graph?
Select one:
a. e3
c. e2
d. e4
Question 6
Correct
Mark 1 out of 1
Refers to a graph that does not have any loops or parallel edges?
Select one:
a. Simple graph
b. Graph
d. Digraph
Correct
Mark 1 out of 1
Select one:
a. 6
b. 5
d. 4
Question 8
Correct
Mark 1 out of 1
Select one:
b. |E|> |V|
d. |E| ≥ |V|
Correct
Mark 1 out of 1
Select one:
a. Descendants
b. Child
c. Siblings
Question 10
Correct
Mark 1 out of 1
Select one:
a. Right Child
b. Root
c. Left Child
Jump to...