293 views
0 0 votes

https://gateoverflow.in/510/gate1991-01-xv

 

IN THIS QUESTION I AM SOLVING LIKE THIS WE HAVE K COMPONENTS 1,2,3,.................K

EACH OF WHICH HAVE N1,N2,N3,.................NK VERTICES

SO TOTAL NUMBER OF EDGES ARE N1(N1-1)/2 +N2(N2-1)/2...................NK(NK-1)/2

SO AT SOMEWHERE IN STEPS I REACHED TO 1/2((-N)+N12+N22.......NK2))

NOT GETTING FURTHER FROM HERE ..................

Please log in or register to answer this question.

Position:
Show:

Related questions

0 0 votes
1 answers 1 answer
584
584 views
Anand67222 asked Oct 14, 2023
584 views
How many simple directed (unweighted) graphs on the set of vertices {v0,v1,…v5} are there that have at most one edge between any pair of vertices? (That is, for two verti...
0 0 votes
1 answers 1 answer
478
478 views
gagan55 asked Jun 30, 2023
478 views
Number of hamiltonian cycles for a graph K 5, 5( bipartite graph ) ??
0 0 votes
1 answers 1 answer
2.4k
2.4k views
Abhrajyoti00 asked Jul 21, 2022
2,373 views
How to determine for which m, n the complete bipartite graph $Km,n$ is planar?I am getting two answers from two sources:-A complete bipartite graph $Kmn$ is planar if and...
0 0 votes
2 answers 2 answers
2.4k
2.4k views
anon1 asked Jan 5, 2022
2,406 views
Both euler path and euler circuit can be present in a graph ?