What are the total no. of graphs(undirected) that can be formed using n nodes?
JIGYASA
JIGYASA
An online placement forum.
Graph Theory
2 posters
Message [Page 1 of 1]
2 n(n-1)/2. Sat Mar 13, 2010 2:09 am
indranil
n(n-1)/2. It is actually the sum of (n-1) + (n-2) + ... + 3 + 2 + 1 + 0.
4 Re: Graph Theory Wed Mar 17, 2010 10:22 pm
indranil
oops sorry ... n(n-1)/2 are the possible number of edges. Clearly, the number of graphs are 2^(n(n-1)/2)
Message [Page 1 of 1]
Similar topics
Permissions in this forum:
You cannot reply to topics in this forum
|
|
|