Title of article
Sharp Upper bounds for Multiplicative Version of Degree Distance and Multiplicative Version of Gutman Index of Some Products of Graphs
Author/Authors
Muruganandam, R Department of Mathematics -Government Arts College,Tiruchirappalli , Manikandan, R.S Department of Mathematics - Bharathidasan University Constituent College - Lalgudi, Tiruchirappalli , Aruvi, M Department of Mathematics - Anna University - Tiruchirappalli, India
Pages
28
From page
1
To page
28
Abstract
In 1994; degree distance of a graph was introduced by
Dobrynin , Kochetova and Gutman. and Gutman proposed
the Gutman index of a graph in 1994: In this paper, we
introduce the concepts of multiplicative version of degree
distance and the multiplicative version of Gutman index of a
graph. We find the sharp upper bound for the multiplicative
version of degree distance and multiplicative version of
Gutman index of cartesian product of two connected graphs.
and we compute the exact value for the cartesian product of
two complete graphs. Using this result, we prove that our
bound is tight. Also, we obtain the sharp upper bound for
the multiplicative version of degree distance and the
Keywords
Topological indices , Vertex degree , Cartesian product and Strong product
Journal title
Astroparticle Physics
Serial Year
2018
Record number
2469371
Link To Document