English
Related papers

Related papers: Simple Alcohols with the Lowest Normal Boiling Poi…

200 papers

Let $G=(V,E)$ be a graph with $n$ vertices and $m$ edges. The hyper Zagreb index of $G$, denoted by $HM(G)$, is defined as $HM(G) =\sum\limits_{uv \in E(G)}\left[d_{G}(u)+d_G(v)\right]^{2}$ where $d_G(v)$ denotes the degree of a vertex $v$…

Combinatorics · Mathematics 2018-05-30 Chidambaram Natarajan , Selvaraj Balachandran , SK Ayyaswamy

We present efficient combinatorial parameterized algorithms for several classical graph-based counting problems in computational chemistry, including (i) Kekule structures, (ii) the Hosoya index, (iii) the Merrifield-Simmons index, and (iv)…

Data Structures and Algorithms · Computer Science 2025-08-12 Giovanna K. Conrado , Amir K. Goharshady , Harshit J. Motwani , Sergei Novozhilov

Topological indices are graph invariants numeric quantities, which are utilized by researchers to analyze a variety of physiochemical aspects of molecules. The goal of developing topological indices is to give each chemical structure a…

Combinatorics · Mathematics 2022-12-09 Sohan Lal , Karnika Sharma , Vijay Kumar Bhat

The Wiener index of a network, introduced by the chemist Harry Wiener, is the sum of distances between all pairs of nodes in the network. This index, originally used in chemical graph representations of the non-hydrogen atoms of a molecule,…

Computational Geometry · Computer Science 2023-03-03 A. Karim Abu-Affash , Paz Carmi , Ori Luwisch , Joseph S. B. Mitchell

An atom $a$ of a molecular graph $G$ uniquely determines (resolves) a pair $(a_1,a_2)$ of atoms of $G$ if the distance between $a$ and $a_1$ is different from the distance between $a$ and $a_2$. In this paper, we quantify the involvement of…

Combinatorics · Mathematics 2014-08-04 Muhammad Salman , Imran Javaid , Muhammad Anwar Chaudhry

For a simple graph $G$ with $n$ vertices and $m$ edges, the first Zagreb index and the second Zagreb index are defined as $M_1(G)=\sum_{v\in V}d(v)^2 $ and $M_2(G)=\sum_{uv\in E}d(u)d(v)$. In \cite{VGFAD}, it was shown that if a connected…

Discrete Mathematics · Computer Science 2015-03-19 Hosam Abdo , Darko Dimitrov , Ivan Gutman

Graph operations are crucial for building complicated network architectures from simple graphs. In [7], authors defined two new variants of Corona product and investigated some topological indices. In this paper, we extended the work and…

Combinatorics · Mathematics 2021-11-23 Rao Tabish , Muhammad Kamran Jamil , Muhammad Waheed

We revisit the problem of designing sublinear algorithms for estimating the average degree of an $n$-vertex graph. The standard access model for graphs allows for the following queries: sampling a uniform random vertex, the degree of a…

Data Structures and Algorithms · Computer Science 2025-10-24 Lorenzo Beretta , Deeparnab Chakrabarty , C. Seshadhri

The reverse Wiener index of a connected graph $G$ is a variation of the well-known Wiener index $W(G)$ defined as the sum of distances between all unordered pairs of vertices of $G$. It is defined as $\Lambda(G)=\frac{1}{2}n(n-1)d-W(G)$,…

Combinatorics · Mathematics 2012-06-18 Rundan Xing , Bo Zhou

Hydrocarbon pyrolysis is a complex chemical reaction system at extreme temperature and pressure conditions involving large numbers of chemical reactions and chemical species. Only two kinds of atoms are involved: carbons and hydrogens. Its…

Chemical Physics · Physics 2026-02-10 Perrin E. Ruth , Vincent Dufour-Decieux , Christopher Moakler , Maria Cameron

Heydari \cite{heydari2013} presented very nice formulae for the Wiener and terminal Wiener indices of generalized Bethe trees. It is pity that there are some errors for the formulae. In this paper, we correct these errors and characterize…

Combinatorics · Mathematics 2013-05-28 Ya-Hong Chen , Xiao-Dong Zhang

There is powerful relation between the chemical behaviour of chemical compounds and their molecular structures. Topological indices defined on these chemical molecular structures are capable to predict physical properties, chemical…

Combinatorics · Mathematics 2018-05-15 Sourav Mondal , Nilanjan De , Anita Pal

A topological index reflects the physical, chemical and structural properties of a molecule, and its study has an important role in molecular topology, chemical graph theory and mathematical chemistry. It is a natural problem to…

Combinatorics · Mathematics 2022-07-08 Rui Song , Qiongxiang Huang

Let $G$ be a simple connected graph with the vertex set $V(G)$ and $d_{B}^2(u,v)$ be the biharmonic distance between two vertices $u$ and $v$ in $G$. The biharmonic index $BH(G)$ of $G$ is defined as $$BH(G)=\frac{1}{2}\sum\limits_{u\in…

Combinatorics · Mathematics 2021-10-20 Zhen Lin

For a connected graph $G$ on at least three vertices, the augmented Zagreb index (AZI) of $G$ is defined as $$AZI(G)=\sum_{uv\in E(G)}\left(\frac{d(u)d(v)}{d(u)+d(v)-2}\right)^{3},$$ being a topological index well-correlated with the…

Combinatorics · Mathematics 2022-05-31 Muhuo Liu , Shumei Pang , Francesco Belardo , Akbar Ali

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

The first and the second Zagreb eccentricity index of a graph $G$ are defined as $E_1(G)=\sum_{v\in V(G)}\varepsilon_{G}(v)^{2}$ and $E_2(G)=\sum_{uv\in E(G)}\varepsilon_{G}(u)\varepsilon_{G}(v)$, respectively, where $\varepsilon_G(v)$ is…

Combinatorics · Mathematics 2019-12-16 Kexiang Xu , Kinkar Chandra Das , Sandi Klavžar , Huimin Li

The authors Mili$\breve{c}$evi$\acute{c}$ et al. introduced the reformulated Zagreb indices, which is a generalization of classical Zagreb indices of chemical graph theory. In the paper, we characterize the extremal properties of the first…

Combinatorics · Mathematics 2014-06-30 Shengjin Ji , Xia Li , Yongke Qu

Let $G = (V, E)$ be a graph. The first Zagreb index of a graph $G$ is defined as $\sum_{u \in V} d^2(u)$, where $d(u)$ is the degree of vertex $u$ in $G$. Using the P\'{o}lya-Szeg\H{o} inequality, we in this paper present the first Zagreb…

Combinatorics · Mathematics 2024-09-05 Rao Li

The first Zagreb index of a graph $G$ is the sum of squares of the vertex degrees in a graph and the second Zagreb index of $G$ is the sum of products of degrees of adjacent vertices in $G$. The imbalance of an edge in $G$ is the numerical…

General Mathematics · Mathematics 2020-02-25 Sudev Naduvath , Johan Kok