Let \( G = (V, E) \) be a connected graph. A dominating set \( S \) of \( G \) is called a neighborhood connected dominating set (\({ncd-set}\)) if the induced subgraph \( \langle N(S) \rangle \) is connected. The minimum cardinality of an ncd-set of \( G \) is called the neighborhood connected domination number of \( G \) and is denoted by \( \gamma_{nc}(G) \). In this paper, we initiate a study of this parameter.