MCQOPTIONS
Bookmark
Saved Bookmarks
→
Discrete Mathematics
→
Inference in Discrete Mathematics
→
A complete n-node graph Kn is planar if and only i..
1.
A complete n-node graph Kn is planar if and only if _____________
A.
n ≥ 6
B.
n² = n + 1
C.
n ≤ 4
D.
n + 3
Answer» D. n + 3
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
In Modern particle physics there must exist ______________
There exists _______ between group homology and group cohomology of a finite group.
If any group is a manifold what is the dimension of that group?
In basic ring theory, any ring R1 may be embedded in its own ________
A Latin square graph is a representation of a _______
For any graph say G, Cayley graph is ______________
Which of the following is the set of m×m invertible matrices?
In invariant algebra, some generators of group G1 that goes either into itself or zero under ______ with any other element of the algebra.
Which of the following can be embedded in an algebraically closed group?
If G is the forest with 54 vertices and 17 connected components, G has _______ total number of edges.
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply