Abstract :

The neighborhood of a certain vertex u in a simple graph  consists all adjacent vertices of it .denoted by N u  , the binding number of a graph  denoted by B , where B  is the minimum of
N S  S , where S is a proper subset of V  and N S  is the union of N u  for all u in S . In this article, we will investigate and determine the binding number of certain simple graphs by classic
methods, then we will develop a new method using linear algebra to find the binding number of certain simple graphs.