Before revision: A directed graph G=(V,E) is twinless strongly connected if it contains a strongly connected  subgraph without any pair of antiparallel (or twin) edges.
After revision: A directed graph G=(V,E) is twinless strongly connected if it contains a strongly connected spanning subgraph without any pair of antiparallel (or twin) edges.