MCQOPTIONS
Bookmark
Saved Bookmarks
→
Data Structures and Algorithms
→
Evaluation Infix Expression Not Parenthesized
→
The number of edges in a simple, n-vertex, complet...
1.
The number of edges in a simple, n-vertex, complete graph is
A.
n*(n-2)
B.
n*(n-1)
C.
n*(n-1)/2
D.
n*(n-1)*(n-2)
Answer» D. n*(n-1)*(n-2)
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
The spectrum of a graph is _______ if and only if it is _______ graph.
Every complete bipartite graph must not be _______
All closed walks are of ______ length in a bipartite graph.
Bipartite graphs are used in ________
In a complete bipartite graph, the intersection of two sub graphs is ______
What is the maximum number of edges in a bipartite graph on 14 vertices?
The partition V = V1 ∪ V2 in a bipartite graph G1 is called ________
The time complexity to test whether a graph is bipartite or not is said to be _______ using depth first search.
In a ______ the degree of each and every vertex is equal.
The maximum number of edges in a bipartite graph on 14 vertices is ___________
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply
Your experience on this site will be improved by allowing cookies. Read
Cookie Policy
Reject
Allow cookies