I read in http://gateoverflow.in/28955/given-vertex-edges-how-find-non-isomorphic-graphs-possible question explanantion,it was written that e=2n-3 where e= number of edges and n is no of vertices.
how is it derived??can anyone tell me the source??
23346 Points
17058 Points
8142 Points
6254 Points
5438 Points
4968 Points
4772 Points
4298 Points
3964 Points
3794 Points
Gatecse
X->YZ , Y->XZ , ...