A graph G is bipartite iff _____.
A. it contains no even length cycle
B. it contains no odd length cycle
C. it contains no cycle
查看答案
b) There is not a minimum spanning tree of $G$ that doesn’t contain the edge $e$.
A. 正确
B. 错误
Decide whether you think the following statements are true or false.Let $G$ be an arbitrary connected, undirected graph with a distinct cost on every edge. Suppose $e$ is the cheapest edge in $G$. Then,a) There is a minimum spanning tree of $G$ that contains the edge $e$.
A. 正确
B. 错误
$f=\Omega(g)\ $ and $g=\Omega(h)$, then $f=\ $_____.
A. $O(h)$
B. $\Omega(h)$
C. $\Theta(h)$
For every $r>1$, $r^n=$_____.
A. $O(n^2)$
B. $\Omega(\sqrt n)$
C. $\Theta(n^r)$