###### Question 9768 – Theory-of-Computation

November 19, 2023###### Question 2770 – TCP/IP-Layers

November 19, 2023# Question 5023 – Graph-Theory

**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**

Correct Answer: C

**Question 211 Explanation:**

**Given data,**

— Undirected graph G with 100 nodes.

— Maximum number of edges to be included in G so that the graph is not connected is ?

Step-1: As per the above description, it is simple undirected graph.

For simple graph using formula standard formula is ((n-1)*(n-2))/2

Step-2: Here, n=100

n-1=99

n-2=98

=((n-1)(n-2))/2

= (99*98)/2

= 4851

Note: The simple graph won’t have parallel edges and self loops.

— Undirected graph G with 100 nodes.

— Maximum number of edges to be included in G so that the graph is not connected is ?

Step-1: As per the above description, it is simple undirected graph.

For simple graph using formula standard formula is ((n-1)*(n-2))/2

Step-2: Here, n=100

n-1=99

n-2=98

=((n-1)(n-2))/2

= (99*98)/2

= 4851

Note: The simple graph won’t have parallel edges and self loops.

2451

4950

4851

9900

Subscribe

Login

0 Comments