arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 2103.04645math.CO
收藏

具有给定匹配数的树和单圈图的Sombor指数

The Sombor index of trees and unicyclic graphs with given matching number

Ting Zhou, Zhen Lin, Lianying Miao

摘要:

2021年,Gutman引入了Sombor指数,这是一种新的基于度的拓扑分子描述符。图$G$的Sombor指数定义为$SO(G) =\sum_{uv\in E(G)}\sqrt{d^2_G(u)+d^2_G(v)}$,其中$d_G(v)$是$G$中顶点$v$的度。设$\mathscr{T}_{n,m}$和$\mathscr{U}_{n,m}$分别是具有固定匹配数$m$的$n$顶点上的树和单圈图的集合。本文在$\mathscr{T}_{n,m}$和$\mathscr{U}_{n,m}$中分别确定了具有最大Sombor指标的树和单圈图。

英文摘要:

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 degree of the vertex $v$ in $G$. Let $\mathscr{T}_{n,m}$ and $\mathscr{U}_{n,m}$ be the set of trees and unicyclic graphs on $n$ vertices with fixed matching number $m$, respectively. In this paper, the tree and the unicyclic graph with the maximum Sombor index are determined among $\mathscr{T}_{n,m}$ and $\mathscr{U}_{n,m}$, respectively.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑