Number of conflict serializable schedules
While checking for conflict serializable schedules, we should be sure to avoid RW, WW, WR conflicts. Also the relative order of operations internal to each transaction also needs to be maintained. For example T1's operations on $X$should come before T1's operations on $Y$. Also since $Y$ is the common datum here, therefore either all of T1's operation on $Y$ occur before T2's $Y$ operations or they may occur later, but they shouldn't be interleaved. 

So let's try to see the number of such serializable schedules:
Here is $T_1$:


  (a)  $r_1(X)$ (b) $w_1(X)$   (c) $r_1(Y)$  (d)  $w_1(Y)$  (e)


Since $Y$ is the common datum so I pick it first from $T_2$.
put $w_2(Y)$ at position (a)


  (a1) $w_2(Y)$ (a2) $r_1(X)$ (b) $w_1(X)$   (c) $r_1(Y)$  (d)  $w_1(Y)$  (e)


We now have two new positions (a1) and (a2). Now, see that $r_2(Y)$ can come only at (a1) since it cannot come after $w_2(Y)$. Now The $Z$ operations of $T_2$ remain. See that they can come at any of the 5 postions starting from (a2) till (e). So for this case, we get total schedules as 

$1 *( \binom{5}{1} + \binom{5}{2}) = 15$

$\binom{5}{1}$ is the case when both $r_2(Z)$ and $w_2(Z)$ come together. $\binom{5}{2}$ is the case when they are separated. Note that $r_2(Z)$ and $w_2(Z)$ have not been permuted to maintain their relative order.
Similarly, you can move $w_2(Y)$ through positions (b) (c) and (e)  (note that (d) is an excluded possibility since interleaving is not allowed) to get $20, 18, 1$ as the answer respectively for each individual case. They sum up to $54$.

In case you need the explanation for all cases, you can look up here.