GATE CSE
First time here? Checkout the FAQ!
x
0 votes
31 views

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??

asked in Graph Theory by Veteran (13.3k points)   | 31 views

Please log in or register to answer this question.



Top Users Aug 2017
  1. Bikram

    4892 Points

  2. ABKUNDAN

    4704 Points

  3. akash.dinkar12

    3480 Points

  4. rahul sharma 5

    3158 Points

  5. manu00x

    3012 Points

  6. makhdoom ghaya

    2470 Points

  7. just_bhavana

    2382 Points

  8. stblue

    2130 Points

  9. Tesla!

    2066 Points

  10. joshi_nitish

    1758 Points


25,009 questions
32,131 answers
74,801 comments
30,179 users