Let G be a graph. A neighborhub set (n-hub set) S of G is a set of vertices with the property that for any pair of vertices outside of S, there is a path between them with all intermediate vertices in S and G = S Uv?S < ...