Open AccessSome Bounds on Greatest Common Divisor Degree Estrada Index of Graphs
Author(s) -
K. Nagarajan,
Ritvik Ramkumar
Publication year - 2019
Publication title -
international journal of engineering and advanced technology
Language(s) - English
Resource type - Journals
ISSN - 2249-8958
DOI - 10.35940/ijeat.a1197.1291s419
Subject(s) - mathematics , degree (music) , combinatorics , divisor (algebraic geometry) , index (typography) , graph , discrete mathematics , greatest common divisor , exponential function , computer science , mathematical analysis , physics , world wide web , acoustics
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.