Abstract Let G be a simple connected graph. The reciprocal transmission Tr′G(ν) of a vertex ν is defined as Tr G ′ ( ν ) = ∑ u ∈ V ( G ) 1 d G ( u , ν ) , u ≠ ν . $${\rm{Tr}}_{\rm{G}}^\prime ({\rm{\nu }}) = \sum\limits_{{\rm{u}} \in {\rm{V}}(G)} {{1 \over {{{\rm{d}}_{\rm{G}}}(u,{\rm{\nu }})}}{\rm{u}} \ne {\rm{\nu }}.} $$ The reciprocal distance signless Laplacian (briefly RDSL) matrix of a connected graph G is defined as RQ(G)= diag(Tr′ (G)) + RD(G), where RD(G) is the Harary matrix (reciprocal distance matrix) of G and diag(Tr′ (G)) is the diagonal matrix of the vertex reciprocal transmissions in G. In this paper, we investigate the RDSL spectrum of some classes of graphs that are arisen from graph operations such as cartesian product, extended double cover product and InduBala product. We introduce minimum covering reciprocal distance signless Laplacian matrix (or briey MCRDSL matrix) of G as the square matrix of order n, RQC(G) := (qi;j), q ij = { 1 + Tr ′ ( ν i ) if i = j and ν i ∈ C Tr ′ ( ν i ) if i = j and ν i ∉ C 1 d ( ν i , ν j ) otherwise $${{\rm{q}}_{{\rm{ij}}}} = \left\{ {\matrix{ {1 + {\rm{Tr}}\prime ({{\rm{\nu }}_{\rm{i}}})} & {{\rm{if}}} & {{\rm{i = j}}} & {{\rm{and}}} & {{{\rm{\nu }}_{\rm{i}}} \in {\rm{C}}} \cr {{\rm{Tr}}\prime ({{\rm{\nu }}_{\rm{i}}})} & {{\rm{if}}} & {{\rm{i = j}}} & {{\rm{and}}} & {{{\rm{\nu }}_{\rm{i}}} \notin {\rm{C}}} \cr {{1 \over {{\rm{d(}}{{\rm{\nu }}_{\rm{i}}},{{\rm{\nu }}_{\rm{j}}})}}} & {{\rm{otherwise}}} & {} & {} & {} \cr } } \right.$$ where C is a minimum vertex cover set of G. MCRDSL energy of a graph G is defined as sum of eigenvalues of RQC. Extremal graphs with respect to MCRDSL energy of graph are characterized. We also obtain some bounds on MCRDSL energy of a graph and MCRDSL spectral radius of 𝒢, which is the largest eigenvalue of the matrix RQC (G) of graphs.