超星 - 8 图的连通性

单选题

In which of the following cases, a simple graph G(p,q) must be a connected graph

A. q=8，p=6
B. q=4，p=4
C. q=5，p=5
D. q=7，p=6

多选题

Which of the following statements about graph connectivity are true:

A. The necessary and sufficient conditions for G is connected: G has only one connected component.
B. The necessary and sufficient conditions for u and v are connected: u and v are in the same connected component.
C. If there are exactly two vertices of odd degrees in the graph, they are connected.
D. All the connected componentof a graph make up of one of its partitions.

查看答案

判断题

If there are two different walks from u to v in simple graph G, there must be a loop in the graph.

A. 对
B. 错

查看答案

判断题

If there are two different paths from u to v in simple graph G, there must be a loop in the graph.

A. 对
B. 错

查看答案