The concept of geometric-arithmetic indices (GA) was introduced in the chemical graph
theory very recently. In spite of this, several papers have already appeared dealing with …

A new molecular-structure descriptor GA 2, belonging to the class of geometric–arithmetic
indices, is considered. It is closely related to the Szeged and vertex PI indices. The main …

Any number that can be uniquely determined by a graph is called a graph invariant. During
the last twenty years' countless mathematical graph invariants have been characterized and …

Any number that can be uniquely identified and varied by a graph is known as a graph
invariant. This paper will talk about three unique variations of bridge networks, sierpinski …

The corona product 𝐺𝑜𝐻 of two graphs 𝐺 and 𝐻 is defined as the graph obtained by taking
one copy of 𝐺 and| 𝑉 (𝐺)| copies of 𝐻 and joining the i-th vertex of 𝐺 to every vertex in the 𝑖 …

In various fields, different networks are used, most of the time not of a single kind; but rather
a mix of at least two networks. These kinds of networks are called bridge networks which are …

Let G be a simple connected molecular graph with vertex set $ V (G) $ and edge set $ E (G)
$. One important modification of classical Zagreb index, called hyper Zagreb index $ HM (G) …

The vertex PI index is a distance-based molecular structure descriptor, that recently found
numerous chemical applications. In order to increase diversity of this topological index for …

Abstract Let G=(V, E) be a simple connected graph with vertex set V and edge set E. The
Wiener index of G is defined by W (G)=∑{x, y}⊆ V d (x, y), where d (x, y) is the length of the …

We give bounds for the revised Szeged index, and determine the n-vertex unicyclic graphs
with the smallest, the second-smallest and the third-smallest revised Szeged indices for n≥ …