Some Parameters on Neighborhood Number of A Graph

A set S ⊆ V is a neighborhood set of G, if G = ⋃ v ∈ S 〈 N [ v ] 〉 , where 〈 N [ v ] 〉 is the sub graph of G induced by v and all vertices adjacent to v. The neighborhood number η ( G ) of G is the minimum cardinality of a neighborhood set of G. In this paper, we extended the concept of neighborhood number and its relationship with other related parameters are explored.