GATE CSE
First time here? Checkout the FAQ!
x
0 votes
78 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 (11.7k points)   | 78 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 Jan 2017
  1. Debashish Deka

    8322 Points

  2. sudsho

    5166 Points

  3. Habibkhan

    4718 Points

  4. Vijay Thakur

    4468 Points

  5. Bikram

    4420 Points

  6. saurabh rai

    4212 Points

  7. Arjun

    4072 Points

  8. santhoshdevulapally

    3732 Points

  9. Sushant Gokhale

    3514 Points

  10. GateSet

    3336 Points

Monthly Topper: Rs. 500 gift card

19,158 questions
24,065 answers
52,872 comments
20,288 users