homomorphic encryption special case of multi party computation? I read that Fully Homomorphic Encryption schemes are special case of  Secure MPC in page no 3. Especially , generalization of two party computation problems stated by Yao 

But is there any additional literature showing the connections of the same ?
You've got the relationship a bit muddled.  A scheme for fully homomorphic encryption can be used to perform secure multi-party computation (MPC).  However, it's not a special case of MPC.

The connection is a standard elementary result, which I will summarize here.  If you want to do secure multi-party computation, you can express the computation as a boolean circuit $C$, and you can easily transform any circuit so that it uses only AND gates and NOT gates.  Then, it turns out that you can compute $C$ on encrypted data, if the data was encrypted using a fully homomorphic encryption scheme, using the following relationship: when working with $\{0,1\}$, AND can be done by multiplication ($x$ AND $y$ $ = xy$), and NOT can be done with addition (NOT($x$) $ = 1-x$).  Since the fully homomorphic encryption lets you do addition, subtraction, and multiplication on encrypted values, it also lets you do NOT and AND on encrypted values, which is all you need to do secure multi-party computation.