In [1]} it is shown that STREE in general graphs is in FPT if the parameter is the size of the terminal set.
It is known [2]} that STREE in general graphs with parameter \(|S|\)  (solution size) is W[2]-hard. We strengthen the result of [2]} by proving that the Steiner tree problem on split graphs is still W[2]-hard with the parameter being the solution size.
Further, the parameterized Steiner tree problem is in FPT, when parameters are
