What is the number of edges of the greatest planar subgraph of K3,2 wh – McqOptions

MCQOPTIONS

1.	What is the number of edges of the greatest planar subgraph of K_3,2 where m,n 3?
A.	18
B.	6
C.	128
D.	702
Answer» C. 128

Discussion

No Comment Found

Related MCQs

What is the number of edges of the greatest planar subgraph of K<sub>3,2</sub> where m,n 3?
Suppose G be a connected planar graph of order n 5 and size m. If the length of the smallest cycle in G is 5, then which of the following is true?
If the number of vertices of a chromatic polynomial P<sub>G</sub> is 56, what is the degree of P<sub>G</sub>?
If Cn is the nth cyclic graph, where n>3 and n is odd. Determine the value of X(C<sub>n</sub>).
If a graph G is k-colorable and k<n, for any integer n then it is ___________