English
Related papers

Related papers: Extremal cacti with respect to Sombor index

200 papers

In this paper, we have studied bounds based on topological indicators, from which we selected Albertson index $\mathrm{irr}$ and the Sigma index $\sigma$. The Sigma index was defined through the following relationship: \[…

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

Suppose $G$ is a simple graph with edge set $E(G)$. The Randi\'{c} index $R(G)$ is defined as $R(G)=\sum_{uv\in E(G)}\frac{1}{\sqrt{deg_{G}(u)deg_{G}(v)}}$, where $deg_G(u)$ denotes the vertex degree of $u$ in $G$. In this paper, the first…

Combinatorics · Mathematics 2019-07-26 Ali Reza Ashrafi , Ali Ghalavand , Marzieh Pourbabaee

Let $G$ be a connected graph with $n$ vertices and $m$ edges. The vertex-degree-based topological index (VDB) (or graphical function-index) $TI(G)$ of $G$ with edge-weight function $I(x,y)$ is defined as $$TI(G)=\sum\limits_{uv\in…

General Mathematics · Mathematics 2023-04-25 Hechao Liu , Zenan Du , Yufei Huang , Hanlin Chen , Suresh Elumalai

The sigma index in graph theory refers to a measure of the degree differences between vertices in a graph. The goal is to determine the graphs that have the maximum sigma index within certain classes of graphs. Abdo, Dimitrov, and Gutman…

General Mathematics · Mathematics 2024-05-10 Jasem Hamoud , Artem Kurnosov

A connected graph $G$ is a cactus if any two of its cycles have at most one common vertex. Let $\ell_n^m$ be the set of cacti on $n$ vertices with matching number $m.$ S.C. Li and M.J. Zhang determined the unique graph with the maximum…

Combinatorics · Mathematics 2015-11-24 Yun Shen , Lihua You , Minjie Zhang , Shuchao Li

A star edge coloring of a graph $G$ is a proper edge coloring of $G$ such that no path or cycle of length four is bi-colored. The star chromatic index of $G$, denoted by $\chi^{\prime}_{s}(G)$, is the minimum $k$ such that $G$ admits a star…

Combinatorics · Mathematics 2019-11-07 Behnaz Omoomi , Marzieh Vahid Dastjerdi , Yasaman Yektaeian

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ć

In this paper, degree-based topological indices play a key role in the structural analysis of graphs in this paper and have significant uses in chemical graph theory. We investigate the connections between three such tree indices: the…

Combinatorics · Mathematics 2026-03-10 Duaa Abdullah , Jasem Hamoud

The general sum-connectivity index of a graph $G$ is defined as $\chi_\alpha(G)=\sum\limits_{uv\in E(G)} {(d(u)+d(v))^{\alpha}}$, where $d(v)$ denotes the degree of the vertex $v$ in $G$ and $\alpha$ is a real number. In this paper it is…

Combinatorics · Mathematics 2018-07-13 M. K. Jamil , I. Tomescu

The connective eccentricity index $\xi^{ce}=\sum^{}_{u\in V}\frac{d(u)}{\varepsilon(u)}$, where $\varepsilon(u)$ and $d(u)$ denote the eccentricity and the degree of the vertex $u$, respectively. In this paper, we first determine the…

Combinatorics · Mathematics 2017-02-20 Zikai Tang , Lingyao Jiang , Hanyuan Deng

A vertex-degree-based topological index named as Sombor index of a simple graph G with n vertices was recently introduced by I. Gutman. In this paper, we find Sombor index of m-splitting graph and m-shadow graph. Also, we determine relation…

Combinatorics · Mathematics 2022-05-20 Randhir Singh , S. C. Patekar

We study the Sombor index of trees with various degree restrictions. In addition to rediscovering that among all trees with a given degree sequence, the greedy tree minimises the Sombor index and the alternating greedy tree maximises it, we…

Combinatorics · Mathematics 2024-04-03 Eric O. D. Andriantiana , Valisoa R. M. Rakotonarivo

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

The forgotten topological index of a graph $G$, denoted by $F(G)$, is defined as the sum of weights $d(u)^{2}+d(v)^{2}$ over all edges $uv$ of $G$ , where $d(u)$ denotes the degree of a vertex $u$. In this paper, we give sharp upper bounds…

Combinatorics · Mathematics 2021-02-05 A. Jahanbani , L. Shahbazi , S. M. Sheikholeslami , R. Rasi , J. Rodriguez

In this paper, we find some bounds for the Sombor index of the graph G by triangle inequality, arithmetic index, geometric index, forgotten index (F(G)), arithmetic-geometric (AG) index, geometric-arithmetic (GA) index, symmetric division…

Combinatorics · Mathematics 2024-09-12 Maryam Mohammadi , Hasan Barzegar

In this work we obtain new lower and upper optimal bounds of general Sombor indices. Specifically, we have inequalities for these indices relating them with other indices: the first Zagreb index, the forgotten index and the first variable…

Combinatorics · Mathematics 2021-08-12 J. C. Hernández , J. M. Rodríguez , O. Rosario , J. M. Sigarreta

Consider a graph $G$ and a real-valued function $f$ defined on the degree set of $G$. The sum of the outputs $f(d_v)$ over all vertices $v\in V(G)$ of $G$ is usually known as the vertex-degree-function indices and is denoted by $H_f(G)$,…

Combinatorics · Mathematics 2023-04-11 Abeer M. Albalahi , Igor Z. Milovanovic , Zahid Raza , Akbar Ali , Amjad E. Hamza

We give an upper bound for the cactus rank of any multi-homogeneous polynomial.

Algebraic Geometry · Mathematics 2019-02-22 Edoardo Ballico , Alessandra Bernardi , Fulvio Gesmundo

In this paper, we provide the irregularity properties of trees with strong support vertex by analyzing two prominent topological indices: the Albertson index and the Sigma index. We further establish extremal bounds for both indices across…

Combinatorics · Mathematics 2025-05-13 Jasem Hamoud , Duaa Abdullah

For a graph $G$ with vertex set $V_{G}$ and edge set $E_{G}$, the symmetric division deg index is defined as $SDD(G)=\sum\limits_{uv\in E_{G}}(\frac{d_{u}}{d_{v}}+\frac{d_{v}}{d_{u}})$, where $d_{u}$ denotes the degree of vertex $u$ in $G$.…

Combinatorics · Mathematics 2022-07-12 Hechao Liu , Yufei Huang