Given an undirected graph $G = (V,E)$ an independent set is a subset of nodes $U  V$, such that no two nodes in U are adjacent.In the independent set problem, $G = (V,E)$  is an undirected graph, $k \in \mathbb N_{>0}$ and we need to decide, if there is an independet set with $|I| = k$. I want to determine the language $L_P$ which is related to this decision problem.
determine the language of the independent set problem
formal languages;decision problem