  A simple graph G is said to be well-f-covered, whenever any two maximal
induced forest in G be of the same order. In this note, well-f-coveredness of
lexicographic product of two graphs in case where the first component is empty,
is characterized. In cases where the second component is empty, and the second
component is nonempty, a necessary condition is given, and in each one, by an
example, it is shown that the given condition is not sufficient.
