Let G be a connected simple graph with vertex set \(V\left( G \right) \) and edge set \(E\left( G \right) \) . Let \(\Omega \) be a subset of \(V\left( G \right) \) with at least two vertices. A path containing all vertices of \(\Omega \) is said to be an \(\Omega \text{- } \text {path}\) of G. Two \(\Omega \text{- }\) paths \({{P}_{1}}\) and \({{P}_{2}}\) of G are internally disjoint if \(E\left( {{P}_{1}} \right) \cap E\left( {{P}_{2}} \right) =\varnothing \) . For an integer k with \(k\ge 2\) , the \(k \text{- } \text {path} \text{- } \text {connectivity}\) \({{\Pi }_{k}}\left( G \right) \) is defined as \({{\Pi }_{k}}\left( G \right) =\min \left\{ {{\Pi }_{k}}\left( \Omega \right) \left| \, \Omega \subseteq V\left( G \right) \text { and }\left| \, \Omega \right| =k \right. \right\} \) , where \({{\Pi }_{k}}\left( \Omega \right) \) represents the maximum number of internally disjoint \(\Omega \text{- } \text {paths}\) . In this paper, we determine the \(3 \text{- } \text {path} \text{- } \text {connectivity}\) of the \(n \text{- } \text {dimensional}\) folded hypercubes \(F{{Q}_{n}}\) and prove that \(\Pi _3\left( FQ_n \right) =\lfloor \frac{3\left( n+1 \right) -1}{4} \rfloor \text { for }\) all \(n\geqslant 2.\)
