Related papers: Maximum augmented Zagreb index on polyomino chains
In this paper, we develop a dynamic programming framework for identifying extremal general polyomino chains with respect to degree-based topological indices. As a concrete application, we resolve an open problem posed in 2015 by…
In this manuscript, we delve into the exploration of the first and second Zagreb connection indices of both polyomino chains and random polyomino chains. Our methodology relies on the utilization of Markov chain theory. Within this…
Augmented Zagreb Index is a newly defined degree based topological invariant which has been well established for its better correlation properties and is defined as $AZI(G)= \sum_{uv\in E(G)}(\frac{d_G (u)d_G (v)}{d_G (u)+ d_G (v)-2})^3 $,…
Topological indices are numerical invariants derived from molecular graphs and play an important role in characterizing chemical compounds and predicting their properties. Among the earliest descriptors are the classical Zagreb indices…
The first multiplicative Zagreb index of a graph $G$ is the product of the square of every vertex degree, while the second multiplicative Zagreb index is the product of the products of degrees of pairs of adjacent vertices. In this paper,…
Recently, a couple of degree-based topological indices, defined using a geometrical point of view of a graph edge, have attracted significant attention and being extensively investigated. Furtula and Oz [Complementary Topological Indices,…
In this paper, we examine a specific type of random chains and propose an unified approach to studying the degree-based topological indices, including their extreme values. We derive explicit analytical expressions for the expected values…
This work is devoted to establish a general expression for calculating the bond incident degree (BID) indices of polyomino chains and to characterize the extremal polyomino chains with respect to several well known BID indices. From the…
For a graph $G$, the first multiplicative Zagreb index $\prod_1(G) $ is the product of squares of vertex degrees, and the second multiplicative Zagreb index $\prod_2(G) $ is the product of products of degrees of pairs of adjacent vertices.…
The arithmetic-geometric index is a newly proposed degree-based graph invariant in mathematical chemistry. We give a sharp upper bound on the value of this invariant for connected chemical graphs of given order and size and characterize the…
For a graph $G$, the first multiplicative Zagreb index $\prod_1$ is equal to the product of squares of the vertex degrees, and the second multiplicative Zagreb index $\prod_2$ is equal to the product of the products of degrees of pairs of…
For a (molecular) graph, the first multiplicative Zagreb index $\prod_1(G) $ is the product of the square of every vertex degree, and the second multiplicative Zagreb index $\prod_2(G) $ is the product of the products of degrees of pairs of…
The first Zagreb index $M_{1}$ of a graph is defined as the sum of the square of every vertex degree, and the second Zagreb index $M_{2}$ of a graph is defined as the sum of the product of vertex degrees of each pair of adjacent vertices.…
The first multiplicative Zagreb index of a graph $G$ is the product of the square of every vertex degree, while the second multiplicative Zagreb index is the product of the degree of each edge over all edges. In our work, we explore the…
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)$ is defined as the sum of squares of the degree sum of the…
We consider chemical graphs that are defined as connected graphs of maximum degree at most 3. We characterize the extremal graphs, meaning those that maximize or minimize 33 degree-based topological indices. This study shows that five graph…
Chemical graphs are simple undirected connected graphs, where vertices represent atoms in a molecule and edges represent chemical bonds. A degree-based topological index is a molecular descriptor used to study specific physicochemical…
In the last forty years, many scientists used graph theory to develop mathematical models for analyzing structures and properties of various chemical compounds. In this paper, we will establish formulas and bounds for generalized first…
The notion of augmenting graphs generalizes Berge's idea of augmenting chains, which was used by Edmonds in his celebrated solution of the maximum matching problem. This problem is a special case of the more general maximum independent set…
We investigate a special case of the maximum quadratic assignment problem where one matrix is a product matrix and the other matrix is the distance matrix of a one-dimensional point set. We show that this special case, which we call the…