MCQOPTIONS
Saved Bookmarks
| 1. |
A connected network of N > 2 nodes has at most one branch directly connecting any pair of nodes. The graph of the network |
| A. | must have at least N branches for one or more closed paths to exist |
| B. | can have an unlimited number of branches |
| C. | can only have at most N branches |
| D. | can have a minimum number of branches not decided by N. |
| Answer» E. | |