A graph G is an ordered set of vertices set and edges set. The shortest path length between two points G V u  and G 1   and n  are called eigenvalues of G. The i-th distance energy in G is defined as. This study focuses on determining the distance energy of a graph.

 . Penelitian ini berfokus untuk menentukan energi jarak dari graf kipas. Kata kunci: Energi jarak, graf kipas MA SHULHANY, A AGUSUTRISNO Jurnal TEKNIKA -24 ABSTRACT A graph G is an ordered set of vertices set and edges set. The shortest path length between two points G V u  and