Let
be a simple connected graph. The reciprocal distance spectrum of
is the multiset of reciprocal distance eigenvalues of
. The Indu-Bala product
of two graphs
and
is obtained from two disjoint copies of the join
of
and
by joining the corresponding vertices in the two copies of
. In this paper we obtain the reciprocal distance spectrum of
in terms of adjacency eigenvalues of
and
. We also construct infinitely many non-isomorphic pairs of reciprocal distance equienergetic graphs and reciprocal distance cospectral graphs of diameter
.



