1,281 views
0 votes
0 votes
What is the general formula for  number of  simple graph having n unlabelled vertices ??

2 Answers

1 votes
1 votes
For "n" vertices we have  ways "n ! " to label them and for each way we have among n! Labelling we have 2^ (n(n-1) / 2 ) graphs so the answer is

N! (2 ^ (N (N-1)/ 2 )  total unlabelled graph where N is total no. of vertices

Related questions

0 votes
0 votes
1 answer
1
ronin_codex asked Jul 17, 2018
447 views
A simple graph with n vertices is constructed by randomly and independently placing an edge between every two vertices with probability p. What is the expected no. of nod...
0 votes
0 votes
1 answer
2
Anand67222 asked Oct 14, 2023
302 views
How many simple directed (unweighted) graphs on the set of vertices {v0,v1,…v5} are there that have at most one edge between any pair of vertices? (That is, for two ver...
0 votes
0 votes
1 answer
3
gagan55 asked Jun 30, 2023
177 views
Number of hamiltonian cycles for a graph K 5, 5( bipartite graph ) ??