<p>A graph is distance magic if it admits a bijective labeling of its vertices by integers from 1 up to the order of the graph in such a way that the sum of the labels of all the neighbors of a vertex is independent of a given vertex. We introduce the concept of a self-reverse distance magic labeling of a regular graph which allows for a more compact description of the graph and the labeling in terms of the corresponding quotient graph. We show that the members of several known infinite families of tetravalent distance magic graphs admit such labelings. We present a novel general construction producing a new distance magic graph from two existing ones. Using it we show that for each integer <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(n \ge 6\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>≥</mo> <mn>6</mn> </mrow> </math></EquationSource> </InlineEquation>, except for the odd integers up to 19, there exists a connected tetravalent graph of order <i>n</i> admitting a self-reverse distance magic labeling. We also determine all connected tetravalent graphs up to order 30 admitting a self-reverse distance magic labeling. The obtained data suggests a number of natural interesting questions giving several possibilities for future research.</p>