Title of article
Neighborhood Number in Graphs
Author/Authors
Tahmasbzadehbaee، Z نويسنده , , Soner، N. D نويسنده , , Mojdeh، D. A نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2012
Pages
6
From page
265
To page
270
Abstract
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.
Journal title
The Journal of Mathematics and Computer Science(JMCS)
Serial Year
2012
Journal title
The Journal of Mathematics and Computer Science(JMCS)
Record number
709485
Link To Document