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??
4272 Points
2994 Points
2804 Points
2608 Points
2254 Points
1514 Points
1344 Points
1262 Points
1258 Points
1016 Points
Gatecse
UGC NET papers