Energi Jarak dari Graf Kipas

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 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.