I came across with a definition for the "binding number" of a graph as below. $G$ is a graph and $V(G)$ is the vertex set of graph $G$.
There it is mentioned as "min". Does that mean the minimum possible case because there can be vertices where the neighbourhood may overlap with each other? Which elements should be chosen for the set S?
Note: $N(S)$ is the open neighbourhood and a vertex of $S$ might or might not be in $N(S)$.
Can some one please guide me to find the binding number of the Petersen graph?
Which vertices should be chosen to the set S out of the vertices labelled as in the above figure and how to take the elements of $N(S)$?
The link to the article I'm referring is: https://ac.els-cdn.com/S0012365X11001981/1-s2.0-S0012365X11001981-main.pdf?_tid=c520ed95-dcda-4ff0-9514-e6d2d0c5d317&acdnat=1543336951_1d736cd5f428e19ddaaf90a714bd825d
Thanks a lot in advance.