MCQOPTIONS
Bookmark
Saved Bookmarks
→
Discrete Mathematics
→
Inference in Discrete Mathematics
→
How many edges are there in a complete graph of o..
1.
How many edges are there in a complete graph of order 9?
A.
35
B.
36
C.
45
D.
19
Answer» C. 45
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
Topological sorting of a graph represents _______ of a graph.
The time complexity to find shortest distances by using Dijkstra’s algorithm is __________
The time complexity to find a Eulerian path in a graph of vertex V and edge E is _____________
How many cycles are there in a wheel graph of order 5?
How many edges are there in a complete graph of order 9?
What is a separable graph?
If G is a simple graph with n-vertices and n>=3, the condition for G has a Hamiltonian circuit is __________
A binary cycle space forms a ______ over the two element field.
For an n-vertex undirected graph, the time required to find a cycle is ____________
If two cycle graphs Gm and Gn are joined together with a vertex, the number of spanning trees in the new graph is ______
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply