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??
5396 Points
4230 Points
3952 Points
3086 Points
2564 Points
2318 Points
2240 Points
2008 Points
1696 Points
1684 Points
Gatecse