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).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Discrete Mathematical Sciences and Cryptography
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
