Register

HOW MANY NONISOMORPHIC ROOTED TREES ARE THERE WITH 3 VERTICES(use isomporphism for directed graphs)

494 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
0 answers
1
Piyush Kapoor asked Oct 14, 2015
1,076 views
How many nonisomorphic simple graphs are there with n vertices, when n is a) 2? b) 3? c) 4?
I am unable to get this logic since in both of these algorithms we need to have a record of future requirement of the processes so then why is it that resource allocation graph algorithm is more efficient ?
I am unable to get this logic since in both of these algorithms we need to have a record of future requirement of the processes so then why is it that resource allocation...
User Avatar
0 votes
0 votes
0 answers
2
santhoshdevulapally asked Nov 12, 2016
414 views
HOW MANY NONISOMORPHIC UNROOTED TREES ARE THERE WITH 3 VERICES
User Avatar
6 votes
6 votes
2 answers
3
monali asked Nov 2, 2015
5,463 views
no of different rooted labeled trees with n vertices ?
User Avatar
Link Copied!