Register

HOW MANY NONISOMORPHIC UNROOTED TREES ARE THERE WITH 3 VERICES

412 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
2
Piyush Kapoor asked Oct 14, 2015
1,075 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
5 votes
5 votes
2 answers
3
Sanjay Sharma asked Mar 7, 2017
47,422 views
How many transitive relations are there on a set with n elements if a)n=1   b) n=2  c) n=3
How many transitive relations are there on a set with n elements if a)n=1 b) n=2 c) n=3
How many transitive relations are there on a set with n elements ifa)n=1 b) n=2 c) n=3
User Avatar
Link Copied!