Finding stable sets from a graph

Question

I am trying to understand what a stable set is and have the following graph:

What are examples of a stable set from this graph? If possible, what is the maximum stable set of this graph?

My current understanding of a stable set if that its a set of connected vertices where no two are adjacent. Would NBJ therefore be a stable set, as they are connected and not next to each other?

Answer 1

I don't know what you mean by "a set of connected vertices". A stable set (independent set) is simply a set of pairwise nonadjacent vertices. For example, in the given graph, $\{A, C, D, E, F, G, H, J, K, L, M, N, Q, S, T\}$ is a largest independent set.