TY - JOUR
ID - 7989
TI - Sharp Upper bounds for Multiplicative Version of Degree Distance and Multiplicative Version of Gutman Index of Some Products of Graphs
JO - Journal of Algorithms and Computation
JA - JAC
LA - en
SN - 2476-2776
AU - Muruganandam, R.
AU - Manikandan, R.S.
AU - Aruvi, M.Aruvi
AD - Department of Mathematics, Government Art College,Tiruchirappalli
AD - Department of Mathematics, Bharathidasan University Constituent College, Lalgudi, Tiruchirappalli
AD - Department of Mathematics, Anna University, Tiruchirappalli, India
Y1 - 2018
PY - 2018
VL - 50
IS - 1
SP - 1
EP - 28
KW - Topological indices
KW - Vertex degree
KW - Cartesian product and Strong product
DO - 10.22059/jac.2018.7989
N2 - 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 multiplicative version of Gutman index of strong product of connected and complete graphs. And we observe the exact value for the strong product of two complete graphs. From this, we prove that our bound is tight.
UR - https://jac.ut.ac.ir/article_7989.html
L1 - https://jac.ut.ac.ir/article_7989_356861646605b630fbf9fe3d6c43283b.pdf
ER -