The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
0 votes
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 (16.9k points) | 125 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.7k points)
edited by
With 3 unlabeled nodes possible undirected graphs are 4, but your formula gives 8/6 how?

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

29,138 questions
36,959 answers
34,803 users