adplus-dvertising
frame-decoration

Question

Consider an undirected graph G with 100 nodes. The maximum number of edges to be included in G so that the graph is not connected is

a.

2451

b.

4950

c.

4851

d.

9900

Answer: (c).4851

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Consider an undirected graph G with 100 nodes. The maximum number of edges to be included in G so that the graph is not connected is

Similar Questions

Discover Related MCQs

Q. The amortized time complexity to perform ............. operation(s) in Splay trees is O(Ig n).

Q. The number of eight-bit strings beginning with either 111 or 101 is ...............

Q. Find the number of ways to paint 12 offices so that 3 of them will be green, 2 of them pink, 2 of them yellow and the rest ones white.

Q. How many people must there be in a room before there is a 50% chance that two of them were born on the same day of the year ?

Q. The number of possible parenthesizations of a sequence of n matrices is

Q. The relation "divides" on a set of positive integers is ..................

Q. A test contains 100 true/false questions. How many different ways can a student answer the questions on the test, if the answer may be left blank also.

Q. Which of the following connected simple graph has exactly one spanning tree?

Q. How many edges must be removed to produce the spanning forest of a graph with N vertices, M edges and C connected components?

Q. The solution of recurrence relation, T(n) = 2T(floor (√n)) + logn is

Q. The upper bound of computing time of m coloring decision problem is

Q. Which one of the following statements is incorrect ?

Q. Consider a weighted undirected graph with positive edge weights and let (u, v) be an edge in the graph. It is known that the shortest path from source vertex s to u has weight 53 and shortest path from s to v has weight 65. Which statement is always true ?

Q. In any simplex table, if corresponding to any negative Dj, all elements of the column are negative or zero, the solution under the test is

Q. Let a * H and b * H be two co-sets of H.

(i) Either a * H and b * H are disjoint
(ii) a * H and b * H are identical

Then,

Q. Domain and Range of the function
Y = –√(–2x + 3) is

Q. Maximum number of edges in a n-Node undirected graph without self loop is

Q. What is the probability of choosing correctly an unknown integer between 0 and 9 with 3 chances?

Q. Any integer composed of 3^n identical digits divisible by

Q. The circumferences of the two concentric disks are divided into 100 sections each. For the outer disk, 100 of the sections are painted red and 100 of the sections are painted blue. For the inner disk, the sections are painted red and blue in an arbitrary manner. It is possible to align the two disks so that …………… of the sections on the inner disks have their colours matched with the corresponding section on outer disk.