The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
206 views
How many total Homeomorphically Irreducible Trees are possible with 'n' nodes ?
in Graph Theory by Boss (14.4k points) | 206 views
+1
matt damon solved this question in Good will hunting ;)
0
Yeah bro,  you recognized the movie :p... But he solved for n =10..here I m asking that is there any generalized formula for it .
0
I'll try after some time. :p

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,092 questions
55,239 answers
190,757 comments
85,992 users