Let G = (nu(G), epsilon(G)) be an (n, m)-graph. The Randic spread of G, s(R)(G), is defined as the maximum distance of its Randic eigenvalues, disregarding the Randic spectral radius of G. In this work, we use numerical inequalities and bounds for the matricial spread to obtain relations between this spectral parameter and some structural and algebraic parameters of the underlying graph such as, the sequence of vertex degrees, the nullity, Randic index, generalized Randic indices and its independence number. In the last section a comparison is presented for regular graphs. (C) 2018 Elsevier Inc. All rights reserved.