English
Related papers

Related papers: Bounds on Trees with Topological Indices Among Deg…

200 papers

Albertson has defined the irregularity of a simple undirected graph $G=(V,E)$ as $ \irr(G) = \sum_{uv\in E}|d_G(u)-d_G(v)|,$ where $d_G(u)$ denotes the degree of a vertex $u \in V$. Recently, this graph invariant gained interest in the…

Discrete Mathematics · Computer Science 2015-03-20 Hosam Abdo , Nathann Cohen , Darko Dimitrov

Let $d_G(v)$ be the degree of the vertex $v$ in a graph $G$. The Sombor index of $G$ is defined as $SO(G) =\sum_{uv\in E(G)}\sqrt{d^2_G(u)+d^2_G(v)}$, which is a new degree-based topological index introduced by Gutman. Let…

Combinatorics · Mathematics 2021-03-16 Ting Zhou , Zhen Lin , Lianying Miao

The Wiener index of a connected graph is the sum of topological distances between all pairs of vertices. Since Wang gave a mistake result on the maximum Wiener index for given tree degree sequence, in this paper, we investigate the maximum…

Combinatorics · Mathematics 2009-07-23 Xiao-Dong Zhang , Yong Liu , Min-Xian Han

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

Topological indices have important role in theoretical chemistry for QSPR researches. Among the all topological indices the Randi\'c and the Zagreb indices have been used more considerably than any other topological indices in chemical and…

Combinatorics · Mathematics 2017-01-12 Süleyman Ediz

A topological index is a real number which is derived from a network or a graph by mathematically that characterizes the whole of its structural properties. Recently, there are various topological indices that have been introduced in…

Combinatorics · Mathematics 2019-04-23 Prosanta Sarkar , Nilanjan De , Anita Pal

In the study of topological indices two negative correlations are well known: that between the number of subtrees and the Wiener index (sum of distances), and that between the Merrifield-Simmons index (number of independent vertex subsets)…

Combinatorics · Mathematics 2020-01-23 Eric Ould Dadah Andriantiana , Hua Wang

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

In 2021, the Sombor index was introduced by Gutman, which is a new degree-based topological molecular descriptors. The Sombor index of a graph $G$ is defined as $SO(G) =\sum_{uv\in E(G)}\sqrt{d^2_G(u)+d^2_G(v)}$, where $d_G(v)$ is the…

Combinatorics · Mathematics 2021-03-09 Ting Zhou , Zhen Lin , Lianying Miao

Topological indices play an important role in mathematical chemistry especially in the quantitative structure-property relationship (QSPR) and quantitative structure-activity relationship (QSAR). Recent research indicates that the augmented…

Combinatorics · Mathematics 2016-07-26 Akbar Ali , Zahid Raza , Akhlaq Ahmad Bhatti

In the paper [I. Gutman, N. Trinajsti\'c, Chem. Phys. Lett. 17 (1972), 535], it was shown that total $\pi$-electron energy ($E$) of a molecule $M$ depends on the quantity $\sum_{v\in V(G)}d_{v}^{2}$ (nowadays known as the "first Zagreb…

Combinatorics · Mathematics 2020-09-08 Akbar Ali , Nenad Trinajstić

In this paper, several properties of plain-oriented recursive trees (PORTs) are uncovered. Specifically, we investigate the degree profile of a PORT by determining the exact probability mass function of the degree of a node with a fixed…

Probability · Mathematics 2018-12-31 Panpan Zhang

The Harary index of a graph $G$ is recently introduced topological index, defined on the reverse distance matrix as $H(G)=\sum_{u,v \in V(G)}\frac{1}{d(u,v)}$, where $d(u,v)$ is the length of the shortest path between two distinct vertices…

Combinatorics · Mathematics 2011-05-24 Aleksandar Ili\' c , Guihai Yu , Lihua Feng

An extension of the well-known Szeged index was introduced recently, named as weighted Szeged index ($\textrm{sz}(G)$). This paper is devoted to characterizing the extremal trees and graphs of this new topological invariant. In particular,…

Combinatorics · Mathematics 2019-01-16 Jan Bok , Boris Furtula , Nikola Jedličková , Riste Škrekovski

This paper establishes sharp bounds for the vulnerability measures of closeness and generalized closeness in graphs and identifies graphs that attain these bounds. It further develops bounds incorporating Zagreb indices for triangle- and…

Combinatorics · Mathematics 2025-06-02 Sanju Vaidya , Cheng Chang

The concepts of geometric-arithmetic and harmonic indices were introduced in the area of chemical graph theory recently. They have proven to correlate well with physical and chemical properties of some molecules. The aim of this paper is to…

Combinatorics · Mathematics 2020-04-08 Walter Carballosa , Ana Granados , Domingo Pestana , Ana Portilla , Jose María Sigarreta

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

In a study on the structure--dependency of the total $\pi$-electron energy from 1972, Trinajsti\'c and one of the present authors have shown that it depends on the sums $\sum_{v\in V}d(v)^2$ and $\sum_{v\in V}d(v)^3$, where $d(v)$ is the…

Discrete Mathematics · Computer Science 2015-09-21 Hosam Abdo , Darko Dimitrov , Ivan Gutman

The $\sigma$-irregularity index of a graph is defined as the sum of squared degree differences over all edges and provides a sensitive measure of structural heterogeneity. In this paper, we study the problem of maximizing $\sigma(T)$ among…

Combinatorics · Mathematics 2026-02-17 Milan Bašić

We examine the quantity \[S(G) = \sum_{uv\in E(G)} \min(\text{deg } u, \text{deg } v)\] over sets of graphs with a fixed number of edges. The main result shows the maximum possible value of $S(G)$ is achieved by three different classes of…

Combinatorics · Mathematics 2018-01-09 Ashwin Sah , Mehtaab Sawhney