English
Related papers

Related papers: Sombor index of clean graphs

200 papers

Let $G=(V,E)$ be a finite simple graph. The Sombor index $SO(G)$ of $G$ is defined as $\sum_{uv\in E(G)}\sqrt{d_u^2+d_v^2}$, where $d_u$ is the degree of vertex $u$ in $G$. In this paper, we study this index for certain graphs and we…

Combinatorics · Mathematics 2021-02-23 Nima Ghanbari , Saeid Alikhani

Let $G=(V,E)$ be a finite simple graph. The Sombor index $SO(G)$ of $G$ is defined as $\sum_{uv\in E(G)}\sqrt{d_u^2+d_v^2}$, where $d_u$ is the degree of vertex $u$ in $G$. Let $G$ be a connected graph constructed from pairwise disjoint…

Combinatorics · Mathematics 2021-03-26 Saeid Alikhani , Nima Ghanbari

Recently, Gutman defined a new vertex-degree-based graph invariant, named the Sombor index $SO$ of a graph $G$, and is defined by $$SO(G)=\sum_{uv\in E(G)}\sqrt{d_G(u)^2+d_G(v)^2},$$ where $d_G(v)$ is the degree of the vertex $v$ of $G$. In…

Combinatorics · Mathematics 2023-09-26 Batmend Horoldagva , Chunlei Xu

The Sombor index $SO(G)$ of a graph $G$ is the sum of the edge weights $\sqrt{d^2_G(u)+d^2_G(v)}$ of all edges $uv$ of $G$, where $d_G(u)$ denotes the degree of the vertex $u$ in $G$. A connected graph $G = (V ,E)$ is called a quasi-tree,…

Combinatorics · Mathematics 2023-07-04 Ruiting Zhang , Huiqing Liu , Yibo Li

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 Sombor index of a graph $G$, introduced by Ivan Gutman, is defined as the sum of the weights $\sqrt{d_G(u)^2+d_G(v)^2}$ of all edges $uv$ of $G$, where $d_G(u)$ denotes the degree of vertex $u$ in $G$. The Sombor coindex is recently…

Combinatorics · Mathematics 2022-04-07 Zenan Du , Lihua You , Hechao Liu , Yufei Huang

The Sombor index is one of the geometry-based descriptors, which was defined as $$SO(G)=\sum_{uv\in E(G)}\sqrt{d^{2}(u)+d^{2}(v)},$$ where $d(u)$ (resp. $d(v)$) denotes the degree of vertex $u$ (resp. $v$) in $G$. In this note, we determine…

Combinatorics · Mathematics 2022-08-25 Hechao Liu

Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$. The Sombor and reduced Sombor indices of $G$ are defined as $SO(G)=\sum_{uv\in E(G)}\sqrt{deg_G(u)^2+deg_G(v)^2}$ and $SO_{red}(G)=\sum_{uv\in…

Combinatorics · Mathematics 2021-04-01 Kinkar Chandra Das , Ali Ghalavand , Ali Reza Ashrafi

Let $R$ be a ring (not necessarily a commutative ring) with identity. The clean graph $Cl(R)$ of a ring $R$ is a graph with vertices in the form of an ordered pair $(e,u)$, where $e$ is an idempotent and $u$ is a unit of ring $R$,…

Combinatorics · Mathematics 2025-11-26 Randhir Singh , S. C. Patekar

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

For a simple connected graph $G=(V,E)$, let $d(u)$ be the degree of the vertex $u$ of $G$. The general Sombor index of $G$ is defined as $$SO_{\alpha}(G)=\sum_{uv\in E} \left[d(u)^2+d(v)^2\right]^\alpha$$ where $SO(G)=SO_{0.5}(G)$ is the…

Combinatorics · Mathematics 2022-11-08 Peichao Wei , Muhuo Liu

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

Let $R$ be a finite ring with identity. The clean graph $Cl(R)$ of a ring $R$ is a graph whose vertices are pairs $(e, u)$, where $e$ is an idempotent element and $u$ is a unit of $R$. Two distinct vertices $(e, u)$ and $(f, v)$ are…

Combinatorics · Mathematics 2025-09-16 Felicia Servina Djuang , Indah Emilia Wijayanti , Yeni Susanti

Let R be a ring (not necessarily commutative ring) with identity. The clean graph Cl(R) of a ring R is a graph with vertices in the form of ordered pair (e; u), where e is an idempotent of the ring R and u is a unit of the ring R. Two…

Combinatorics · Mathematics 2023-01-24 Randhir Singh , S. C. Patekar

For a graph $G$ with edge set $E$, let $d(u)$ denote the degree of a vertex $u$ in $G$. The diminished Sombor (DSO) index of $G$ is defined as $DSO(G)=\sum_{uv\in E}\sqrt{(d(u))^2+(d(v))^2}(d(u)+d(v))^{-1}$. The cyclomatic number of a graph…

Combinatorics · Mathematics 2025-09-17 Abdulaziz Mutlaq Alotaibi , Abdulaziz M. Alanazi , Taher S. Hassan , Akbar Ali

The general Sombor index of $G$ is defined as $SO_{\alpha}(G)= \sum_{uv\in G}\left(d^2_{G}(u)+d^2_{G}(v)\right)^{\alpha}$. For $0<\alpha<1$, we have the upper bound of $SO_{\alpha}(G)$ on unicyclic graphs with a fixed diameter, and the…

Combinatorics · Mathematics 2022-08-02 Xipeng Hu , Lingping Zhong

Recently, Gutman [MATCH Commun. Math. Comput. Chem. 86 (2021) 11-16] defined a new graph invariant which is named the Sombor index $\mathrm{SO}(G)$ of a graph $G$ and is computed via the expression \[ \mathrm{SO}(G) = \sum_{u \sim v}…

Combinatorics · Mathematics 2024-05-24 Ivan Damnjanović , Dragan Stevanović

Let $G=(V, E)$ be a simple graph with vertex set $V$ and edge set $E$. The Sombor index of the graph $G$ is a degree-based topological index, defined as $$SO(G)=\sum_{uv \in E}\sqrt{d(u)^2+d(v)^2},$$ in which $d(x)$ is the degree of the…

Combinatorics · Mathematics 2022-11-14 Fateme Movahedi

The Hyperbolic Sombor index $HSO(G)$ of a graph $G$ is defined as \begin{align*} HSO(G) = \sum_{v_iv_j \in E(G)} \frac{\sqrt{d_i^{2}+d_j^{2}}}{\min\{d_i,d_j\}}, \end{align*} where $d_i$ and $d_j$ denote the degrees of the vertices $v_i$ and…

Combinatorics · Mathematics 2025-10-28 Kinkar Chandra Das , Sultan Ahmad

In this paper, we investigate the Diminished Sombor index (DSO), a recently introduced degree-based topological index for a simple graph $G$, defined as \[ DSO(G) = \sum_{uv \in E} \frac{\sqrt{d_u^2+d_v^2}}{d_u+d_v}, \] where $d_u$ denotes…

Combinatorics · Mathematics 2025-08-12 F. Movahedi
‹ Prev 1 2 3 10 Next ›