A complete bipartite graph is a one in which each vertex in set X has – McqOptions

MCQOPTIONS

1.	A complete bipartite graph is a one in which each vertex in set X has an edge with set Y. Let n be the total number of vertices. For maximum number of edges, the total number of vertices hat should be present on set X is?
A.	n
B.	n/2
C.	n/4
D.	data insufficient
Answer» C. n/4

Discussion

No Comment Found

Related MCQs

Under what case of Master’s theorem will the recurrence relation of stooge sort fall?
Matrix A is of order 3*4 and Matrix B is of order 4*5. How many elements will be there in a matrix A*B multiplied recursively.
What is the distance between the lines 3x- 4y+7=0 and 3x-4y+5=0?
Cross product of two vectors can be used to find?
What is the auxiliary space complexity of Z algorithm for pattern searching (m = length of text, n = length of pattern)?
Which of the following operation will give a vector that is perpendicular to both vectors a and b?
What is the result of the recurrences which fall under second case of Master’s theorem (let the recurrence be given by T(n)=aT(n/b)+f(n) and f(n)=nc?
Under what case of Master’s theorem will the recurrence relation of merge sort fall?
What will be the slope of the line given by ax + by + c = 0?
What is the average running time of a quick sort algorithm?