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
This note was uploaded on 12/10/2011 for the course MAD 4204 taught by Professor Vetter during the Spring '11 term at University of Florida.
 Spring '11
 Vetter

Click to edit the document details