Let G be a simple connected graph. The first and second Zagreb indices have been
introduced as M 1 (G)=? v IV (G) deg G (v) 2 and M 2 (G)=? uv IE (G) deg G (u) deg G (v) …

The Zagreb coindices of graph operations - ScienceDirect Skip to main contentSkip to article
Elsevier logo Journals & Books Search RegisterSign in View PDF Download full issue Search …

In this paper some exact expressions for the first and second Zagreb indices of graph
operations containing the Cartesian product, composition, join, disjunction and symmetric …

Recently introduced vertex-weighted Wiener polynomials are a generalization of both vertex-
weighted Wiener numbers and ordinary Wiener polynomials. We present here explicit …

Let G be a graph. The distance d (u, v) between the vertices u and v of the graph G is equal
to the length of a shortest path that connects u and v. The Wiener index W (G) is the sum of …

We study distance-based graph invariants, such as the Wiener index, the Szeged index, and
variants of these two. Relations between the various indices for trees are provided as well as …

A topological index is a number generated from a molecular structure (ie, a graph) that
indicates the essential structural properties of the proposed molecule. Indeed, it is an …

Quantitative structure− property relationship (QSPR) and quantitative structure− activity
relationship (QSAR) studies use statistical models to compute physical, chemical, or …

The sum of distances between all vertex pairs in a connected graph is known as the Wiener
index. It is an early index which correlates well with many physico-chemical properties of …

The Hosoya polynomial of a graph, H (G, x), has the property that its first derivative,
evaluated at x= 1, equals the Wiener index, ie, W (G)= H′(G, 1). In this paper, an equation …