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??
3704 Points
1502 Points
1481 Points
1432 Points
1402 Points
1226 Points
1222 Points
1168 Points
1164 Points
296 Points
214 Points
208 Points
156 Points
130 Points
Gatecse