Distance equienergetic graphs of diameter 4

Let Γ 1 , Γ 2 and Γ 3 be graphs with pairwise disjoint vertex sets. The graph Θ ( Γ 1 , Γ 2 , Γ 3 ) is obtained from the graphs Γ 1 ∘ Γ 3 (the corona product) and Γ 2 by joining each vertices of Γ 1 in Γ 1 ∘ Γ 3 with every vertices in Γ 2 . Two connected graphs are called distance equienergetic graphs if their distance energies are the same. Several methods for constructing distance equienergetic graphs have been presented in the literature, most constructed distance equienergetic graphs have diameters of 2 or 3. So the problem of constructing distance equienergetic graphs of diameter greater than 3 would be interesting. Another interesting problem posed by Indulal (2020) is to construct a pair of graphs which are both adjacency equienergetic and distance equienergetic. Motivated by these two problems, in this paper, we obtain the distance spectrum of Θ ( Γ 1 , Γ 2 , Γ 3 ) when all these graphs are regular. As an application, we give a method to obtain distance equienergetic graphs of diameter 4. Also we construct a pair of graphs on 2 n + 1 vertices ( n ≥ 6 ) which are both adjacency equienergetic and distance equienergetic graphs.