in this paper, some applications of our earlier results in working with chemical graphs arepresented.

The second Zagreb coindex is a well-known graph invariant defined as the total degree product of all non-adjacent vertex pairs in a graph. The second Zagreb eccentricity coindex is defined analogously to the second Zagreb coindex by replacing the vertex degrees with the vertex eccentricities. In this paper, we present exact expressions or sharp lower bounds for the second Zagreb eccentricity co...

The hesitant fuzzy graph (HFG) is one of the most powerful tools to find strongest influential person in a network. Many problems practical interest can be modeled and solved by using HFG algorithms. HFGs, belonging FG family, have good capabilities when faced with that cannot expressed FGs. vague-valued (VVHFG) generalization HFG. A VVHFG useful tool various parts, such as meetings, conference...

in this paper, various elementary properties of vague rings are obtained. furthermore, the concepts of vague subring, vague ideal, vague prime ideal and vague maximal ideal are introduced, and the validity of some relevant classical results in these settings are investigated.

The vague sum (product) of a finite number of real numbers and the vague integral multiples (powers) of real numbers based on a perfect vague addition (multiplication) operation are introduced, and some of their fundamental properties are pointed out. Furthermore, some examples are designed to show how they can be practically implemented. Keyword: Fuzzy arithmetic, Vague arithmetic, Vague arith...

mathematical chemistry is a branch of theoretical chemistry for discussion and prediction of the molecular structure using mathematical methods without necessarily referring to quantum mechanics. in theoretical chemistry, distance-based molecular structure descriptors are used for modeling physical, pharmacologic, biological and other properties of chemical compounds. the wiener polarity index ...

The Merrifield-Simmons index of a graph is defined as the total number of the independent sets of the graph and the Hosoya index of a graph is defined as the total number of the matchings of the graph. In this paper, we give formula for Merrifield-Simmons and Hosoya indices of some classes of cartesian product of two graphs K{_2}×H, where H is a path graph P{_n}, cyclic graph C{_n}, or star gra...

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

the wiener index $w(g)$ of a connected graph $g$‎ ‎is defined as $w(g)=sum_{u,vin v(g)}d_g(u,v)$‎ ‎where $d_g(u,v)$ is the distance between the vertices $u$ and $v$ of‎ ‎$g$‎. ‎for $ssubseteq v(g)$‎, ‎the {it steiner distance/} $d(s)$ of‎ ‎the vertices of $s$ is the minimum size of a connected subgraph of‎ ‎$g$ whose vertex set is $s$‎. ‎the {it $k$-th steiner wiener index/}‎ ‎$sw_k(g)$ of $g$ ...