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??
3154 Points
1636 Points
1600 Points
1360 Points
1322 Points
1262 Points
1132 Points
1044 Points
900 Points
710 Points
408 Points
262 Points
236 Points
234 Points
138 Points
Gatecse
@sushmita Yes, BITS Pilani is really nice. I ...
yeah, the list will be divided into 3 equal ...