On Reducing the Number of Existing Cycles in Connected Graphs Obtained from Comparison Matrices