![Sample our Mathematics & Statistics journals, sign in here to start your FREE access for 14 days]({"type":"image" , "src" : "/sda/5943/TOC-Subject-Sample-2021-Mathematics-Statistics.jpg"})
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).
Subject Classification:
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
To request a reprint or corporate permissions for this article, please click on the relevant link below:
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
Obtain permissions instantly via Rightslink by clicking on the button below:
If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.
