Related papers: Extremal trees for Maximum Sombor index with given…

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…

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,…

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…

Sombor index is a novel topological index, which was introduced by Gutman and defined for a graph $G$ as $SO(G)=\sum\limits_{uv\in E(G)}\sqrt{d_{u}^{2}+d_{v}^{2}}$, where $d_{u}=d_{G}(u)$ denotes the degree of vertex $u$ in graph $G$.…

Let $G=(V(G),E(G))$ be a graph and $d(v)$ be the degree of the vertex $v\in V(G)$. The exponential reduced Sombor index of $G$, denoted by $e^{SO_{red}}(G)$, is defined as $$e^{SO_{red}}(G)=\sum_{uv\in…

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…

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…

The Sombor index is a topological index in graph theory defined by Gutman in 2021. In this article, we find the maximum Sombor index of trees of order $\mathbf{n}$ with a given dissociation number $\varphi$, where…

Recently, a novel topological index, Sombor index, was introduced by Gutman, defined as $SO(G)=\sum\limits_{uv\in E(G)}\sqrt{d_{u}^{2}+d_{v}^{2}}$, where $d_{u}$ denotes the degree of vertex $u$. In this paper, we first determine the…

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…

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…

Vertex-degree-based topological indices have recently gained a lot of attention from mathematical chemists. One such index that we focus on in this paper is called Sombor index. After its definition in late 2020, the Sombor index was…

For a graph $G=(V,E)$ and $v_{i}\in V$, denote by $d_{v_{i}}$ (or $d_{i}$ for short) the degree of vertex $v_{i}$. The $p$-Sombor matrix $\textbf{S}_{\textbf{p}}(G)$ ($p\neq0$) of a graph $G$ is a square matrix, where the $(i,j)$-entry is…

In this paper, we refer to a asymptotic degree sequence as $\mathscr{D}=(d_1,d_2,\dots,d_n)$. The examination of topological indices on trees gives us a general overview through bounds to find the maximum and minimum bounds which reflect…

We note here that the problem of determining extremal values of Sombor index for trees with a given degree sequence fits within the framework of results by Hua Wang from [Cent. Eur. J. Math. 12 (2014) 1656-1663], implying that the greedy…

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…

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}…

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…

Let $G$ be a simple undirected graph with vertex set $V(G)=\{v_1, v_2, \ldots, v_n\}$ and edge set $E(G)$. The Sombor matrix $\mathcal{S}(G)$ of a graph $G$ is defined so that its $(i,j)$-entry is equal to $\sqrt{d_i^2+d_j^2}$ if the…

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…