A connected undirected graph that has n vertices and exactly n – 1 edges ______.
a) cannot contain a cycle
b) must contain at least one cycle
c) can contain at most two cycles
d) must contain at least two cycles
a.
Computer Science & Information Technology
You might also like to view...
What is meant by "Store data in its smallest parts" when designing database fields?
What will be an ideal response?
Computer Science & Information Technology
Which of the following Internet connection types is probably going to use a coaxial connector?
A. Cable B. DSL C. Fiber D. ISDN
Computer Science & Information Technology