how how to reduce an arbitrary instance of the split graph recognition problem into an

instance of Boolean Satisfiability $($SAT$).($Remember that, per the problem specifications, your clauses

must be in conjunctive normal form.$)$ Hint: you will want to introduce a single variable for each vertex

of the graph.