设无向图G中顶点数为n,图G最多( )有条边。 A: nB: n-1C: n*(n-1)/2D: n*(n-1)
设无向图G中顶点数为n,图G最多( )有条边。
A: n
B: n-1
C: n*(n-1)/2
D: n*(n-1)
相关考题:
如果无向图G=(V,E)是简单图,并且|V|=n>0,那么图G最多包含多少条边? If undirected graph G = (V,E) is simple graph, and |V| = n > 0, then how many edges can graph G contains at most?(There is only one correct answer)
5、5.设无向图G中顶点数为n,则图G至少有()条边。