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??
3660 Points
2576 Points
2040 Points
1966 Points
1768 Points
1614 Points
1610 Points
1464 Points
1440 Points
1426 Points
Gatecse
Step 0: Study the topic/subject. Use Bikram ...
The topics to read :