in this paper, the degree distance and the gutman index of the corona product of two graphs are determined. using the results obtained, the exact degree distance and gutman index of certain classes of graphs are computed.

‎the gutman index and degree distance of a connected graph $g$ are defined as‎ ‎begin{eqnarray*}‎ ‎textrm{gut}(g)=sum_{{u,v}subseteq v(g)}d(u)d(v)d_g(u,v)‎, ‎end{eqnarray*}‎ ‎and‎ ‎begin{eqnarray*}‎ ‎dd(g)=sum_{{u,v}subseteq v(g)}(d(u)+d(v))d_g(u,v)‎, ‎end{eqnarray*}‎ ‎respectively‎, ‎where‎ ‎$d(u)$ is the degree of vertex $u$ and $d_g(u,v)$ is the distance between vertices $u$ and $v$‎. ‎in th...

Abstract We initiate a study of the Euclidean distance degree in context sparse polynomials. Specifically, we consider hypersurface $$f=0$$ f = 0 defined by polynomial f that is general given its support, such support contains origin. show equals mixed ...

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 ver...