English
Related papers

Related papers: Sharp Bounds for Generalized Zagreb Indices of Gra…

200 papers

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ć

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 $\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 give new bounds for a several vertex-based and edge-based topological indices of graphs: Albertson irregularity index, degree variance index, Mostar and the first Zagreb index. Moreover, we give a new upper bound for the…

Combinatorics · Mathematics 2022-10-25 Arber Avdullahu , Slobodan Filipovski

Szeged, PI and Mostar indices are some of the most investigated distance-based molecular descriptors. Recently, many different variations of these topological indices appeared in the literature and sometimes they are all together called…

Combinatorics · Mathematics 2021-02-15 Simon Brezovnik , Niko Tratnik

Let $\mathcal{H}$ be a hypergraph on the non-empty finite vertex set $V(\mathcal{H})$ with the hyperedge set $E(\mathcal{H})$, where each hyperedge $e \in E(\mathcal{H})$ is a subset of $V(\mathcal{H})$ with at least two vertices. This…

Discrete Mathematics · Computer Science 2025-09-18 Abdulkafi Sanad

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

The wreath product of graphs is a graph composition inspired by the notion of wreath product of groups, with interesting connections with Geometric Group Theory and Probability. This paper is devoted to the description of some degree and…

Combinatorics · Mathematics 2020-03-20 Matteo Cavaleri , Alfredo Donno

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 aim of this paper is to obtain new inequalities for a large family of topological indices restricted to unicyclic graphs and to characterize the set of extremal unicyclic graphs with respect to them. This family includes variable first…

Combinatorics · Mathematics 2021-03-16 Álvaro Martínez-Pérez , José M. Rodríguez

In this paper we introduce a variation of the well-known Zagreb indices by considering a proper vertex colouring of a graph $G$. The chromatic Zagreb indices are defined in terms of the parameter $c(v), v \in V(G)$ instead of the invariant…

General Mathematics · Mathematics 2016-05-05 Johan Kok , N. K. Sudev , U. Mary

The F-index of a graph is defined as the sum of cubes of the vertex degrees of the graph. This was introduced in 1972, in the same paper where the first and second Zagreb indices were introduced to study the structure-dependency of total…

Combinatorics · Mathematics 2015-11-23 Nilanjan De , Sk. Md. Abu Nayeem , Anita Pal

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…

Topological relations between three degree-based invariants of a connected graph G are investigated. We present novel inequalities including M1(G), M2(G) and F(G), and show that in all cases equality holds if G is a regular or a semiregular…

Combinatorics · Mathematics 2015-09-29 Tamás Réti , Imre Felde

Applications in chemistry motivated mathematicians to define different topological indices for different types of graphs. The Hyper-Zagreb index (HM) is an important tool as it integrates the first and the second Zagreb indices. In this…

Combinatorics · Mathematics 2018-09-12 Hassan Rezapour , Ramin Nasiri , Seyedahmad Mousavi

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

There are various topological indices such as degree based topological indices, distance based topological indices and counting related topological indices etc. These topological indices correlate certain physicochemical properties such as…

Combinatorics · Mathematics 2016-05-09 Shaohui Wang , Jia-Bao Liu , Chunxiang Wang , Sakander Hayat

Let $G$ be a simple graph with order $n$ and size $m$. The quantity $M_1(G)=\displaystyle\sum_{i=1}^{n}d^2_{v_i}$ is called the first Zagreb index of $G$, where $d_{v_i}$ is the degree of vertex $v_i$, for all $i=1,2,\dots,n$. The signless…

Combinatorics · Mathematics 2022-05-10 S. Pirzada , Saleem Khan

A graph $G$ consists of two parts, the vertices and edges. The vertices constitute the vertex set $V(G)$ and the edges, the edge set. An edge \( e=xy \), \( ev \)-dominates not only the vertices incident to it but also those adjacent to…

Combinatorics · Mathematics 2025-05-12 Amitariddhi Sinha , Somnath Paul

In this paper, we investigate The relationship between the Albertson index and the first Zagreb index for trees. For a tree $T=(V,E)$ with $n=|V|$ vertices and $m=|E|$ edges, we provide several bounds and exact formulas for these two…

Combinatorics · Mathematics 2025-06-03 Jasem Hamoud , Alexei Belov-Kanel , Duaa Abdullah