This preview shows page 1. Sign up to view the full content.
Unformatted text preview: 4 The permutation graph (also sometimes called the inversion graph ) of the permutation of length n , denoted G , is the graph on n where i j if and only if i j and i j . Prove that is sum indecomposable if and only if G is connected....
View Full
Document
 Spring '11
 Vetter

Click to edit the document details