Social Sciences, asked by sameer90431, 1 year ago

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
(1) 2451
(2) 4950
(3) 4851
(4) 9801

Answers

Answered by Anonymous
2

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

(1) 2451

(2) 4950✔️✔️✔️

(3) 4851

(4) 9801

Answered by ItzSammy
1

Hola !!

●4950 is the maximum number of edges to be included in G so that the graph is not connected.

Hope this helps you ___!!

Similar questions