Let \(H=(V,E)\) be a hypergraph. A subset \(S \subseteq V\) is called \(\mathcal {F}\) -isolating of H if the induced subhypergraph \(H[V\backslash N[S]]\) contains no any member in \(\mathcal {F}\) as a subhypergraph. The \(\mathcal {F}\) -isolation number of H is the minimum cardinality of an \(\mathcal {F}\) -isolating set of H, denoted by \(\iota (H,\mathcal {F})\) . A subset \(S\subseteq V\) is an isolating set of H if \(V\backslash N[S]\) is an independent set of H. The cardinality of a minimum isolating set of H is called the isolation number of H, denoted by \(\iota (H)\) . In this paper, we introduce the \(\mathcal {F}\) -isolating set of hypergraphs and give some results about the \(\mathcal {F}\) -isolation number of hypergraphs.
