Answer the following statements true (T) or false (F)
1. Adjacent vertices are joined by an edge.
2. A simple path may pass through the same vertex more than once.
3. All paths begin and end at the same vertex.
4. A simple cycle only passes through one vertex.
5. All complete graphs are connected.
1. True
2. False
3. False
4. False
5. True
Computer Science & Information Technology
You might also like to view...
What is the maximum number of simultaneous users that can access a Windows 7 share?
A) 20 B) 45 C) 60 D) 8 E) 10
Computer Science & Information Technology
A flaw in a program is often referred to as a(n) ________.
a) bug b) worm c) virus d) easter egg
Computer Science & Information Technology