GATE CSE
First time here? Checkout the FAQ!
x
0 votes
109 views
When say that with n vertices there are total 2^(n(n-1)/2) connected/disconnected graph possible, in this case we are assuming that vertices are labelled, right??

 

Is there any formula to count number of connected/disconnected graphs possible with n unlabeled vertices?
asked in Graph Theory by Veteran (15.4k points)   | 109 views

1 Answer

–2 votes
The # of labeled undirected graphs : 2^(n(n-1)/2)

The # of labelled directed graphs : 2^(n(n-1))
answered by Active (1.4k points)  
edited by
With 3 unlabeled nodes possible undirected graphs are 4, but your formula gives 8/6 how?


Top Users Sep 2017
  1. Habibkhan

    6334 Points

  2. Warrior

    2202 Points

  3. Arjun

    2150 Points

  4. nikunj

    1980 Points

  5. manu00x

    1726 Points

  6. SiddharthMahapatra

    1718 Points

  7. Bikram

    1706 Points

  8. makhdoom ghaya

    1650 Points

  9. A_i_$_h

    1518 Points

  10. rishu_darkshadow

    1512 Points


25,978 questions
33,554 answers
79,344 comments
31,011 users