0 votes
241
Find the integer value of x satisfying the inequality$\binom{10}{x-1} < 2\binom{10}{x}$ .
0 votes
243
every vertex has a minimum degree, therefore, least number of edges that will be in the graph is given by the handshaking lemma as = min×|v|/2=2 E is right?
2 votes
244
In a Bipartite graph,the size of the maximum matching is equal to the size of the minimum vertex cover ...can somebody prove this logically ?
1 votes
245
Determine all non- isomorphic graphs with the number of vertices 20 and edges 188.
0 votes
249
The total number of planar graphs can be formed with 5 vertices are _____
0 votes
250
A sequence d = is graphic if there is a simple non-directed graph with degree sequence d then which one of the following sequences is graphic?a) (2, 3, 3, 4, 4, 5) b) (1,...
0 votes
251
A graph G has k isolated vertices and n + k vertices. The maximum number of edges graph G can have?a) n(n-1) b)n(n-1)/2) c) n(n-k+1)/2 d) n(n+k-1)/2
0 votes
252
What should be the maximum lenght of path consisting of n veritces ?Is, it should be n or n-1.
0 votes
253
What is the highest power of $18$ contained in $50C25$?
0 votes
255
9 votes
256
How dual and complement different from each other
1 votes
257
If a vertex of a triangle is (1, 1) and the mid-points of two sides through this vertex are (-1, 2) and (3, 2), then the centroid of the triangle is(A) $(-1, 7/3)$(B) $(-...
1 votes
258
OS that permits multiples programs to run simultaneously using single processor is referred as(a) Multitasking(b) Multi user(c) Multithreading(d) Multiprocessing
0 votes
259
for(i=0;i<n;i++) { //printf("enter process name: %d:",i+1); //gets(p[i]); printf("enter burst time of %d:",i+1); scanf("%d\n",&bt[i]); }why input not reading from 2 time ...
0 votes
262
plz someone explain.........
3 votes
264
The boolean expression $\text{AB + A}\text{B}'+\text{A}'\text{C + AC}$ is independent of the boolean variable$\text{A}$$\text{B}$$\text{C}$None of these