English
Related papers

Related papers: On extremal multiplicative Zagreb indices of trees…

200 papers

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,…

Combinatorics · Mathematics 2017-04-21 Shaohui Wang , Chunxiang Wang , Lin Chen , Jia-Bao Liu

The first multiplicative Zagreb index $\Pi_1$ of a graph $G$ is the product of the square of every vertex degree, while the second multiplicative Zagreb index $\Pi_2$ is the product of the products of degrees of pairs of adjacent vertices.…

Combinatorics · Mathematics 2019-07-01 Fazal Hayat

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

Combinatorics · Mathematics 2021-08-09 Shengjin Ji , Shaohui Wang , Tilahun Muche , Sakander Hayat

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…

Combinatorics · Mathematics 2017-04-25 Shaohui Wang

Let G be a graph with vertex set V (G) and edge set E(G). The first generalized multiplicative Zagreb index of G is M_1(G) and the second multiplicative Zagreb index is M_2(G). The multiplicative Zagreb indices have been the focus of…

Combinatorics · Mathematics 2016-02-16 Shaohui Wang , Bing Wei

For a molecular graph, the first multiplicative Zagreb index $\Pi_1$ is equal to the product of the square of the degree of the vertices, while the second multiplicative Zagreb index $\Pi_2$ is equal to the product of the endvertex degree…

Combinatorics · Mathematics 2017-05-09 Shaohui Wang , Chunxiang Wang , Lin Chen

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…

Combinatorics · Mathematics 2017-04-28 Chunxiang Wang , Jia-Bao Liu , Shaohui Wang

Let $\prod(G)$ be Multiplicative Zagreb index of a graph G. A connected graph is a cactus graph if and only if any two of its cycles have at most one vertex in common, which has been the interest of researchers in the filed of material…

Combinatorics · Mathematics 2016-07-19 Shaohui Wang , Bing Wei

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

Combinatorics · Mathematics 2020-06-02 Xiaocong He , Xiaobo He

The first Zagreb index of a graph $G$ is the sum of the square of every vertex degree, while the second Zagreb index is the sum of the product of vertex degrees of each edge over all edges. In our work, we solve an open question about…

Combinatorics · Mathematics 2017-09-07 Shengjin Ji , Shaohui Wang

The hyper Zagreb index is a kind of extensions of Zagreb index, used for predicting physicochemical properties of organic compounds. Given a graph $G= (V(G), E(G))$, the first hyper-Zagreb index is the sum of the square of edge degree over…

Combinatorics · Mathematics 2016-12-08 Shaohui Wang , Wei Gao , Muhammad K. Jamil , Mohammad R. Farahani , Jia-Bao Liu

Let ${\mathcal G}_n$ be the set of class of graphs of order $n$. The first Zagreb index $M_1(G)$ is equal to the sum of squares of the degrees of the vertices, and the second Zagreb index $M_2(G)$ is equal to the sum of the products of the…

Combinatorics · Mathematics 2023-09-26 Batmend Horoldagva , Kinkar Chandra Das

The second Zagreb index of a graph G is denoted by $M_2(G)=\sum_{uv\in E(G)}d(u)d(v)$. In this paper, we investigate properties of the extremal graphs with the maximum second Zagreb indices with given graphic sequences, in particular…

Combinatorics · Mathematics 2015-03-30 Wei-Gang Yuan , Xiao-Dong Zhang

Let $\mathcal{CT}_{n,k}$ and $\mathcal{CT}^*_{n,b}$ be the classes of all $n$-vertex chemical trees with $k$ segments and $b$ branching vertices, respectively, where $3\le k\le n-1$ and $1\le b< \frac{n}{2}-1$. The solution of the problem…

Combinatorics · Mathematics 2020-09-08 Sadia Noureen , Akbar Ali , Akhlaq Ahmad Bhatti

In this paper, we investigate the structural properties of trees and bipartite graphs through the lens of topological indices and combinatorial graph theory. We focus on the First and Second Hyper-Zagreb indices, $HM_1(G)$ and $HM_2(G)$,…

Combinatorics · Mathematics 2025-08-21 Jasem Hamoud

Let $G=(V,E)$ be a simple graph with $n = |V|$ vertices and $m = |E|$ edges. The first and second Zagreb indices are among the oldest and the most famous topological indices, defined as $M_1 = \sum_{i \in V} d_i^2$ and $M_2 = \sum_{(i, j)…

Combinatorics · Mathematics 2011-04-22 Aleksandar Ilić , Dragan Stevanović

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…

Combinatorics · Mathematics 2024-09-11 Sanju Vaidya , Jeff Chang

The first Zagreb index $M_{1}(G)$ is equal to the sum of squares of the degrees of the vertices, and the second Zagreb index $M_{2}(G)$ is equal to the sum of the products of the degrees of pairs of adjacent vertices of the underlying…

Combinatorics · Mathematics 2024-04-09 H. M. Nagesh

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…

Chemical Physics · Physics 2026-05-04 Kinkar Chandra Das , Jayanta Bera

This paper presents new lower bounds for the first general Zagreb index $Z_{\alpha}(G)$ involving two, three, and four arbitrary degrees of vertices of a simple graph $G$. For the special cases $\alpha = 2$ and $\alpha = -2$, the results…

Combinatorics · Mathematics 2025-08-21 Mamta Verma , Ravinder Kumar
‹ Prev 1 2 3 10 Next ›