The graph $G_σ$ is obtained from graph $G$ by attaching self loops on $σ$ vertices. The energy $ E(G_σ)$ of the graph $G_σ$ with order $n$ and eigenvalues $λ_1,λ_2,\dots,λ_n$ is defined as $ E(G_σ)= \displaystyle \sum_{i=1}^n\left|λ_i-\dfracσ{n}\right| $. It has been proved that if $σ=0\; or\; n$ then $ E(G)=E(G_σ) $. The obvious question arise: Are there any graph such that $E(G)=E(G_σ)$ and 0$<σ<n$? We have found an affirmative answer of this question and contributed a graph family which satisfies this property.