Motivated by questions arising in the study of asynchronous iterative methods for solving linear systems, we consider the spectral radius of products of certain one cycle matrices. The spectral radius of a matrix in our class is a monotonic increasing function of the length of the cycle of the matrix, but this is known to be false for products of such matrices. The thrust of our investigation is to determine sufficient conditions under which the spectral radius of the product increases (decreases) when the lengths of the cycles of the factors increase (decrease). We also find sufficient conditions for the spectral radius of the product to be independent of the order of the factors. Our chief tool is an auxiliary directed weighted graph whose cycle means determine the eigenvalues of the matrix product, and our main results are stated in terms of the maximal cycle mean of this graph.