Register

How to Calculate No of Simple graph with labelled vertices?

• recategorized by
714 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · master slave ffNext → · Test Book
← Previous in category · Gate CSNext in category → · Space complexity
Position:
Show:

Related questions

1 1 vote
0 0 answers
3.0k
3.0k views
Ayush Upadhyaya asked Jun 6, 2018
2,963 views
Number of distinct cycles of length 4 in a complete graph of 6 labelled vertices.
This is in reference to the below questionhttps://gateoverflow.in/473/gate2012-38My doubt here isIn this question, we can also solve like first we select 4 vertices out o...
0 0 votes
0 0 answers
981
981 views
iarnav asked Apr 19, 2018
981 views
#Algorithms How many cuts are possible are in a graph with n nodes?
Some say answer is 2n and someplace else it's been told 2n-1-1. So, what's the corrent one?
0 0 votes
0 0 answers
870
870 views
iarnav asked May 13, 2018
870 views
#Algorithms #DFS How to find if a directed graph G is strongly connected using DFS in one pass?
I know, Kosaraju algorithm and there's one other algorithm which involves reversing of G and using DFS, but two times, but there's some algorithm which uses DFS only time...
0 0 votes
1 1 answer
3.2k
3.2k views
adarsh shivhare asked Dec 30, 2017
3,223 views
no of simple graph possible with 6 vertices and 4 edges is ?