  In this paper, a new concept in graphs namely well-f-coveredness is
introduced. We characterize all graphs with such property, whose maximum
induced forests are of boundary order. Also we prove several propositions
concerning with obtaining large well-f-covered graphs from smaller ones. By the
way, some interesting classes of well-f-covered graphs are characterized.
