information:extraction, stylistic:style_transfer, structural:summarization
Twisting

Consider two disjoint graphs G 1 {\displaystyle G_{1}} and G 2 {\displaystyle G_{2}}, where G 1 {\displaystyle G_{1}} contains vertices u 1 {\displaystyle u_{1}} and v 1 {\displaystyle v_{1}} and G 2 {\displaystyle G_{2}} contains vertices u 2 {\displaystyle u_{2}} and v 2 {\displaystyle v_{2}}. Suppose we can obtain the graph G {\displaystyle G} by identifying the vertices u 1 {\displaystyle u_{1}} of G 1 {\displaystyle G_{1}} and u 2 {\displaystyle u_{2}} of G 2 {\displaystyle G_{2}} as the vertex u {\displaystyle u} of G {\displaystyle G} and identifying the vertices v 1 {\displaystyle v_{1}} of G 1 {\displaystyle G_{1}} and v 2 {\displaystyle v_{2}} of G 2 {\displaystyle G_{2}} as the vertex v {\displaystyle v} of G {\displaystyle G}. In a twisting G ′ {\displaystyle G'} of G {\displaystyle G} with respect to the vertex set { u, v } {\displaystyle \{u,v\}}, we identify, instead, u 1 {\displaystyle u_{1}} with v 2 {\displaystyle v_{2}} and v 1 {\displaystyle v_{1}} with u 2 {\displaystyle u_{2}}.