What is the maximum number of edges in a directed graph on n vertices? Explain how you arrived at your solution.
What will be an ideal response?
A complete graph on n vertices has n(n-1)/2 edges. This is the maximum number of edges that an undirected
graph can have. For a directed graph, it is possible to have 2 edges for each pair of vertices, and therefore we multiply the
maximum number of edges in an undirected graph by 2. The result is n(n-1).
You might also like to view...
A ____ contains fields of information about a single entity in the database.
A. character B. database C. field D. record
Briefly describe hos virtualization makes it possible to keep uptime percentage as high as possible.
What will be an ideal response?
When you use Excel to connect to a text file, the _______ Wizard determines whether the data is in a fixed-width format or a delimited format.
A. File B. Open File C. Open Text D. Text Import
?Spam emails do not add to costs because nobody reads them anyways.
Answer the following statement true (T) or false (F)