GATE CSE
First time here? Checkout the FAQ!
x
0 votes
97 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 (14.6k points)   | 97 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.3k points)  
edited by
With 3 unlabeled nodes possible undirected graphs are 4, but your formula gives 8/6 how?


Top Users Apr 2017
  1. akash.dinkar12

    3660 Points

  2. Divya Bharti

    2580 Points

  3. Deepthi_ts

    2040 Points

  4. rude

    1966 Points

  5. Tesla!

    1768 Points

  6. Debashish Deka

    1614 Points

  7. Shubham Sharma 2

    1610 Points

  8. Prashant.

    1492 Points

  9. Arunav Khare

    1464 Points

  10. Arjun

    1464 Points

Monthly Topper: Rs. 500 gift card

22,086 questions
28,062 answers
63,294 comments
24,160 users