Answer the following questions true (T) or false (F)
1. A connected graph has an edge between every pair of vertices.
2. In a digraph, there can be only one edge between a pair of vertices.
1. False.
2. False.
Computer Science & Information Technology
You might also like to view...
How many times will the following code print "Welcome to Java"?
int count = 0; while (count++ < 10) { System.out.println("Welcome to Java"); } a. 8 b. 9 c. 10 d. 11 e. 0
Computer Science & Information Technology
What is an abstract class?
What will be an ideal response?
Computer Science & Information Technology