MCQOPTIONS
Bookmark
Saved Bookmarks
→
Discrete Mathematics
→
Inference in Discrete Mathematics
→
An n-vertex graph has ______ edges...
1.
An n-vertex graph has ______ edges.
A.
n2
B.
n-1
C.
n*n
D.
n*(n+1)/2
Answer» C. n*n
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
What is a bipartite graph?
A graph which consists of disjoint union of trees is called ______
Two labeled trees are isomorphic if ____________
A linear graph consists of vertices arranged in a line.
In an n-ary tree, each vertex has at most ______ children.
The tree elements are called __________
A polytree is called _______________
What is a star tree?
An n-vertex graph has ______ edges.
An undirected graph G which is connected and acyclic is called ____________
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply