How does the structure of the implication graph determine whether an instance of 2SAT is satisfiable? There is no strongly connected component that contains both a literal and its negation.

There is no path from any literal to its negation. The strongly connected components form a directed acyclic graph (DAG). There are no strongly connected components.