相关论文: On Sombor Index of Graphs

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

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…

For a graph $G$ without isolated vertices, the inverse degree of a graph $G$ is defined as $ID(G)=\sum_{u\in V(G)}d(u)^{-1}$ where $d(u)$ is the number of vertices adjacent to the vertex $u$ in $G$. By replacing $-1$ by any non-zero real…

The diminished Sombor index $(DSO)$ of a graph $G$, introduced by Rajathagiri, is defined as $$DSO(G)=\sum_{uv\in E}\frac{\sqrt{d_u^2+d_v^2}}{d_u+d_v},$$ where $d_u$ and $d_v$ are the degrees of vertices $u$ and $v$. A graph $G$ is a…

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 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$.…

Let $d_v$ be the degree of the vertex $v$ in a connected graph $G$. The first Banhatti-Sombor index of $G$ is defined as $BSO(G) =\sum_{uv\in E(G)}\sqrt{\frac{1}{d^2_u}+\frac{1}{d^2_v}}$, which is a new vertex-degree-based topological index…

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…

A large number of graph invariants of the form $\sum_{uv \in E(G)} F(d_u,d_v)$ are studied in mathematical chemistry, where $uv$ denotes the edge of the graph $G$ connecting the vertices $u$ and $v$, and $d_u$ is the degree of the vertex…

Consider a simple graph $G$ with vertex set $V = \{v_1, v_2, \ldots, v_n\}$ and edge set $E$. The diminished Sombor matrix $M_{DS}(G)$ is constructed such that its $(i, j)$ entry is $\frac{\sqrt{d_i^2+d_j^2}}{d_i+d_j}$ if vertices $v_iv_j…

In 2024, Gutman et al. \cite{I.Gutman 3} defined a new molecular descriptor called as The Euler-Sombor $(ES)$ index of graph. By using this index we define the Euler-Sombor $(ES)$ matrix of a graph $G$ whoes $(i,j)^{th}$ entry is…

Given a graph G of order n and size m, let s(G)= sum|d(u)-2m/n|, where the sum is taken over all vertices u of G. We investigate upper and lower bounds on eigenvalues of G in terms of s(G).

We introduce the \emph{ID-index} of a finite simple connected graph. For a graph $G=(V,\ E)$ with diameter $d$, we let $f:V\longrightarrow \mathbb{R}$ assign \emph{ranks} to the vertices, then under $f$, each vertex $v$ gets a…

Let $G=(V,E)$ be a graph and $e=uv\in E$. Define $n_u(e,G)$ be the number of vertices of $G$ closer to $u$ than to $v$. The number $n_v(e,G)$ can be defined in an analogous way. The Mostar index of $G$ is a new graph invariant defined as…

In a graph, we assign distinct integers to the vertices, and take the sum of two integers if they are on two adjacent vertices. The minimum possible number of different sums is the \emph{sum index} of this graph. In this paper, we present…

Elliptic Sombor and Euler Sombor indices are recently defined topological indices using Sombor index. Elliptic sombor index is defined as $ESO(G)=\sum_{uv\in E(G)}(d_u+ d_v)\sqrt{d^2_u+ d^2_v}$ and Euler Sombor index is defined as $EU(G)=…

The harmonic index of a graph $G$ is defined as the sum of weights $\frac{2}{deg(v) + deg(u)}$ of all edges $uv$ of $E (G)$, where $deg (v)$ denotes the degree of a vertex $v$ in $V (G)$. In this note we generalize results of [L. Zhong, The…

Do\v{s}li\'{c} et al. defined the Mostar index of a graph $G$ as $Mo(G)=\sum\limits_{uv\in E(G)}|n_G(u,v)-n_G(v,u)|$, where, for an edge $uv$ of $G$, the term $n_G(u,v)$ denotes the number of vertices of $G$ that have a smaller distance in…

The distance $d(u,v)$ between the vertices $u$ and $v$ of a connected graph $G$ is defined as the number of edges in a minimal path connecting them. The \emph{transmission} of a vertex $v$ of $G$ is defined by $\sigma(v)=\sum\limits_{u\in…

Let $G$ be a graph. Denote by $d_x$, $E(G)$, and $D(G)$ the degree of a vertex $x$ in $G$, the set of edges of $G$, and the degree set of $G$, respectively. This paper proposes to investigate (both from mathematical and applications points…