https://gateoverflow.in/931/gate2003-40 IN THE SOLUTION AT LAST 3 STATEMENTS 0≤−6. which is definitely inconsistent. Hence, answer = option (D) WE PUT 6 HERE THEN IF WE DONT HAVE VALUES MEANS FILL IN THE BLANKS THEN.............. IS THERE ANY METHOD TO SOLVE THIS OR ANYTHING ??????
What is converse of a graph?
DIRAC'S THEOREM: If G is a simple graph with n vertices with n ≥ 3 such that the degree of every vertex in G is at least n/2, then G has a Hamilton circuit. The below graph does not follow the above rule but still have a Hamilton circuit.
Find the number of connected Eulerian graphs with 6 unlabelled vertices. Draw each of them. Note: I'm looking for a fast procedure don't comment just the numerical answer.
For a complete graph with 10 vertices, The number of spanning trees is at least_____?
Minimum no of edges necessary in a simple graph with 10 vertices to ensure connectivity is_______.
Number of perfect matching in Wn (n>=4 and n is even) _________.
I think ans is option C , But will anybody explain the notation used in option D ?
A simple graph with n vertices is constructed by randomly and independently placing an edge between every two vertices with probability p. What is the expected no. of nodes with degree 2?
10.A graph G has any two vertices connected by exactly one path. Find the Number of ways we can properly colour G it we are provided with 10 colours.
Let G be a graph with 100! vertices, with each vertex labelled by a distinct permutation of the numbers 1,2,…,100. There is an edge between vertices and if and only if the label of can be obtained by swapping two adjacent numbers in the label of . Let denote the degree of a vertex in G, and denote the number of connected components in G. Then, y + 10z = _____.
in a rooted tree if we are asked to find the level of root then it should be 0 or 1 or question depending ??
Is it necessary that euler graph should always be simple graph?