reopened by
498 views

2 Answers

0 votes
0 votes
The three graph will be 3 connected components of some disconnected graph with n nodes.Now The no of possible way  will be no of possible solution of the equation g1+g2+g3=n.

and it will be n+2Cn

Related questions

0 votes
0 votes
4 answers
2
Rohit Gupta 8 asked Nov 29, 2017
1,676 views
What is the number of ways to distribute ten identical sweets to three children?If each children gets at least one sweet.If 1 condition is omitted.P.S. I do not know the ...
3 votes
3 votes
2 answers
3