26
Multiple choices 26/50
Answer (Choose 1 answer)
Consider the following 2 definitions about graph:
An undirected graph is called connected when there is a path between any two vertices of the graph.If every node u in undirected graph G is adjacent to every other node v in G, A graph is said to be complete.Which of the following statements is correct:
A. The connected graph is always complete.
B. The complete graph is always connected.
C. The complete graph is always connected and vise versa.
D. None of others
Next
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45 46
47
48
49
50