Greatest common divisor degree estrada index of graphs

Abstract

Let G be a simple graph of order n. The greatest common divisor energy EGCD(G)[11] of G is the sum of the absolute values of the greatest common divisor eigen values of M(G) In this paper, we define and investigate the greatest common divisor degree Estrada index of the graph G as EEGCD= EEGCD (G) = and obtain bounds for EEGCD(G) and some relation between EEGCD(G) and EGCD(G).