Some Bounds on Greatest Common Divisor Degree Estrada Index of Graphs
K. Nagarajan1, R. S. Ram Kumar2
1K. Nagarajan, Department of Mathematics, Kalasalingam University, Krishnankoil (Tamil Nadu), India.
2R. S. Ram Kumar, Department of Mathematics, Sri S.Ramasamy Naidu Memorial College, Sattur (Tamil Nadu), India.
Manuscript received on 24 November 2019 | Revised Manuscript received on 18 December 2019 | Manuscript Published on 30 December 2019 | PP: 715-717 | Volume-9 Issue-1S4 December 2019 | Retrieval Number: A11971291S419/19©BEIESP | DOI: 10.35940/ijeat.A1197.1291S419
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (

Abstract: Let be a simple graph of order In this paper we find some bounds on Greatest Common Divisor Degree Estrada Index of the graph by using mathematical inequalities interms of G.C.D. degree Index of graphs and exponential terms.
Keywords: G.C.D. Degree Energy, G.C.D. Degree Estrada Index, G.C.D. Degree Spectral Radius, G.C.D. Degree Indexof Graphs.
Scope of the Article: Cryptography and Applied Mathematics