Neighborhood Number in Graphs

A set S of points in graph G is a neighborhood set if G= U V?S N[V] where N[v] is the subgraph of G induced by v and all points adjacent to v. The neighborhood number, denoted n0(G), of G is the minimum cardinality of a neighborhood set of G. In this paper, we study the neighborhood number of certain graphs.