English
Related papers

Related papers: Augmented Zagreb Index of Polyhex Nanotubes

200 papers

We prove a conjecture of Nadjafi-Arani, Khodashenas and Ashrafi on the difference between the Szeged and Wiener index of a graph. Namely, if $G$ is a 2-connected non-complete graph on $n$ vertices, then $Sz(G)-W(G)\ge 2n-6$. Furthermore,…

Combinatorics · Mathematics 2018-06-29 Marthe Bonamy , Martin Knor , Borut Lužar , Alexandre Pinlou , Riste Škrekovski

The topological indices $irr(G)$ related to the \emph{first Zagreb index,} $M_1(G)$ and the \emph{second Zagreb index,} $M_2(G)$ are the oldest irregularity measures researched. Alberton $[3]$ introduced the \emph{irregularity} of $G$ as…

Combinatorics · Mathematics 2014-09-16 Johan Kok , Vivian Mukungunugwa

For a given connected graph $G$, the edge Mostar index $Mo_e(G)$ is defined as $Mo_e(G)=\sum_{e=uv \in E(G)}|m_u(e|G) - m_v(e|G)|$, where $m_u(e|G)$ and $m_v(e|G)$ are respectively, the number of edges of $G$ lying closer to vertex $u$ than…

Combinatorics · Mathematics 2024-05-21 Fazal Hayat , Shou-Jun Xu , Bo Zhou

Let $G$ be a connected graph. The edge revised Szeged index of $G$ is defined as $Sz^{\ast}_{e}(G)=\sum\limits_{e=uv\in E(G)}(m_{u}(e|G)+\frac{m_{0}(e|G)}{2})(m_{v}(e|G)+\frac{m_{0}(e|G)}{2})$, where $m_{u}(e|G)$ (resp., $m_{v}(e|G)$) is…

Combinatorics · Mathematics 2018-04-18 Shengjie He , Rong-Xia Hao , Deming Li

In this paper we present a theoretical analysis in order to establish maximal and minimal vectors with respect to the majorization order of particular subsets of \Re ^n: Afterwards we apply these issues to the calcula- tion of bounds for a…

Combinatorics · Mathematics 2015-03-27 Monica Bianchi , Alessandra Cornaro , Anna Torriero

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

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

Topological indices are real numbers invariant under graph isomorphisms. Chromatic analogue of topological indices has been introduced recently in literature in 2017. Mainly, chromatic versions of Zagreb indices are studied lately. This…

General Mathematics · Mathematics 2018-10-09 Smitha Rose , Sudev Naduvath

In a recent article, Nadeem and Siddique used Chebyshev's sum inequality to establish the Zagreb indices inequality $M_1/n\le M_2/m$ for undirected graphs in the case where the degree sequence $(d_i)$ and the degree-sum sequence $(S_i)$ are…

Combinatorics · Mathematics 2023-01-02 Hanjo Täubig

In this paper, we investigate the edge-Wiener index, the Szeged index, the edge-Szeged index, and the PI index, which are some of the most studied distance-based topological indices. As the main result we show that for benzenoid systems…

Combinatorics · Mathematics 2018-08-28 Matevž Črepnjak , Niko Tratnik

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

The Sombor index (SO) is a vertex-degree-based graph invariant, defined as the sum over all pairs of adjacent vertices of $\sqrt{d_i^2+d_j^2}$, where $d_i$ is the degree of the $i$-th vertex. It has been conceived using geometric…

Combinatorics · Mathematics 2022-12-09 Nima Ghanbari , Saeid Alikhani

The edge-Szeged index of a graph $G$ is defined as $Sz_e(G) = \sum_{e=uv \in E(G)}m_u(e)m_v(e)$, where $m_u(e)$ denotes the number of edges of $G$ whose distance to $u$ is smaller than the distance to $v$ and $m_v(e)$ denotes the number of…

Combinatorics · Mathematics 2018-08-28 Niko Tratnik

Recently, a bond-additive topological descriptor, named as the Mostar index, has been introduced as a measure of peripherality in networks. For a connected graph $G$, the Mostar index is defined as $Mo(G) = \sum_{e=uv \in E(G)} |n_u(e) -…

Combinatorics · Mathematics 2021-03-15 Niko Tratnik

The vertex PI index is a distance--based molecular structure descriptor, that recently found numerous chemical applications. In order to increase diversity of this topological index for bipartite graphs, we introduce weighted version…

Combinatorics · Mathematics 2015-03-19 Aleksandar Ili\' c , Nikola Milosavaljevi\' c

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

Given a simple connected graph on $N$ vertices with size $|E|$ and degree sequence $d_{1}\leq d_{2}\leq ...\leq d_{N}$, the aim of this paper is to exhibit new upper and lower bounds for the additive degree-Kirchhoff index in closed forms,…

Combinatorics · Mathematics 2015-03-27 Monica Bianchi , Alessandra Cornaro , José Luis Palacios , Anna Torriero

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

In this paper, the investigates Adriatic indices, specifically the sum lordeg index where it defined as $SL(G) = \sum_{u \in V(G)} \deg_G(u) \sqrt{\ln \deg_G(u)}$ and the variable sum exdeg index $SEI_a(G)$ for $a>0$, $a\neq 1$. We present…

Combinatorics · Mathematics 2025-08-07 Jasem Hamoud , Duaa Abdullah

Let $B$ be an equivalence relation defined on a finite group $G$. The $B$ super commuting graph on $G$ is a graph whose vertex set is $G$ and two distinct vertices $g$ and $h$ are adjacent if either $[g] = [h]$ or there exist $g' \in [g]$…

Group Theory · Mathematics 2025-11-07 Shrabani Das , Rajat Kanti Nath
‹ Prev 1 3 4 5 6 7 10 Next ›