English
Related papers

Related papers: Maximum atom-bond connectivity index with given gr…

200 papers

The first geometric-arithmetic (GA) index and atom-bond connectivity (ABC) index are molecular structure descriptors which play a significant role in quantitative structure-property relationship (QSPR) and quantitative structure-activity…

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

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…

Combinatorics · Mathematics 2025-01-07 Sébastien Bonte , Gauvain Devillez , Valentin Dusollier , Alain Hertz , Hadrien Mélot

The eccentric connectivity index $\xi^c$ is a novel distance--based molecular structure descriptor that was recently used for mathematical modeling of biological activities of diverse nature. It is defined as $\xi^c (G) = \sum_{v \in V (G)}…

Combinatorics · Mathematics 2015-03-19 Aleksandar Ilić

In this paper we establish all extremal graphs with respect to augmented eccentric connectivity index among all (simple connected) graphs, among trees and among trees with perfect matching. For graphs that turn out to be extremal explicit…

Combinatorics · Mathematics 2013-06-19 Jelena Sedlar

Let $G=(V,E)$ be a finite simple graph. The Graovac-Ghorbani index of a graph G is defined as $ABC_{GG}(G)=\sum_{uv\in E(G)}\sqrt{\frac{n_u(uv,G)+n_v(uv,G)-2}{n_u(uv,G)n_v(uv,G)}},$ where $n_u(uv,G)$ is the number of vertices closer to…

Combinatorics · Mathematics 2022-02-07 Nima Ghanbari

We obtain the maximum sum-connectivity indices of graphs in the set of trees and in the set of unicyclic graphs respectively with given number of vertices and maximum degree, and determine the corresponding extremal graphs. Additionally, we…

Combinatorics · Mathematics 2012-10-19 Zhibin Du , Bo Zhou , Nenad Trinajstic

The eccentricity of a vertex $v$ in a graph $G$ is the maximum distance between $v$ and any other vertex of $G$. The diameter of a graph $G$ is the maximum eccentricity of a vertex in $G$. The eccentric connectivity index of a connected…

Discrete Mathematics · Computer Science 2024-03-11 Pierre Hauweele , Alain Hertz , Hadrien Mélot , Bernard Ries , Gauvain Devillez

Very recently, the first geometric-arithmetic index $GA$ and arithmetic-geometric index $AG$ were introduced in mathematical chemistry. In the present paper, we first obtain some lower and upper bounds on $AG$ and characterize the extremal…

Combinatorics · Mathematics 2020-10-09 Shu-Yu Cui , Weifan Wang , Gui-Xian Tian , Baoyindureng Wu

A general expression for calculating the bond incident degree (BID) indices of certain triangular chain graphs is derived. The extremal triangular chain graphs with respect to several well known BID indices are also characterized over a…

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

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…

Topological indices are molecular descriptors that describe the properties of chemical compounds. These topological indices correlate specific physico-chemical properties like boiling point, enthalpy of vaporization, strain energy, and…

Combinatorics · Mathematics 2022-10-05 Haritha T , Chithra A. V.

The modified eccentric connectivity index of a graph is defined as the sum of the products of eccentricity with the total degree of neighboring vertices, over all vertices of the graph. This is a generalization of eccentric connectivity…

Combinatorics · Mathematics 2014-06-03 Nilanjan De , Sk. Md. Abu Nayeem , Anita Pal

The connective eccentric index of a graph is a topological index involving degrees and eccentricities of vertices of the graph. In this paper, we have studied the connective eccentric index for double graph and double cover. Also we give…

Combinatorics · Mathematics 2014-06-03 Nilanjan De , Anita Pal , Sk. Md. Abu Nayeem

We describe the structure of connected graphs with the minimum and maximum average distance, radius, diameter, betweenness centrality, efficiency and resistance distance, given their order and size. We find tight bounds on these graph…

Molecular Networks · Quantitative Biology 2011-05-02 Dionysios Barmpoutis , Richard M. Murray

Many existing degree based topological indices can be classified as bond incident degree (BID) indices, whose general form is $BID(G)=\sum_{uv\in E(G)}$ $\Psi(d_{u},d_{v})$, where $uv$ is the edge connecting the vertices $u,v$ of the graph…

Combinatorics · Mathematics 2018-03-14 Akbar Ali , Darko Dimitrov

The Harary index of a graph is defined as the sum of reciprocals of distances between all pairs of vertices of the graph. In this paper we provide an upper bound of the Harary index in terms of the vertex or edge connectivity of a graph. We…

Combinatorics · Mathematics 2014-09-19 Xiao-Xin Li , Yi-Zheng Fan

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

The eccentricity of a vertex is the maximum distance from it to another vertex and the average eccentricity $ecc (G)$ of a graph $G$ is the mean value of eccentricities of all vertices of $G$. The average eccentricity is deeply connected…

Combinatorics · Mathematics 2011-06-16 Aleksandar Ilic

There are various topological indices for example distance based topological indices and degree based topological indices etc. In QSAR/QSPR study, physiochemical properties and topological indices for example atom bond connectivity index,…

Discrete Mathematics · Computer Science 2018-04-26 Raghisa Khalid , Nazeran Idrees

The Kirchhoff index of a connected graph is the sum of resistance distances between all unordered pairs of vertices in the graph. Its considerable applications are found in a variety of fields. In this paper, we determine the maximum value…

Combinatorics · Mathematics 2015-11-06 Dong Li , Xiang-Feng Pan , Jia-Bao Liu , Hui-Qing Liu