Neighborhood Number In Graphs
Zahra Tahmasbzadehbaee, N. D. Soner, Doost Ali Mojdeh · Journal of Mathematics and Computer Science · 2012
A set \(S\) of points in graph \(G\) is a neighborhood set if \(G=\cup_{ u\in S}\langle N[ u]\rangle\) where \(\langle N[ u]\rangle\) is the subgraph of \(G\) induced by \( u\) and all points adjacent to \( u\). The neighborhood number, denoted \(n_0(G)\), of \(G\) is the minimum cardinality of a neighborhood set of \(G\). In this paper, we study the neighborhood number of certain graphs.