Abstract: A neighbourhood set S of a graph is a non-split neighbourhood set if
the induced subgraph is connected. The non-split
neighbourhood number of G
is the minimum cardinality of the non-split neighbourhood set. In this paper,
some properties of this new parameter are developed.