Answer the following statements true (T) or false (F)
1. A connected graph has an edge between every pair of vertices.
2. A connected graph can have a pair of vertices without an edge between them.
3. Each edge in a graph cannot begin and end at the same vertex.
4. In a digraph, each pair of vertices may be joined by only one edge.
5. The adjacency matrix for an undirected graph is symmetrical.
1. False
2. True
3. True
4. False
5. True
You might also like to view...
Which of the following is NOT a guideline you should follow to avoid damage to circuit boards during installation?
A. leave the card in its protective cover B. be sure you are on a carpeted floor C. disconnect all power to the computer D. touch a grounded part to discharge static
As a security professional, what should you do after identifying that a Web server you are testing is using PHP?
What will be an ideal response?