arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2211.06396math.CO
收藏

给定度序列的最大Sombor指标极值树

Extremal trees for Maximum Sombor index with given degree sequence

Fateme Movahedi

摘要:

设$G=(V, E)$是一个单图,其顶点集为$V$,边集为$E$ .图$G$的Sombor指数是基于度的拓扑指数,定义为$$SO(G)=\sum_{uv \in E}\sqrt{d(u)^2+d(v)^2},$$,其中$d(x)$是$x=u, v$的顶点$x \in V$的度。在本文中,我们刻画了具有给定度序列且使Sombor指数最大化的极树。

英文摘要:

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 vertex $x \in V$ for $x=u, v$. In this paper, we characterize the extremal trees with a given degree sequence that maximizes the Sombor index.

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

↑